We lifted 1 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| HilalAsi/APROX-Robust-Stochastic-Optimization-Algorithms | reimplementation | 0 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| TimesToEpsilonAccuracy | Not yet run | HilalAsi/APROX-Robust-Stochastic-Optimization-Algorithms/paper-code/stability_check.py pointer only (licence: NONE) · get_code("7996b17947d822fe") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Standard stochastic optimization methods are brittle, sensitive to stepsize choices and other algorithmic parameters, and they exhibit instability outside of well-behaved families of objectives. To address these challenges, we investigate models for stochastic minimization and learning problems that exhibit better robustness to problem families and algorithmic parameters. With appropriately accurate models---which we call the aProx family---stochastic methods can be made stable, provably convergent and asymptotically optimal; even modeling that the objective is nonnegative is sufficient for this stability. We extend these results beyond convexity to weakly convex objectives, which include compositions of convex losses with smooth functions common in modern machine learning applications. We highlight the importance of robustness and accurate modeling with a careful experimental evaluation of convergence time and algorithm sensitivity.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1903.08619")
get_code_for_paper("1903.08619")
have("1903.08619")
Connect an agent — have() is free.