33 citations · 55 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LG2017★ 11 cited
Online Convex Optimization with Unconstrained Domains and Losses
Ashok Cutkosky, Kwabena Boahen
We propose an online convex optimization algorithm (RescaledExp) that achieves optimal regret in the unconstrained setting without prior knowledge of any bounds on the loss functio…
cs.LG2017★ 11 cited
Online Learning Without Prior Information
Ashok Cutkosky, Kwabena Boahen
The vast majority of optimization and online learning algorithms today require some prior information about the data (often in the form of bounds on gradients or on the optimal par…