Dept. of Electrical and Computer Engineering, Boston University, Boston, MA; Google Research, Mountain View, CA; Department of Computer Science, University of Utah, Salt Lake City, UT
Manish Purohit
Online optimization;Full information;Regret bounds;Hints;Query cost
Logarithmic Regret from Sublinear Hints