arXiv (All)
open access
Double Descent in High-dimensional Linear Discriminant Analysis
The double-descent phenomenon observed in modern machine learning models has challenged the classical bias-variance trade-off by showing that prediction error can decrease again as model complexity exceeds the interpolation threshold. Although this phenomenon has been extensively studied for deep ne
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
- Deep kernel hedging#1128743
- Adam or Gauss-Newton? A Comparative Study In Terms of Basis Alignment and SGD Noise#1117260
- Verifier-guided discovery of exact high-order mimetic operators with large language models#1064466
- Boundary Geometry and Global Rates of Cyclic Coordinate Descent for SVM Duals#1144207
- A Ridge Too Far: Correcting Over-Shrinkage via Negative Regularization#153124
Record · ID 1013270
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