On the statistical complexity of sample amplification

DOI10.1214/24-AOS2444MaRDI QIDQ7035865zbMATH OpenFDO

Authors Brian Axelrod, Shivam Garg, Yanjun Han, Vatsal Sharan, Gregory Valiant

Publication date 29 January 2025

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/annals-of-statistics/volume-52/issue-6/On-the-statistical-complexity-of-sample-amplification/10.1214/24-AOS2444.full

zbMATH Keywords

Le Cam's distanceminimax ratesample amplification

Mathematics Subject Classification ID

Theory of statistical experiments (62B15) Minimax procedures in statistical decision theory (62C20)

Cites work

• Asymptotic development for the CLT in total variation distance
• Asymptotic equivalence of nonparametric regression and white noise
• Asymptotic equivalence theory for nonparametric regression with random design
• Asymptotic methods in statistical decision theory
• Asymptotic nonequivalence of density estimation and Gaussian white noise for small densities
• Asymptotic Statistics
• Asymptotics in statistics: some basic concepts
• Berry-Esseen bounds in the entropic central limit theorem
• Computational barriers in minimax submatrix detection
• Conjugate priors for exponential families
• Entropy and the central limit theorem
• Equivalence theory for density estimation, Poisson processes and Gaussian white noise with drift
• scientific article; zbMATH DE number 3115454 (Why is no real title available?)
• scientific article; zbMATH DE number 3148841 (Why is no real title available?)
• scientific article; zbMATH DE number 3158371 (Why is no real title available?)
• scientific article; zbMATH DE number 3768757 (Why is no real title available?)
• scientific article; zbMATH DE number 107499 (Why is no real title available?)
• scientific article; zbMATH DE number 3061365 (Why is no real title available?)
• scientific article; zbMATH DE number 3072475 (Why is no real title available?)
• Introduction to nonparametric estimation
• Introductory lectures on convex optimization. A basic course.
• Minimax Estimation of Discrete Distributions Under <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula> Loss
• Normal approximation and asymptotic expansions.
• On Convergence in the Mean for Densities
• On the distances between probability density functions
• On the statistical complexity of sample amplification
• Optimal detection of sparse principal components in high dimension
• Statistical decision theory. Estimation, testing, and selection.
• Sufficiency and Approximate Sufficiency

Cited in

(1)

• On the statistical complexity of sample amplification

This page was built for publication: On the statistical complexity of sample amplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7035865)