Efficient Online Inverse Optimization with $O(d)$ Regret

Yang Cai, Anupam Gupta, Vineet Gupta +7

We give a deterministic algorithm for online inverse linear optimization with regret $O(d)$, uniform in the horizon and $O(d^2)$ time per round. A bound of this order was obtaine…