arXiv (All)
open access
Overfitting of Spectral Gradient Descent: How Matrix Geometry shapes Generalization and Implicit Bias
We study the generalization of spectral gradient descent (SpecGD) in overparameterized matrix classification with corrupted labels. Each input combines a shared low-rank signal with a rank-one sample-specific perturbation, referred to as a shortcut, that enables memorization but does not generalize.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Metaplasticity as adaptive gradient preconditioning for incremental learning#609072
- Scalable Statistical Inference in Stochastic Gradient Descent#818887
- Scalable Statistical Inference in Stochastic Gradient Descent#808895
- Accelerated Gradient Descent for Faster Convergence with Minimal Overhead#196460
- Past, Future, All at Once: Mitigating Stability-Plasticity Dilemma via Post-hoc JANUS Rectification#1033767
Record · ID 1116601
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive