Image de couverture de livre

Breaking the Finite-Sample Barrier in Entropy Coupling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Asoodeh, Shahab, Chen, Jun
Format:	Preprint
Publié:	2026
Sujets:	Information Theory Statistics Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Contraction of Locally Differentially Private Mechanisms
par: Asoodeh, Shahab, et autres
Publié: (2022)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
par: Li, Gen, et autres
Publié: (2020)

Differentially Private Fair Binary Classifications
par: Ghoukasian, Hrad, et autres
Publié: (2024)

Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity
par: Pour, Alireza F., et autres
Publié: (2023)

Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
par: Li, Gen, et autres
Publié: (2025)

Coupled Entropy: A Goldilocks Generalization for Complex Systems
par: Nelson, Kenric P.
Publié: (2025)

Empirical Risk Minimization with Relative Entropy Regularization
par: Perlaza, Samir M., et autres
Publié: (2022)

Optimality of Staircase Mechanisms for Vector Queries under Differential Privacy
par: Melbourne, James, et autres
Publié: (2026)

Agnostic Sample Compression Schemes for Regression
par: Attias, Idan, et autres
Publié: (2018)

On the Sample Complexity of Robust Binary Hypothesis Testing
par: Vallinayagam, Shankar, et autres
Publié: (2026)

The Sample Complexity of Simple Binary Hypothesis Testing
par: Pensia, Ankit, et autres
Publié: (2024)

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
par: Dmitriev, Daniil, et autres
Publié: (2026)

Sample efficient inductive matrix completion with noise and inexact side information
par: Yang, Yuepeng, et autres
Publié: (2026)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
par: Lau, Ivan, et autres
Publié: (2025)

Distributed Nonparametric Estimation: from Sparse to Dense Samples per Terminal
par: Yuan, Deheng, et autres
Publié: (2025)

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
par: Kazemi, Hadi, et autres
Publié: (2025)

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
par: Liang, Jiaming, et autres
Publié: (2024)

Neural Entropy
par: Premkumar, Akhil
Publié: (2024)

Locally Optimal Private Sampling: Beyond the Global Minimax
par: Ghoukasian, Hrad, et autres
Publié: (2025)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
par: Li, Gen, et autres
Publié: (2022)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
par: Li, Gen, et autres
Publié: (2021)

Minimum Entropy Coupling with Bottleneck
par: Ebrahimi, M. Reza, et autres
Publié: (2024)

MESSY Estimation: Maximum-Entropy based Stochastic and Symbolic densitY Estimation
par: Tohme, Tony, et autres
Publié: (2023)

Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
par: Chen, Haohua, et autres
Publié: (2026)

Optimal training-conditional regret for online conformal prediction
par: Liang, Jiadong, et autres
Publié: (2026)

Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
par: Chen, Haohua, et autres
Publié: (2025)

Sample Complexity of Composite Quantum Hypothesis Testing
par: Simpson, Jacob Paul, et autres
Publié: (2026)

Top-$K$ ranking with a monotone adversary
par: Yang, Yuepeng, et autres
Publié: (2024)

Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
par: Li, Gen, et autres
Publié: (2023)

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
par: Stöger, Dominik, et autres
Publié: (2024)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
par: Shi, Laixi, et autres
Publié: (2023)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
par: Chen, Fan, et autres
Publié: (2024)

Decoupled Entropy Minimization
par: Ma, Jing, et autres
Publié: (2025)

Functional Properties of the Focal-Entropy
par: Shah, Jaimin, et autres
Publié: (2026)

On the Statistical Complexity of Sample Amplification
par: Axelrod, Brian, et autres
Publié: (2022)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
par: Kim, Gilhan
Publié: (2026)

Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA
par: Zhou, Yuchen, et autres
Publié: (2023)

Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
par: Lovig, Max
Publié: (2026)

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
par: Lau, Ivan, et autres
Publié: (2026)

Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
par: Wu, Jingda, et autres
Publié: (2026)