Cover Image

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Compton, Spencer, Valiant, Gregory
Format:	Preprint
Published:	2025
Subjects:	Statistics Theory Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses
by: Pabbaraju, Chirag, et al.
Published: (2025)

Testing with Non-identically Distributed Samples
by: Garg, Shivam, et al.
Published: (2023)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
by: Gay, William, et al.
Published: (2025)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
by: Diakonikolas, Ilias, et al.
Published: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)

The Geometry of Efficient Nonconvex Sampling
by: Vempala, Santosh S., et al.
Published: (2026)

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

Smoothed Analysis of Learning from Positive Samples
by: Lee, Jane H., et al.
Published: (2025)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
by: Kook, Yunbum, et al.
Published: (2024)

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
by: Kook, Yunbum, et al.
Published: (2024)

Sample-Efficient Private Learning of Mixtures of Gaussians
by: Ashtiani, Hassan, et al.
Published: (2024)

Complexity of Non-Log-Concave Sampling in Fisher Information
by: Chewi, Sinho, et al.
Published: (2026)

Sample-Efficient Linear Regression with Self-Selection Bias
by: Gaitonde, Jason, et al.
Published: (2024)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
by: Gupta, Shivam, et al.
Published: (2024)

Entangled Mean Estimation in High-Dimensions
by: Diakonikolas, Ilias, et al.
Published: (2025)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
by: Hanneke, Steve, et al.
Published: (2026)

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

Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
by: Gomez-Leos, Alejandro, et al.
Published: (2024)

Mean Estimation from Coarse Data: Characterizations and Efficient Algorithms
by: Kalavasis, Alkis, et al.
Published: (2026)

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
by: Diakonikolas, Ilias, et al.
Published: (2026)

Nearly Optimal Robust Covariance and Scatter Matrix Estimation Beyond Gaussians
by: Novikov, Gleb
Published: (2025)

Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination
by: Diakonikolas, Ilias, et al.
Published: (2025)

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

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

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

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models
by: Diakonikolas, Ilias, et al.
Published: (2024)

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

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

High-Accuracy List-Decodable Mean Estimation
by: Chen, Ziyun, et al.
Published: (2025)

A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
by: Rivkin, Joey, et al.
Published: (2024)

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

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
by: Diakonikolas, Ilias, et al.
Published: (2025)

Efficient Parameter Estimation of Truncated Boolean Product Distributions
by: Fotakis, Dimitris, et al.
Published: (2020)

Adaptive and oblivious statistical adversaries are equivalent
by: Blanc, Guy, et al.
Published: (2024)

Query Lower Bounds for Diffusion Sampling
by: Xun, Zhiyang, et al.
Published: (2026)

Almost-Optimal Local-Search Methods for Sparse Tensor PCA
by: Lovig, Max, et al.
Published: (2025)

Batch List-Decodable Linear Regression via Higher Moments
by: Diakonikolas, Ilias, et al.
Published: (2025)

Fast Tensor Completion via Approximate Richardson Iteration
by: Ghadiri, Mehrdad, et al.
Published: (2025)

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