arXiv (All)
open access
Generalized Convexity and Smoothness via Conjugate Duality, with Applications to Deep Network Training
Stochastic gradient descent (SGD) and its variants train deep neural networks (DNNs) effectively in practice, yet classical optimization theory does not fully explain this success: conventional analyses rest on differentiability, convexity, and smoothness, assumptions that DNN objectives routinely v
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
- Generalization Guarantees on Data-Driven Tuning of Gradient Descent with Langevin Updates#997484
- Stability-Shaped Deep Graph Learning#1202763
- Denoising as Projection: Constrained Optimization with Gradient-Guided Diffusion#999861
- Metaheuristic optimization of deep CNNs for multi-class diagnosis of cervical cancer and lymphoma.#185887
- Deep learning methods for inverse problems using connections between proximal operators and Hamilton-Jacobi equations#1069719
Record · ID 1403203
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