arXiv (All)
open access
Dimension-Free PAC-Bayes Generalization for Deep Neural Networks via Dirichlet Processes
Classical PAC-Bayesian generalization theory places prior distributions over Euclidean parameter space $Θ\subseteq \mathbb{R}^D$, causing relative entropy to scale with network dimension $D$. For modern overparameterized neural networks where $D \gg n$, this parameter-counting dependency yields vacu
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
- Autoencoders in Function Space#799823
- Understanding Deep Learning via Entropy Space Theory#794087
- Understanding Deep Learning via Entropy Space Theory#790068
- Efficient quadratic entropy with distance sketches#1249256
- Random Matrix Theory for Deep Learning: Beyond Eigenvalues of Linear Models#147108
Record · ID 1356676
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