arXiv Machine Learning By Binghua Li, Mengzhe Li, Denny Wu, Tianhao Wang

Gradient Descent on Two ReLU Neurons: Global Landscape and Bifurcation Dynamics

Read the original on arXiv Machine Learning →

The paper investigates gradient descent dynamics in a minimal two‑neuron ReLU teacher‑student model with isotropic Gaussian inputs. It identifies two key directions—an easy bisector direction carrying the main signal and a hard splitting direction governing specialization—and shows that every critical point with non‑zero student weights is either a global minimum or a saddle. The study tracks the gradient‑flow trajectory, revealing that student neurons initially converge to a bisector saddle before escaping and specializing to match the teacher neurons, thereby explaining the multi‑phase symmetry‑breaking behavior in this simple setting.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Oct 2

Removing spurious minima for planar features by skip connections

The paper investigates the loss landscape of shallow, bias‑free ReLU networks in a teacher–student setting, focusing on Gaussian population loss. It shows that adding a learned linear skip connection eliminates all spurious local minima with non‑negative student output weights when the student network is at least as wide as the teacher, whereas without the skip such minima persist even under overparameterization. Additionally, the study proves that the student network always learns the teacher’s feature subspace and that, in two dimensions, the effective width of an overparameterized student is bounded by twice the teacher’s width.

By Jakob Paul Zimmermann, Moritz Grillo, Andrei Balakin, Georg Loho