Efficient online inverse linear optimization
A learner repeatedly observes which feasible action an expert chooses under an unknown linear objective. The goal is to select good actions while keeping total regret and computation small.
Why it matters and what counts as progress
Why it matters: The result preserves the optimal regret order while making the running time polynomial.
What counts as progress: An algorithm should specify the regret, the running time in dimension and horizon, and how it accesses each round’s feasible set.
How the problem developed
AI contribution
Optimal and Efficient Online Inverse Optimization
A deterministic algorithm attains regret for every horizon T in online inverse linear optimization and runs in time polynomial in the dimension d and the horizon T in the paper’s optimization model.
Sources
Publication history
Daily emails by default, only when there’s an update.