atlas

Research map / Optimization / Implicit bias and generalization

Convergence of Near-Linear Width ReLU Networks with Unbalanced Initialization

NeurIPS 2026 · Optimization › Implicit bias and generalization · approach: Shallow ReLU network convergence

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 gradient descent convergence for two-layer ReLU networks at near-linear width under unbalanced initialization, addressing the ReLU-induced kernel shift in the NTK regime.

Problem

Two-layer ReLU networks in the NTK regime require substantially larger width than linear for convergence, because activation-pattern changes during training induce kernel shift.

Approach

Uses unbalanced initialization of the network to control the ReLU-induced kernel shift so that convergence holds at near-linear width, closing the gap with random-feature and conjugate kernel analyses.

Key results

Limitations

Experimental setup

Builds on: neural tangent kernel conjugate kernel regime analysis

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