Research map / Learning theory and algorithms / Sample complexity
Stochastic Discrete Clenshaw-Curtis Quadrature
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Dynamic Importance Sampling for Anytime Bounds of the Partition Function (NeurIPS 2017 · similarity 0.88)
- Lost Relatives of the Gumbel Trick (ICML 2017 · similarity 0.87)
- Convergence Guarantees for Adaptive Bayesian Quadrature Methods (NeurIPS 2019 · similarity 0.86)
- Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms (AAAI 2019 · similarity 0.86)
- Graphical model inference: Sequential Monte Carlo meets deterministic approximations (NeurIPS 2018 · similarity 0.85)
- Sampling from Binary Quadratic Distributions via Stochastic Localization (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.