arXiv (All)
open access
On the Optimality of Random Features under General Conditions: Misspecified Cases and Robust Learning
Random features provide a standard approach to scaling kernel methods to large datasets by approximating the kernel with a finite-dimensional feature map. Existing works of random feature methods primarily focus on well-specified models and light-tailed noise conditions, leaving a gap in understandi
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
- Kernel Density Estimators in Large Dimensions#153741
- Statistical inverse learning and $\ell^1$-regularization#349639
- The General Theory of Localization Methods#1069805
- Residual-Guided Randomized Neural Networks#618571
- Quadratic Weak-to-Strong Generalization in Random Feature Networks via Random Matrix Theory#1233083
Record · ID 1343846
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