Cover Image

Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns through the Lens of Network Flows

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Yudong, Xi, Xumei, Yu, Christina Lee
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling
by: Xi, Xumei, et al.
Published: (2024)

Tensor Completion with Nearly Linear Samples Given Weak Side Information
by: Yu, Christina Lee, et al.
Published: (2020)

Local Minima Structures in Gaussian Mixture Models
by: Chen, Yudong, et al.
Published: (2020)

The Limits of Transfer Reinforcement Learning with Latent Low-rank Structure
by: Sam, Tyler, et al.
Published: (2024)

The $φ$ Curve: The Shape of Generalization through the Lens of Norm-based Capacity Control
by: Wang, Yichen, et al.
Published: (2025)

Structured Matrix Learning under Arbitrary Entrywise Dependence and Estimation of Markov Transition Kernel
by: Chai, Jinhang, et al.
Published: (2024)

Understanding the Failure Modes of Transformers through the Lens of Graph Neural Networks
by: Lee, Hunjae
Published: (2025)

Model-free Low-Rank Reinforcement Learning via Leveraged Entry-wise Matrix Estimation
by: Stojanovic, Stefan, et al.
Published: (2024)

Exploring Multiple High-Scoring Subspaces in Generative Flow Networks
by: Yu, Xuan, et al.
Published: (2026)

Incorporating Arbitrary Matrix Group Equivariance into KANs
by: Hu, Lexiang, et al.
Published: (2024)

Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry
by: Chen, Ziheng, et al.
Published: (2024)

Generalization of Graph Neural Networks through the Lens of Homomorphism
by: Li, Shouheng, et al.
Published: (2024)

G-RepsNet: A Fast and General Construction of Equivariant Networks for Arbitrary Matrix Groups
by: Basu, Sourya, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

Disentangling Hyperedges through the Lens of Category Theory
by: Lee, Yoonho, et al.
Published: (2025)

Understanding Likelihood of Normalizing Flow and Image Complexity through the Lens of Out-of-Distribution Detection
by: Osada, Genki, et al.
Published: (2024)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

Towards Optimal Environmental Policies: Policy Learning under Arbitrary Bipartite Network Interference
by: Kim, Raphael C., et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

Calibration through the Lens of Interpretability
by: Torabian, Alireza, et al.
Published: (2024)

Exploring Activation Patterns of Parameters in Language Models
by: Wang, Yudong, et al.
Published: (2024)

Flow Matching with Arbitrary Auxiliary Paths
by: Peng, Xin, et al.
Published: (2026)

Identification of Causal Direction under an Arbitrary Number of Latent Confounders
by: Chen, Wei, et al.
Published: (2025)

Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness
by: Mao, Xiaojun, et al.
Published: (2024)

Planning-Augmented Sampling with Early Guidance for High-Reward Discovery
by: Zhu, Rui, et al.
Published: (2025)

Forecasting Sparse Movement Speed of Urban Road Networks with Nonstationary Temporal Matrix Factorization
by: Chen, Xinyu, et al.
Published: (2022)

Sampling-Free Privacy Accounting for Matrix Mechanisms under Random Allocation
by: Schuchardt, Jan, et al.
Published: (2026)

Minimax and Adaptive Covariance Matrix Estimation under Differential Privacy
by: Cai, T. Tony, et al.
Published: (2026)

EntryPrune: Neural Network Feature Selection using First Impressions
by: Zimmer, Felix, et al.
Published: (2024)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

Sample Complexity Bounds for Estimating Probability Divergences under Invariances
by: Tahmasebi, Behrooz, et al.
Published: (2023)

On Equivariant Model Selection through the Lens of Uncertainty
by: van der Linden, Putri A., et al.
Published: (2025)

Hierarchic Flows to Estimate and Sample High-dimensional Probabilities
by: Lempereur, Etienne, et al.
Published: (2024)

Zero-Shot Neural Network Evaluation with Sample-Wise Activation Patterns
by: Peng, Yameng, et al.
Published: (2026)

Dynamic Origin-Destination Matrix Prediction with Line Graph Neural Networks and Kalman Filter
by: Xiong, Xi, et al.
Published: (2019)

Revisiting LoRA through the Lens of Parameter Redundancy: Spectral Encoding Helps
by: Cheng, Jiashun, et al.
Published: (2025)

On the Benefits of Weight Normalization for Overparameterized Matrix Sensing
by: Wei, Yudong, et al.
Published: (2025)

Functional Gradient Flows for Constrained Sampling
by: Zhang, Shiyue, et al.
Published: (2024)

Optimizing Quantum Convolutional Neural Network Architectures for Arbitrary Data Dimension
by: Lee, Changwon, et al.
Published: (2024)