Search Results for author:
Found 1 papers, 0 papers with code
Online Convex Optimization in the Random Order Model
Focusing on two important families of online tasks, one which generalizes online linear and logistic regression, and the other being online PCA, we show that under standard well-conditioned-data assumptions (that are often being made in the corresponding offline settings), standard online gradient descent (OGD) methods become much more efficient in the random-order model.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
