Learning representations on a latent space from observed and structured solutions through a differentiable constrained optimization problem

We present an efficient $O(n \ln T)$-regret method for online inverse linear optimization, extend it to suboptimal feedback, and provide an $\Omega(n)$-regret lower bound.