Research map / Optimization / Implicit bias and generalization
High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representation
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.
Closest papers by meaning
- Asymptotics of feature learning in two-layer networks after one gradient-step (ICML 2024 · similarity 0.92)
- Asymptotic Analysis of Two-Layer Neural Networks after One Gradient Step under Gaussian Mixtures Data with Structure (ICLR 2025 · similarity 0.89)
- A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networks (ICML 2024 · similarity 0.89)
- How does Gradient Descent Learn Features --- A Local Analysis for Regularized Two-Layer Neural Networks (NeurIPS 2024 · similarity 0.89)
- Asymmetric Scaling Laws from Sparse Features (NeurIPS 2026 · similarity 0.88)
- The Optimization Landscape of SGD Across the Feature Learning Strength (ICLR 2025 · similarity 0.88)
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.