Research map / Learning theory and algorithms / Sample complexity
A Polynomial Time MCMC Method for Sampling from Continuous Determinantal Point Processes
Alireza Rezaei, Shayan Oveis Gharan
Read the paperCheck your idea against 137,217 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
- Exact sampling of determinantal point processes with sublinear time preprocessing (NeurIPS 2019 · similarity 0.90)
- Scalable MCMC Sampling for Nonsymmetric Determinantal Point Processes (ICML 2022 · similarity 0.89)
- Kronecker Determinantal Point Processes (NeurIPS 2016 · similarity 0.87)
- Fast Mixing Markov Chains for Strongly Rayleigh Measures, DPPs, and Constrained Sampling (NeurIPS 2016 · similarity 0.87)
- Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers (ICLR 2024 · similarity 0.85)
- Restricted Spectral Gap Decomposition for Simulated Tempering Targeting Mixture Distributions (NeurIPS 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.
