~/talk

High Dimensional Calibration for Rational Decision Making

links:none on file
slides:none on file

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

  1. 0:00High dimensional calibration intro
  2. 1:33Linear utility decision modeling
  3. 4:45Calibration in binary/high dim
  4. 7:34Calibration limitations
  5. 11:15Online combinatorial framework
  6. 16:20Subsequence regret analysis
  7. 22:30Multi-agent low-bias predictions
  8. 25:48Polynomial event prediction
  9. 27:17Applications in mechanism design and machine learning
  10. 29:07Summary
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.