ISTA Publications
metadata only
A law of data reconstruction for random features (and beyond)
Large-scale deep learning models are known to memorize parts of the training set. In machine learning theory, memorization is often framed as interpolation or label fitting, and classical results show that this can be achieved when the number of parameters p in the model is larger than the number of
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
- A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learning#996846
- Noise-Adaptive Conformal Classification with Marginal Coverage#1082928
- How Does Preconditioning Guide Feature Learning in Deep Neural Networks?#1116133
- Forget or Fine-tune? A Comparative Study of Machine Unlearning Strategies for Noisy Label Correction#799285
- Forget or Fine-tune? A Comparative Study of Machine Unlearning Strategies for Noisy Label Correction#797862
Record · ID 1158450
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