Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
Researchers have developed a new method for online inverse linear optimization, a technique used in contextual recommendation systems. This approach achieves a finite regret bound of O(d log d) for M-convex action sets, a significant improvement over previous exponential bounds and a partial answer to an open question in the field. The method combines structural characterization of optimal solutions with geometric volume arguments. Additionally, the technique has been extended to handle adversarially corrupted feedback, yielding a bound of O((C+1)d log d) without prior knowledge of the corruption level. AI
IMPACT Establishes a new theoretical bound for online inverse linear optimization, potentially improving recommendation systems.