Visiting Scientist, RIKEN
3 papers at NeurIPS 2025
We present surrogate regret upper bounds for online structured prediction with bandit and delayed feedback.
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.