arXiv (All)
open access
Data sparse multilevel covariance estimation in optimal complexity
We consider the $\calH^2$-formatted compression and computational estimation of covariance functions on a compact set in $\bbR^d$. The classical sample covariance or Monte Carlo estimator is prohibitively expensive for many practically relevant problems, where often approximation spaces with many de
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
- Sampling bias corrections for discrete and Gaussian partial information decompositions.#975473
- Optimal Sampling and Scheduling for Remote Fusion Estimation of Correlated Wiener Processes#1013458
- Bias Reduction by Multiscale Quasi-Interpolation for Scalar- and Manifold-Valued Functions#1084035
- An error bound-based convergence analysis framework for a class of randomized algorithms#798805
- An error bound-based convergence analysis framework for a class of randomized algorithms#797391
Record · ID 986072
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