atlas

Research map / Optimization / Implicit bias and generalization

Regularized linear autoencoders recover the principal components, eventually

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

Read the paperCheck your idea against 108,967 papers

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

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use non-uniform instead of uniform l2 regularization (ablation)linear autoencoder · MNIST k=20distance to axis-aligned solutionHelped
use rotation augmented gradient (RAG) instead of non-uniform l2 regularizationlinear autoencoder with Nesterov GD · MNIST k=20convergence speed to axis-alignmentHelped
use RAG instead of regularized objectives as latent dimension growslinear autoencoder with Nesterov GD · synthetic data m=1000epochs to reach 0.3 axis-alignment distanceHelped
switch from Nesterov GD to Adam for regularized objectivesnon-uniform l2 and nested dropout LAEs · MNIST k=20convergence speedMixed

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