Cover Image

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kazemi, Hadi, Pensia, Ankit, Jog, Varun
Format:	Preprint
Published:	2025
Subjects:	Information Theory Statistics Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
by: Pensia, Ankit
Published: (2024)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
by: Pittas, Thanasis, et al.
Published: (2024)

On Robust Hypothesis Testing with respect to the Hellinger Distance
by: Modak, Eeshan, et al.
Published: (2025)

Minimax Hypothesis Testing for the Bradley-Terry-Luce Model
by: Makur, Anuran, et al.
Published: (2024)

Statistical Unlearning of Distributions: A Hypothesis Testing Approach
by: Pandey, Aaradhya, et al.
Published: (2026)

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

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
by: Diakonikolas, Ilias, et al.
Published: (2024)

Adaptive Refinement Protocols for Distributed Distribution Estimation under $\ell^p$-Losses
by: Yuan, Deheng, et al.
Published: (2024)

Optimal Decision Rules for Composite Binary Hypothesis Testing under Neyman-Pearson Framework
by: Song, Yanglei, et al.
Published: (2025)

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

Variational Representations of Annealing Paths: Bregman Information under Monotonic Embedding
by: Brekelmans, Rob, et al.
Published: (2022)

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

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
by: Diakonikolas, Ilias, et al.
Published: (2024)

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

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

Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
by: Diakonikolas, Ilias, et al.
Published: (2025)

From Asymptotic to Finite-Sample Minimax Robust Hypothesis Testing
by: Gül, Gökhan
Published: (2026)

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

A Distribution Testing Approach to Clustering Distributions
by: Kumar, Gunjan, et al.
Published: (2025)

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

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

Optimal Anytime-Valid Tests for Composite Nulls
by: Shekhar, Shubhanshu
Published: (2025)

Distribution free M-estimation
by: Areces, Felipe, et al.
Published: (2025)

Optimal Rates for Differentially Private Hypothesis Testing with E-values
by: Jacobsen, Ben, et al.
Published: (2026)

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

High-dimensional estimation with missing data: Statistical and computational limits
by: Verchand, Kabir Aladin, et al.
Published: (2026)

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

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

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

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

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

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

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

Finite-length Analysis on Tail probability for Markov Chain and Application to Simple Hypothesis Testing
by: Watanabe, Shun, et al.
Published: (2014)

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

Statistical Hypothesis Testing for Information Value (IV)
by: Rojas, Helder, et al.
Published: (2023)

Precise analysis of ridge interpolators under heavy correlations -- a Random Duality Theory view
by: Stojnic, Mihailo
Published: (2024)