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.
First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored due to the high cost of computing the second-order information. In this paper we develop second-order stochastic methods for optimization problems in machine learning that match the per-iteration cost of gradient based methods, and in certain settings improve upon the overall running time over popular first-order methods. Furthermore, our algorithm has the desirable property of being implementable in time linear in the sparsity of the input data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1602.03943")
get_code_for_paper("1602.03943")
have("1602.03943")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1602.03943.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1602.03943)
Connect an agent — have() is free.