Contextual Inverse Optimization: Offline and Online Learning
summary
Characterizes offline performance by fitting costs on the unit sphere and computing an uncertainty angle (circumcenter gives the minimax proxy); develops an online algorithm that replaces polyhedral knowledge sets with ellipsoidal cones, uses shallow cuts and subspace projections, and proves the first regret bound that is logarithmic in the horizon (previous work had O(sqrt(T)); bound scales roughly like d^2 log T times a geometry factor). Assumes noiseless, adversarial feedback and shows simulations outperform prior methods.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:39Contextual Inverse Optimization
- 3:06Problem Formulation
- 4:32Related Literature: Inverse Optimization
- 6:46Offline Setting: The Data
- 9:20Offline Learning in an Adversarial Setting
- 15:06Online Setting: The Data
- 16:16The Decision-Maker Does Not Control the Feedback
- 18:42The Circumcenter Policy Fails in the Online Setting
- 20:33What Control Do We Have?
- 22:37Inverse Exploration
- 23:16The Circumcenter Trap
- 29:35Summary of Online Learning Results
- 30:47Takeaways
- 38:16Marketplace Interference (w/ Ido Bright, Arthur Delarue)
related talks
35mOnline Optimization and Learning Under Long-Term Convex Constraints and Objectives
35mOnline Learning with A Lot of Batch Data
43mOnline Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
31mOnline Reinforcement Learning With The Help Of Confounded Offline Data
48mOnline Adversarial Multicalibration And (Multi)Calibeating
01h 01mRobustness, Stochastics, Uncertainty 2
34mUniform Offline Policy Evaluation (OPE) and Offline Learning in Tabular RL
42mBypassing the Impossibility of Online Learning Thresholds: Unbounded Losses and Transductive Priors
