Two-ReLU gradient descent collapses to bisector then specializes
Gradient flow on two-neuron ReLU model first collapses to bisector saddle before escaping to specialize to teacher.
8 stories, newest first · one card per story
Gradient flow on two-neuron ReLU model first collapses to bisector saddle before escaping to specialize to teacher.
A minimal model shows freezing and retrieval transitions as softmax sharpness rises, and simulations match the predicted flow.
Proves explicit privacy bounds for finite gradient-descent iterates on perturbed objectives, removing ambient-dimension factors for generalized linear models.
QAM merges checkpoints to match sequential gradient descent through second order, with an O(h^3) error bound.
Priority-Constrained Descent optimizes hierarchical objectives while limiting distortion of the primary gradient.
Researchers propose AdamX, a cosine-similarity-based first-order optimizer with variance rectification that matches Adam-class convergence across benchmark datasets and architectures.
New optimization theory paper proves near-optimal lower bounds for gradient descent with predetermined stepsizes, confirming silver-schedule optimality.
Theoretical framework bounds generalization for gradient descent with weight decay, deriving conditions that explain delayed generalization and grokking.
Today 1.6K readers · 2.4K views · 775 reads · all time 189K views