arXiv (OAI Expanded)
open access
Structured Features Overfit Where Random Features Grok
Xu, Vardi and Safran (ICML 2026) prove that over-parameterized ridge regression over an unstructured random Gaussian feature map groks, with the delay between memorization and generalization growing as $1/λ$ in the weight decay. We show that on a structured feature map the same delay does not appear
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
- Sharp Stationary Gaussian Approximation for Constant-Stepsize SGD#1144111
- The Value of Covariance Matching in Gaussian DDPMs and the Lanczos Sampler#216830
- Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity#310805
- Dictionary learning for Kernel EDMD#141489
- Almost Sure Convergence Analysis of Stochastic Gradient Methods with Clipping and Additive Noise#1012349
Record · ID 1084939
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