Copertina

Sample efficient inductive matrix completion with noise and inexact side information

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Yang, Yuepeng, Ma, Cong
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Information Theory Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimal tuning-free convex relaxation for noisy matrix completion
di: Yang, Yuepeng, et al.
Pubblicazione: (2022)

Random pairing MLE for estimation of item parameters in Rasch model
di: Yang, Yuepeng, et al.
Pubblicazione: (2024)

Top-$K$ ranking with a monotone adversary
di: Yang, Yuepeng, et al.
Pubblicazione: (2024)

Estimating shared subspace with AJIVE: the power and limitation of multiple data matrices
di: Yang, Yuepeng, et al.
Pubblicazione: (2025)

Low-rank matrix completion and denoising under Poisson noise
di: McRae, Andrew D., et al.
Pubblicazione: (2019)

Fundamental limits of distributed covariance matrix estimation via a conditional strong data processing inequality
di: Rahmani, Mohammad Reza, et al.
Pubblicazione: (2025)

Agnostic Sample Compression Schemes for Regression
di: Attias, Idan, et al.
Pubblicazione: (2018)

Breaking the Finite-Sample Barrier in Entropy Coupling
di: Asoodeh, Shahab, et al.
Pubblicazione: (2026)

On the Sample Complexity of Robust Binary Hypothesis Testing
di: Vallinayagam, Shankar, et al.
Pubblicazione: (2026)

The Sample Complexity of Simple Binary Hypothesis Testing
di: Pensia, Ankit, et al.
Pubblicazione: (2024)

On the best approximation by finite Gaussian mixtures
di: Ma, Yun, et al.
Pubblicazione: (2024)

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
di: Dmitriev, Daniil, et al.
Pubblicazione: (2026)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
di: Lau, Ivan, et al.
Pubblicazione: (2025)

Distributed Nonparametric Estimation: from Sparse to Dense Samples per Terminal
di: Yuan, Deheng, et al.
Pubblicazione: (2025)

Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
di: Li, Gen, et al.
Pubblicazione: (2025)

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
di: Kazemi, Hadi, et al.
Pubblicazione: (2025)

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
di: Liang, Jiaming, et al.
Pubblicazione: (2024)

Data efficiency, dimensionality reduction, and the generalized symmetric information bottleneck
di: Martini, K. Michael, et al.
Pubblicazione: (2023)

Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
di: Chen, Haohua, et al.
Pubblicazione: (2026)

Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
di: Chen, Haohua, et al.
Pubblicazione: (2025)

High-probability sample complexities for policy evaluation with linear function approximation
di: Li, Gen, et al.
Pubblicazione: (2023)

Computationally efficient reductions between some statistical models
di: Lou, Mengqi, et al.
Pubblicazione: (2024)

Generalization of LiNGAM that allows confounding
di: Suzuki, Joe, et al.
Pubblicazione: (2024)

Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
di: Huang, Dong, et al.
Pubblicazione: (2024)

Statistical Mean Estimation with Coded Relayed Observations
di: Ling, Yan Hao, et al.
Pubblicazione: (2025)

Sample Complexity of Composite Quantum Hypothesis Testing
di: Simpson, Jacob Paul, et al.
Pubblicazione: (2026)

Asymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
di: Fan, Jianqing, et al.
Pubblicazione: (2025)

Unifying AMP Algorithms for Rotationally-Invariant Models
di: Liu, Songbin, et al.
Pubblicazione: (2024)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
di: Li, Gen, et al.
Pubblicazione: (2022)

When Are Trade-Off Functions Testable from Finite Samples?
di: Shi, Kaining, et al.
Pubblicazione: (2026)

Optimality of Approximate Message Passing Algorithms for Spiked Matrix Models with Rotationally Invariant Noise
di: Dudeja, Rishabh, et al.
Pubblicazione: (2024)

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
di: Stöger, Dominik, et al.
Pubblicazione: (2024)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
di: Li, Gen, et al.
Pubblicazione: (2021)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
di: Li, Gen, et al.
Pubblicazione: (2020)

Bayes optimal learning in high-dimensional linear regression with network side information
di: Nandy, Sagnik, et al.
Pubblicazione: (2023)

On the Statistical Complexity of Sample Amplification
di: Axelrod, Brian, et al.
Pubblicazione: (2022)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
di: Kim, Gilhan
Pubblicazione: (2026)

Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
di: Lovig, Max
Pubblicazione: (2026)

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
di: Lau, Ivan, et al.
Pubblicazione: (2026)

Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
di: Wu, Jingda, et al.
Pubblicazione: (2026)