arXiv (All)
open access
On the sample complexity of the active subspace method
Active subspaces identify low-dimensional linear structure in high-dimensional parameter-to-output maps by estimating the dominant eigenspace of a gradient covariance operator. In practice this covariance is replaced by a Monte Carlo estimator built from a limited number of gradient evaluations. Cla
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
- The joint density of top k sample eigenvectors and principal subspace inference#975095
- Robust covariance matrix estimation : 'HAC' estimates with long memory/antipersistence correction#452333
- Complexity analysis of trust-region methods under $(α,L_0,L_1)$-smoothness#1117950
- Concept Subspaces Compute Beyond the Logit Lens: A Weights-Only Test for Locating Representations Upstream of Readout#1144230
- Concentration of Regularized Sparse Random Matrices: Spectral Edge Bounds via Nonbacktracking Operators#1062503
Record · ID 986559
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