Search Results for author:
Found 2 papers, 1 papers with code
On the connections between algorithmic regularization and penalization for convex losses
In this work we establish the equivalence of algorithmic regularization and explicit convex penalization for generic convex losses.
The Implicit Bias of AdaGrad on Separable Data
We study the implicit bias of AdaGrad on separable linear classification problems.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
