atlas

Research map / Optimization / Implicit bias and generalization

Convergence of the Gradient Flow for Shallow ReLU Networks on Weakly Interacting Data

NeurIPS 2025 · Optimization › Implicit bias and generalization · approach: Shallow ReLU network convergence · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Shows that one-hidden-layer ReLU networks trained by gradient flow converge globally with high probability when width is on the order of log(n), exploiting low correlation of high-dimensional inputs, via a Polyak–Łojasiewicz analysis.

Problem

Global convergence of gradient flow for one-hidden-layer ReLU networks trained on n data points, and how much width is needed for it.

Approach

Uses the high dimensionality of the ambient space, which makes input samples weakly correlated, to show that width of order log(n) suffices for global convergence under a Polyak–Łojasiewicz argument along the gradient flow trajectory.

Key results

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy