High Dimensional Calibration for Rational Decision Making
summary
Provides an algorithm that produces d‑dimensional forecasts whose worst‑case bias grows like root t (up to a log factor in the number of events) and runs in time polynomial in the number of conditioning events so long as that number is polynomial in the problem size The method frames routing and online max‑weight matching as online combinatorial optimization and yields no‑regret guarantees on polynomially many subsequences, so published forecasts make best‑response behavior rational for many agents and apply to auctions, extensive‑form learning, and improved conformal prediction
AI-written summary · about
chapters (10)
- 0:00High dimensional calibration intro
- 1:33Linear utility decision modeling
- 4:45Calibration in binary/high dim
- 7:34Calibration limitations
- 11:15Online combinatorial framework
- 16:20Subsequence regret analysis
- 22:30Multi-agent low-bias predictions
- 25:48Polynomial event prediction
- 27:17Applications in mechanism design and machine learning
- 29:07Summary
related talks
01h 21mMulticalibration: Towards Fair Decision Making
40mDecision-Making Under Miscalibration
48mOnline Adversarial Multicalibration And (Multi)Calibeating
33mOnline Multivalid Learning: Means, Moments, and Prediction Intervals
36mBeating the Curse of Dimensionality in High-Dimensional Optimal Stopping
48mComputational-Statistical Tradeoffs in Robust High-Dimensional Estimation
01h 08mData Driven Optimization Models and Algorithms
01h 07mRecent Progress in High-Dimensional Learning
