Broken scale symmetries in undercomplete linear autoencoders
Theory paper shows SGD drives undercomplete linear autoencoders toward large decoder weights along the PCA solution manifold until hitting a finite-stepsize stability boundary.
7 stories, newest first · one card per story
Theory paper shows SGD drives undercomplete linear autoencoders toward large decoder weights along the PCA solution manifold until hitting a finite-stepsize stability boundary.
Paper derives a spectral theory showing weight decay drives NTK feature learning that controls grokking timescale and phase structure.
Theoretical work derives sharp reconstruction-derivative error bounds for autoencoders using the same forward map, validated on a 798,452-point LiDAR forest scan.
A mathematics paper generalizes Harvey-Lawson cones, proving a matrix version is an exact special Lagrangian manifold foliating the balanced manifold in deep learning.
Theory paper shows tree tensor networks contain worst-case hard targets yet benign loss landscapes, with difficulty arising from degenerate saddles.
Researchers derive an exact law linking learning-rate schedules and weight decay in normalized networks, pinpointing when scale-invariant optimization destabilizes.
Researchers model curriculum learning as Wasserstein transport over difficulty distributions, finding curriculum benefits are strongly task- and budget-dependent with no dominant strategy.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views