Paper Awards

Best paper

Efficient convex optimization requires superlinear memory
Annie Marsden; Vatsal Sharan; Aaron Sidford; Gregory Valiant

Best student paper

New projection-free algorithms for online convex optimization with adaptive regret guarantees
Ben Kretzu; Dan Garber

Best student paper runner-up

Universal online learning: An optimistically universal learning rule
Moise Blanchard