arXiv (All)
open access
Do Flatter Minima Drive Better Generalization? An Algorithmic Separation in Grokking
Flat loss landscapes have long been linked to better generalization in neural networks. However, its role as a causal mechanism for generalization is less established. Grokking provides an unique testbed to understand this distinction: models are prone to fit observed data using non-generalizing str
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
- Bias-variance decompositions: the exclusive privilege of Bregman divergences#1075972
- Official Review · NEURIPS 2024#787083
- Instance-Level Difficulty: A Missing Perspective in Machine Unlearning#1296334
- Does Compression Imply Generalization? A Minimum Description Length Perspective#1356712
- Random Reshuffling Dominates Stochastic Gradient Descent#324881
Record · ID 1248133
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