Efficient online inverse optimization with O(d) regret
Read the original at arxiv.org→arXiv:2609.13440v1 Announce Type: new Abstract: 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...
Original headline: "Efficient Online Inverse Optimization with $O(d)$ Regret"
Coverage timeline
- Sep 15, 04:00 UTC arXiv cs.LG lead source Efficient Online Inverse Optimization with $O(d)$ Regret