Copertina

On the Sample Complexity of Robust Binary Hypothesis Testing

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Vallinayagam, Shankar, Pensia, Ankit, Jog, Varun
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Statistics Theory Information Theory Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

Robust Sparse Mean Estimation via Sum of Squares
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2022)

Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

Optimal Anytime-Valid Tests for Composite Nulls
di: Shekhar, Shubhanshu
Pubblicazione: (2025)

Robust Multi-Hypothesis Testing with Moment Constrained Uncertainty Sets
di: Magesh, Akshayaa, et al.
Pubblicazione: (2022)

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

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

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

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

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

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

Robust Estimation Under Heterogeneous Corruption Rates
di: Chaudhuri, Syomantak, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

Improved Sample Complexity Bounds for Diffusion Model Training
di: Gupta, Shivam, et al.
Pubblicazione: (2023)

Hypothesis Testing for Generalized Thurstone Models
di: Makur, Anuran, et al.
Pubblicazione: (2025)

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

List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2022)

Classifier-Based Nonparametric Sequential Hypothesis Testing
di: Hsu, Chia-Yu, et al.
Pubblicazione: (2026)