Finite O(d log d) regret bounds for online inverse linear optimization under M-convex action sets, plus O((C+1)d log d) corruption-robust bounds without knowing C.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
Finite O(d log d) regret bounds for online inverse linear optimization under M-convex action sets, plus O((C+1)d log d) corruption-robust bounds without knowing C.