arXiv (All)
open access
Does Compression Imply Generalization? A Minimum Description Length Perspective
A central question in modern learning theory is what notion of compression, if any, explains why over-parameterized neural networks generalize. Existing answers measure complexity at different levels, ranging from weights to representations; however, estimating the associated quantities either requi
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
- Do Flatter Minima Drive Better Generalization? An Algorithmic Separation in Grokking#1248133
- Official Review · NEURIPS 2024#787083
- Uncheatable Eval: Dynamic Compression-Based Evaluation of Language Models#1064054
- Enhanced Neural Video Representation Compression Across Extreme Complexity and Quality Scales#973236
- Neural Network Representation Formats — Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. (US20250384299A1)#607345
Record · ID 1356712
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