~/talk

Contextual Inverse Optimization: Offline and Online Learning

links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 0:39Contextual Inverse Optimization
  3. 3:06Problem Formulation
  4. 4:32Related Literature: Inverse Optimization
  5. 6:46Offline Setting: The Data
  6. 9:20Offline Learning in an Adversarial Setting
  7. 15:06Online Setting: The Data
  8. 16:16The Decision-Maker Does Not Control the Feedback
  9. 18:42The Circumcenter Policy Fails in the Online Setting
  10. 20:33What Control Do We Have?
  11. 22:37Inverse Exploration
  12. 23:16The Circumcenter Trap
  13. 29:35Summary of Online Learning Results
  14. 30:47Takeaways
  15. 38:16Marketplace Interference (w/ Ido Bright, Arthur Delarue)
~/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.