We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study the implicit bias of AdaGrad on separable linear classification problems. We show that AdaGrad converges to a direction that can be characterized as the solution of a quadratic optimization problem with the same feasible set as the hard SVM problem. We also give a discussion about how different choices of the hyperparameters of AdaGrad might impact this direction. This provides a deeper understanding of why adaptive methods do not seem to have the generalization ability as good as gradient descent does in practice.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1906.03559")
get_code_for_paper("1906.03559")
have("1906.03559")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1906.03559.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1906.03559)
Connect an agent — have() is free.