Efficient Online Inverse Optimization with O(d) Regret
DGX agentarXiv: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 o