Fundamental Tradeoffs in Learning with Prior Information
Anirudha Majumdar
Abstract
We seek to understand fundamental tradeoffs between the accuracy of prior information that a learner has on a given problem and its learning performance. We introduce the notion of prioritized risk, which differs from traditional notions of minimax and Bayes risk by allowing us to study such fundamental tradeoffs in settings where reality does not necessarily conform to the learner's prior. We present a general reduction-based approach for extending classical minimax lower-bound techniques in order to lower bound the prioritized risk for statistical estimation problems. We also introduce a novel generalization of Fano's inequality (which may be of independent interest) for lower bounding the prioritized risk in more general settings involving unbounded losses. We illustrate the ability of our framework to provide insights into tradeoffs between prior information and learning performance for problems in estimation, regression, and reinforcement learning.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on4
- Fantastic Generalization Measures and Where to Find ThemYiding Jiang, Behnam Neyshabur, Hossein Mobahi, Dilip Krishnan et al.ICLR 2020 · 705 citations
- PAC-Bayes Compression Bounds So Tight That They Can Explain GeneralizationSanae Lotfi, Marc Finzi, Sanyam Kapoor, Andres Potapczynski et al.NeurIPS 2022 · 98 citations
- A Lower Bound for the Sample Complexity of Inverse Reinforcement LearningAbi Komanduru, Jean HonorioICML 2021 · 7 citations
- A theory of universal learningOlivier Bousquet, Steve Hanneke, Shay Moran, Ramon van Handel et al.STOC 2021
Related papers
- Rate-Distortion Analysis of Minimum Excess Risk in Bayesian LearningHassan Hafez-Kolahi, Behrad Moniri, Shohreh Kasaei, Mahdieh Soleymani BaghshahICML 2021 · 12 citations
- Theoretical bounds on estimation error for meta-learningJames Lucas, Mengye Ren, Irene Raissa Kameni, Toniann Pitassi et al.ICLR 2021 · 12 citations
- Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit LearnabilityFan Chen, Dylan J. Foster, Yanjun Han, Jian Qian et al.NeurIPS 2024 · 15 citations
- Rethinking Fano's Inequality in Ensemble LearningTerufumi Morishita, Gaku Morio, Shota Horiguchi, Hiroaki Ozaki et al.ICML 2022 · 4 citations
- A Distribution-dependent Analysis of Meta LearningMikhail Konobeev, Ilja Kuzborskij, Csaba SzepesváriICML 2021 · 6 citations
