arXiv (All)
open access
Scalable Bayesian Quadrature via Operator-Adapted Features
Kernel methods face two recurrent bottlenecks: the cubic cost of inverting an $n\times n$ kernel matrix, as in kernel ridge regression, and the evaluation of kernel integrals, as required in kernel quadrature. Existing low-rank kernel and Gaussian process approximations primarily address the former
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 Neural Operators (KNOs) for Scalable, Memory-efficient, Geometrically-flexible Operator Learning#147012
- Fast Learning Rates for Physics-Informed Kernel Methods#1013058
- Fast Learning Rates for Physics-Informed Kernel Methods#965410
- A parameterization of anisotropic Gaussian fields with penalized complexity priors#189208
- A Range-Deflated Stochastic Lanczos Quadrature Method for Large-Scale Log-Determinant Estimation#1217491
Record · ID 1489004
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