Signals 4 · free daily AI digest

Convergence of stochastic gradient descent for learning linear neural networks

Paper recorded by Signals 4 on 2026-10-20 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-20 on arXiv · recorded by Signals 4 on 2026-10-21

Category: cs.LG · 机器学习 · first seen 2026-10-21

Abstract

Stochastic gradient descent (SGD) is the cornerstone of modern deep learning, yet its theoretical convergence properties remain poorly understood in non-convex settings. To address this gap, we study SGD dynamics in deep linear neural networks - simplified models that retain key non-convex characteristics while remaining analytically tractable. Building on recent results for gradient descent, we e

Read on arXiv →

#231 most recent of 749 cs.LG papers we have recorded · ↑ newer: Asymmetric Bidirectional Predictive Dynamics in Google Search and COVI · ↓ older: When Do LLMs Help with Feature Selection? A Systematic Empirical Study
Cite this page: Convergence of stochastic gradient descent for learning linear neural networks: the #231 most recent of 749 cs.LG papers we have recorded (as of 2026-10-20). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/convergence-of-stochastic-gradient-descent-for-learning-linear-neural-networks.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions