Lower Bounds for the Minimax Risk Using $f$-Divergences, and Applications
From MaRDI portal
Publication:5280999
DOI10.1109/TIT.2011.2110791zbMath1366.94143arXiv1002.0042OpenAlexW2101210333MaRDI QIDQ5280999
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.0042
Point estimation (62F10) Minimax procedures in statistical decision theory (62C20) Detection theory in information and communication theory (94A13)
Related Items (max. 100)
Obtaining minimax lower bounds: a review ⋮ How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning ⋮ Adaptive estimation of convex polytopes and convex sets from noisy data ⋮ Optimal rates of convergence for convex set estimation from support functions ⋮ Fano's inequality for random variables ⋮ A new class of metrics for learning on real-valued and structured data ⋮ A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ⋮ Unnamed Item ⋮ Rate-optimal graphon estimation ⋮ Unnamed Item
This page was built for publication: Lower Bounds for the Minimax Risk Using $f$-Divergences, and Applications