arXiv (All)
open access
Least-time Gradient Flow
Prescribing the speed of gradient flow on the risk itself, by the dynamics $\dot w=-u(E(w))\nabla E(w)/\abs{\nabla E(w)}^{2}$, makes the risk $e(t)=E(w(t))$ obey $\dot e=-u(e)$ exactly, whatever the landscape~$E$; the time needed to reach zero risk from $e_0$ is $\int_0^{e_0}\dd e/u(e)$. Minimizing
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Hide&Seek: Learning to Explain in an End-to-End Differentiable Network#459661
- Hide&Seek: Learning to Explain in an End-to-End Differentiable Network#625252
- Hide&Seek: Learning to Explain in an End-to-End Differentiable Network#622979
- Optimal gradient estimates for the insulated conductivity problem with dimensions more than two#155444
- THE REPRESENTATION PROBLEM FOR A DIFFUSION EQUATION AND FRACTAL R-L LADDER NETWORKS#121841
Record · ID 1156698
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive