Fundamental Tradeoffs in Learning with Prior Information
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 47 references that are in the map. First posted on arXiv 26 Apr 2023.
Builds on
16 of 47 references.
References · 16
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 883
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2017Exploring Generalization in Deep Learningcited by 600
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 314
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2020Tighter risk certificates for neural networkscited by 112
- 2022PAC-Bayes Compression Bounds So Tight That They Can Explain Generalizationcited by 76
- 2014Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcingcited by 63
- 2020A Theory of Universal Learningcited by 60
- 2019PAC-Bayes with Backpropcited by 36
4 more
- 2018PAC-Bayes Control: Learning Policies that Provably Generalize to Novel Environmentscited by 22
- 2020Probably Approximately Correct Vision-Based Planning using Motion Primitivescited by 16
- 2022Zipfian environments for Reinforcement Learningcited by 13
- 2021A Lower Bound for the Sample Complexity of Inverse Reinforcement Learningcited by 7
Built on by
Not cited yet.