An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation
Not on the map. Why?
Abstract (arXiv)
Information theory plays an indispensable role in the development of algorithm-independent impossibility results, both for communication problems and for seemingly distinct areas such as statistics and machine learning. While numerous information-theoretic tools have been proposed for this purpose, the oldest one remains arguably the most versatile and widespread: Fano's inequality. In this chapter, we provide a survey of Fano's inequality and its variants in the context of statistical estimation, adopting a versatile framework that covers a wide range of specific problems. We present a variety of key tools and techniques used for establishing impossibility results via this approach, and provide representative examples covering group testing, graphical model selection, sparse linear regression, density estimation, and convex optimization.
Key facts. Cited by 30 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Jan 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 6; 2023: 3; 2024: 7; 2025: 3; 2026: 7.
30 papers.
Sort:
By area:
- 2021Adversarial Attacks are Reversible with Natural Supervisioncited by 47
- 2024How Much Can RAG Help the Reasoning of LLM?cited by 31
- 2022Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variancecited by 22
- 2023Fairness through Aleatoric Uncertaintycited by 16
- 2021Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priorscited by 14
- 2022Non-Iterative Recovery from Nonlinear Observations using Generative Modelscited by 9
- 2024PRSA: Prompt Stealing Attacks against Real-World Prompt Servicescited by 9
- 2021The Complexity of Sparse Tensor PCAcited by 7
- 2021Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priorscited by 7
- 2022On the Statistical Complexity of Estimation and Testing under Privacy Constraintscited by 6
- 2023RecFusion: A Binomial Diffusion Process for 1D Data for Recommendationcited by 6
- 2024How many samples are needed to train a deep neural network?cited by 5
18 more
- 2022On the well-spread property and its relation to linear regressioncited by 4
- 2024Retraining with Predicted Hard Labels Provably Increases Model Accuracycited by 4
- 2022On Average-Case Error Bounds for Kernel-Based Bayesian Quadraturecited by 3
- 2024On Bits and Bandits: Quantifying the Regret-Information Trade-offcited by 3
- 2024Semi-Supervised Sparse Gaussian Classification: Provable Benefits of Unlabeled Datacited by 3
- 2025Diffuse Thinking: Exploring Diffusion Language Models as Efficient Thought Proposers for Reasoningcited by 3
- 2023Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraintscited by 2
- 2025Learning Single Index Models with Diffusion Priorscited by 2
- 2026Tackling the Inherent Difficulty of Noise Filtering in RAGcited by 2
- 2026Adaptive Confidence Regularization for Multimodal Failure Detectioncited by 1
- 2022Entropy-driven Unsupervised Keypoint Representation Learning in Videoscited by 0
- 2024Contrastive Learning to Fine-Tune Feature Extraction Models for the Visual Cortexcited by 0
- 2025No-Regret Gaussian Process Optimization of Time-Varying Functionscited by 0
- 2026Separating Oblivious and Adaptive Models of Variable Selectioncited by 0
- 2026Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learningcited by 0
- 2026On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimizationcited by 0
- 2026On the Invariance and Generality of Neural Scaling Lawscited by 0
- 2026On the Structural Limits of Machine Learning Decision Systems: An Information-Theoretic, Interaction-Based, and Stochastic-Dynamical Perspectivecited by 0
- 2026On the Structural Limits of Machine Learning Decision Systems: An Information-Theoretic, Interaction-Based, and Stochastic-Dynamical Perspective13 Aug 2026
- 2026On the Invariance and Generality of Neural Scaling Laws8 May 2026
- 2026On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization19 Mar 2026
- 2026Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learning16 Mar 2026
- 2026Adaptive Confidence Regularization for Multimodal Failure Detection2 Mar 2026
- 2026Separating Oblivious and Adaptive Models of Variable Selection18 Feb 2026
- 2026Tackling the Inherent Difficulty of Noise Filtering in RAG5 Jan 2026
- 2025No-Regret Gaussian Process Optimization of Time-Varying Functions29 Nov 2025
- 2025Diffuse Thinking: Exploring Diffusion Language Models as Efficient Thought Proposers for Reasoning31 Oct 2025
- 2025Learning Single Index Models with Diffusion Priors27 May 2025
- 2024Contrastive Learning to Fine-Tune Feature Extraction Models for the Visual Cortex8 Oct 2024
- 2024How Much Can RAG Help the Reasoning of LLM?3 Oct 2024
18 more
- 2024Semi-Supervised Sparse Gaussian Classification: Provable Benefits of Unlabeled Data5 Sep 2024
- 2024Retraining with Predicted Hard Labels Provably Increases Model Accuracy17 Jun 2024
- 2024How many samples are needed to train a deep neural network?26 May 2024
- 2024On Bits and Bandits: Quantifying the Regret-Information Trade-off26 May 2024
- 2024PRSA: Prompt Stealing Attacks against Real-World Prompt Services29 Feb 2024
- 2023Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints31 Oct 2023
- 2023RecFusion: A Binomial Diffusion Process for 1D Data for Recommendation15 Jun 2023
- 2023Fairness through Aleatoric Uncertainty7 Apr 2023
- 2022On the Statistical Complexity of Estimation and Testing under Privacy Constraints5 Oct 2022
- 2022Entropy-driven Unsupervised Keypoint Representation Learning in Videos30 Sep 2022
- 2022On the well-spread property and its relation to linear regression16 Jun 2022
- 2022Non-Iterative Recovery from Nonlinear Observations using Generative Models31 May 2022
- 2022Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance23 Feb 2022
- 2022On Average-Case Error Bounds for Kernel-Based Bayesian Quadrature22 Feb 2022
- 2021Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors8 Aug 2021
- 2021Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors29 Jun 2021
- 2021The Complexity of Sparse Tensor PCA11 Jun 2021
- 2021Adversarial Attacks are Reversible with Natural Supervision26 Mar 2021
- 2025Learning Single Index Models with Diffusion Priors27 May 2025
- 2023RecFusion: A Binomial Diffusion Process for 1D Data for Recommendation15 Jun 2023
- 2021Adversarial Attacks are Reversible with Natural Supervisioncited by 47
- 2022Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variancecited by 22
- 2023Fairness through Aleatoric Uncertaintycited by 16
- 2021Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priorscited by 14
- 2022Non-Iterative Recovery from Nonlinear Observations using Generative Modelscited by 9
- 2024PRSA: Prompt Stealing Attacks against Real-World Prompt Servicescited by 9
- 2021The Complexity of Sparse Tensor PCAcited by 7
- 2021Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priorscited by 7
- 2022On the Statistical Complexity of Estimation and Testing under Privacy Constraintscited by 6
- 2024How many samples are needed to train a deep neural network?cited by 5
- 2022On the well-spread property and its relation to linear regressioncited by 4
- 2024Retraining with Predicted Hard Labels Provably Increases Model Accuracycited by 4
12 most cited of 25 All 25 (JSON)
- 2026On the Structural Limits of Machine Learning Decision Systems: An Information-Theoretic, Interaction-Based, and Stochastic-Dynamical Perspective13 Aug 2026
- 2026On the Invariance and Generality of Neural Scaling Laws8 May 2026
- 2026On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization19 Mar 2026
- 2026Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learning16 Mar 2026
- 2026Adaptive Confidence Regularization for Multimodal Failure Detection2 Mar 2026
- 2026Separating Oblivious and Adaptive Models of Variable Selection18 Feb 2026
- 2025No-Regret Gaussian Process Optimization of Time-Varying Functions29 Nov 2025
- 2024Contrastive Learning to Fine-Tune Feature Extraction Models for the Visual Cortex8 Oct 2024
- 2024Semi-Supervised Sparse Gaussian Classification: Provable Benefits of Unlabeled Data5 Sep 2024
- 2024Retraining with Predicted Hard Labels Provably Increases Model Accuracy17 Jun 2024
- 2024How many samples are needed to train a deep neural network?26 May 2024
- 2024On Bits and Bandits: Quantifying the Regret-Information Trade-off26 May 2024
12 newest of 25 All 25 (JSON)