arXiv (All)
open access
Subgroup Rank-1 Lattice for Practical High-dimensional Black-box Integral Approximation
Estimating integrals of black-box, high-dimensional functions, from expectations and kernel mean embeddings to the softmax kernel in self-attention, is a basic subroutine in machine learning. Rank-1 lattice rules suit this setting: they query the integrand only at a fixed point set and need no gradi
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
- Doubly Adaptive Importance Sampling#972863
- Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity#310805
- Differentiable Expectation-Maximisation and Applications to Gaussian Mixture Model Optimal Transport#1143618
- Dynamical mean-field theory for stochastic gradient descent in Gaussian mixture classification#27547
- Mean field methods for classification with Gaussian processes#234234
Record · ID 1129774
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