The Non-linear F-Design and Applications to Interactive Learning
Alekh Agarwal, Jian Qian, Alexander Rakhlin, Tong Zhang
Abstract
We propose a generalization of the classical Goptimal design concept to non-linear function classes. The criterion, termed F -design, coincides with G-design in the linear case. We compute the value of the optimal design, termed the F -condition number, for several non-linear function classes. We further provide algorithms to construct designs with a bounded F -condition number. Finally, we employ the F -design in a variety of interactive machine learning tasks, where the design is naturally useful for data collection or exploration. We show that in four diverse settings of confidence band construction, contextual bandits, model-free reinforcement learning, and active learning, F -design can be combined with existing approaches in a black-box manner to yield state-of-the-art results in known problem settings as well as to generalize to novel ones.
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.
Cited by top-tier papers1
Ask how each one uses itBuilds on7
- Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient AlgorithmsChi Jin, Qinghua Liu, Sobhan MiryoosefiNeurIPS 2021 · 264 citations
- Beyond UCB: Optimal and Efficient Contextual Bandits with Regression OraclesDylan J. Foster, Alexander RakhlinICML 2020 · 241 citations
- Bilinear Classes: A Structural Framework for Provable Generalization in RLSimon S. Du, Sham M. Kakade, Jason D. Lee, Shachar Lovett et al.ICML 2021 · 207 citations
- Contextual Bandits with Large Action Spaces: Made PracticalYinglun Zhu, Dylan J. Foster, John Langford, Paul MineiroICML 2022 · 34 citations
- Improved Algorithms for Agnostic Pool-based Active ClassificationJulian Katz-Samuels, Jifan Zhang, Lalit Jain, Kevin JamiesonICML 2021 · 26 citations
Related papers
- Provable General Function Class Representation Learning in Multitask Bandits and MDPRui Lu, Andrew Zhao, Simon S. Du, Gao HuangNeurIPS 2022 · 11 citations
- Active Learning with Safety ConstraintsRomain Camilleri, Andrew Wagenmaker, Jamie H. Morgenstern, Lalit Jain et al.NeurIPS 2022 · 19 citations
- Gamification of Pure Exploration for Linear BanditsRémy Degenne, Pierre Ménard, Xuedong Shang, Michal ValkoICML 2020 · 86 citations
- Dynamic Balancing for Model Selection in Bandits and RLAshok Cutkosky, Christoph Dann, Abhimanyu Das, Claudio Gentile et al.ICML 2021 · 40 citations
- Asymptotic Instance-Optimal Algorithms for Interactive Decision MakingKefan Dong, Tengyu MaICLR 2023 · 1 citation
