arXiv (All)
open access
Implicit Bias of (Stochastic) Gradient Descent on Deep Linear Diagonal Networks
Modern machine learning models are often overparameterized, i.e., have more parameters than training data. This typically implies that the loss function admits multiple minimizers so that training methods (and their hyperparameter choices) have significant influence on the computed solution. We stud
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
- Deep kernel hedging#1128743
- A Riemannian gradient descent method for optimization on the indefinite Stiefel manifold#147027
- Online Covariance Estimation for Averaged Stochastic Gradient Descent on Riemannian Manifolds#1455900
- Product-Stability: Provable Convergence for Gradient Descent on the Edge of Stability#1116242
- DP-λCGD: Efficient Noise Correlation for Differentially Private Model Training#1117311
Record · ID 1491112
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