Cover Image

Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chaabouni, Youssef, Gamarnik, David
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Information Theory Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements
by: Chaabouni, Youssef, et al.
Published: (2025)

Sparse Max-Affine Regression
by: Kanj, Haitham, et al.
Published: (2024)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
by: Shi, Laixi, et al.
Published: (2023)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
by: Praharaj, Samya, et al.
Published: (2025)

Mixed Regression via Approximate Message Passing
by: Tan, Nelvin, et al.
Published: (2023)

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

Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models
by: Zhang, Yihan, et al.
Published: (2022)

Unbiased Estimating Equation on Inverse Divergence and Its Conditions
by: Kobayashi, Masahiro, et al.
Published: (2024)

High-dimensional Clustering and Signal Recovery under Block Signals
by: Su, Wu, et al.
Published: (2025)

Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery
by: Kovačević, Filip, et al.
Published: (2025)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
by: Wibisono, Andre
Published: (2025)

Harnessing Multiple Correlated Networks for Exact Community Recovery
by: Rácz, Miklós Z., et al.
Published: (2024)

Online Clustering of Data Sequences with Bandit Information
by: Chandran, G Dhinesh, et al.
Published: (2025)

Perfect Recovery for Random Geometric Graph Matching with Shallow Graph Neural Networks
by: Liu, Suqi, et al.
Published: (2024)

An Algorithm for Streaming Differentially Private Data
by: Kumar, Girish, et al.
Published: (2024)

Inference for Heteroskedastic PCA with Missing Data
by: Yan, Yuling, et al.
Published: (2021)

Sparse graphs using exchangeable random measures
by: Caron, François, et al.
Published: (2014)

Robust Sparse Recovery with Sparse Bernoulli matrices via Expanders
by: Abdalla, Pedro
Published: (2021)

Generalized Data Thinning Using Sufficient Statistics
by: Dharamshi, Ameer, et al.
Published: (2023)

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

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

Sample efficient inductive matrix completion with noise and inexact side information
by: Yang, Yuepeng, et al.
Published: (2026)

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

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

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

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

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

Minimax optimal differentially private synthetic data for smooth queries
by: Ding, Rundong, et al.
Published: (2026)

Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis
by: Miyagawa, Taiki, et al.
Published: (2026)

Minimax optimal submatrix detection: Sharp non-asymptotic rates
by: Knight, Parker, et al.
Published: (2026)

Adaptation to Intrinsic Dependence in Diffusion Language Models
by: Zhao, Yunxiao, et al.
Published: (2026)

Optimal training-conditional regret for online conformal prediction
by: Liang, Jiadong, et al.
Published: (2026)

Thompson sampling: Precise arm-pull dynamics and adaptive inference
by: Han, Qiyang
Published: (2026)

On the Nonasymptotic Scaling Guarantee of Hyperparameter Estimation in Inhomogeneous, Weakly-Dependent Complex Network Dynamical Systems
by: Yu, Yi, et al.
Published: (2026)

Instance-Optimal Estimation with Multiple LLM Judges on a Budget
by: Lee, Junghyun, et al.
Published: (2026)

On Observation Time for Recovering Latent Hawkes Networks
by: Linkerhägner, Jonas, et al.
Published: (2026)

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

Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)

Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
by: Dudeja, Rishabh, et al.
Published: (2022)

Efficient Unbiased Sparsification
by: Barnes, Leighton, et al.
Published: (2024)