Goto

Collaborating Authors

 Statistical Learning






Contextual Linear Optimization with Bandit Feedback

Neural Information Processing Systems

We show a fast-rate regret bound for IERM that allows for misspecified model classes and flexible choices of the optimization estimate, and we develop computationally tractable surrogate losses.



Universality of AdaGrad Stepsizes for Stochastic Optimization: Inexact Oracle, Acceleration and Variance Reduction Anton Rodomanov CISPA

Neural Information Processing Systems

Lipschitz gradient, without needing to know neither the corresponding Lipschitz constants, nor the oracle's variance but enjoying the rates which are characteristic for algorithms which have the