Contextual Online Decision Making with Infinite-Dimensional Functional Regression
Haichen Hu, Rui Ai, Stephen Bates, David Simchi-Levi
Abstract
Contextual sequential decision-making is fundamental to machine learning, with applications in bandits, sequential hypothesis testing, and online risk control. These tasks often rely on statistical measures like expectation, variance, and quantiles. In this paper, we propose a universal algorithmic framework that learns the full underlying distribution, enabling a unified approach to all contextual online decision-making problems. The challenge lies in the uncountably infinite-dimensional regression, where existing contextual bandit algorithms all yield infinite regret. We innovatively propose an efficient infinite-dimensional functional regression oracle for contextual cumulative distribution functions (CDFs) and model every datum as a combination of context-dependent CDF basis functions. Our analysis reveals that the decay rate of the eigenvalue sequence of the design integral operator governs the regression error rate, and consequently, the utility regret rate. Specifically, when the eigenvalue sequence exhibits a polynomial decay of order 1 γ ≥ 1, the utility regret is bounded by O T 3γ+2 2(γ+2) . The case that γ = 0 can recover the existing optimal rate in contextual bandits literature with finite-dimensional regression and so as exponential decay. We also provide a numerical method to compute the eigenvalue sequence of integral operators, enabling the practical implementation of our framework.
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 on6
- Beyond UCB: Optimal and Efficient Contextual Bandits with Regression OraclesDylan J. Foster, Alexander RakhlinICML 2020 · 241 citations
- Practical Adversarial Multivalid Conformal PredictionOsbert Bastani, Varun Gupta, Christopher Jung, Georgy Noarov et al.NeurIPS 2022 · 82 citations
- Kernelized Reinforcement Learning with Order Optimal Regret BoundsSattar Vakili, Julia OlkhovskayaNeurIPS 2023 · 22 citations
- Improved Sleeping Bandits with Stochastic Action Sets and Adversarial RewardsAadirupa Saha, Pierre Gaillard, Michal ValkoICML 2020 · 20 citations
- Sparse Learning of Dynamical Systems in RKHS: An Operator-Theoretic ApproachBoya Hou, Sina Sanjari, Nathan Dahlin, Subhonmesh Bose et al.ICML 2023 · 17 citations
Related papers
- Adapting to Misspecification in Contextual BanditsDylan J. Foster, Claudio Gentile, Mehryar Mohri, Julian ZimmertNeurIPS 2020 · 111 citations
- Effective Dimension in Bandit Problems under CensorshipGauthier Guinet, Saurabh Amin, Patrick JailletNeurIPS 2022 · 3 citations
- Contextual Bandits with Large Action Spaces: Made PracticalYinglun Zhu, Dylan J. Foster, John Langford, Paul MineiroICML 2022 · 34 citations
- Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action SpacesYinglun Zhu, Paul MineiroICML 2022 · 19 citations
- Catoni Contextual Bandits are Robust to Heavy-tailed RewardsChenlu Ye, Yujia Jin, Alekh Agarwal, Tong ZhangICML 2025
