REVIEW 3 cited by
Distance-based and continuum Fano inequalities with applications to statistical estimation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In this technical note, we give two extensions of the classical Fano inequality in information theory. The first extends Fano's inequality to the setting of estimation, providing lower bounds on the probability that an estimator of a discrete quantity is within some distance $t$ of the quantity. The second inequality extends our bound to a continuum setting and provides a volume-based bound. We illustrate how these inequalities lead to direct and simple proofs of several statistical minimax lower bounds.
Forward citations
Cited by 3 Pith papers
-
On the Gradient Complexity of Private Optimization with Private Oracles
For high-dimensional non-smooth convex losses, any optimizer using a private gradient oracle needs Ω(√d/α²) gradient evaluations—a √d dimension penalty absent without privacy.
-
Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms
Filtering-based robust multi-task gradient descent matches minimax rates under task contamination and heterogeneity, removing the √d contamination barrier of regularization and score-based methods.
-
Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy
Derives explicit minimax quantile lower bounds for Gaussian mean estimation and K-armed bandits under interactive decision making and MI privacy, with log(1/δ)/n and √(KT log(1/δ)) scalings.
Discussion (0). Sign in to comment.