Research map / Probabilistic and scientific modeling / Variational and generative sampling
Fast Mixing Markov Chains for Strongly Rayleigh Measures, DPPs, and Constrained Sampling
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Increase β from 1 to 3 with δ fixed at 1 | Partition-matroid Ising sampler · 20-variable chain-structured Ising model | mixing speed | Hurt |
| Decrease δ from 1 to 0.5 with β fixed at 3 | Partition-matroid Ising sampler · 20-variable chain-structured Ising model | mixing speed | Helped |
| Increase δ | Partition-matroid Ising sampler · 20-variable chain-structured Ising model | approximate mixing time | Hurt |
| Increase β | Partition-matroid Ising sampler · 20-variable chain-structured Ising model | approximate mixing time | Hurt |
| Combine add-delete moves with exchange moves instead of using only add-delete moves | DPP sampler · Ailerons DPP with slowly decaying spectrum | convergence speed | Hurt |
| Combine add-delete moves with exchange moves instead of using only add-delete moves | DPP sampler · DPP with sharp step in kernel eigenspectrum | convergence speed | Helped |
| Increase ground-set size N | DPP sampler · Ailerons DPP | mixing time | Hurt |
| Increase ground-set size N | k-DPP sampler · Partition matroid base | convergence speed | Hurt |
Closest papers by meaning
- Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions (NeurIPS 2023 · similarity 0.90)
- Improved Lower Bounds for First-order Stochastic Non-convex Optimization under Markov Sampling (ICML 2025 · similarity 0.86)
- Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel (ICLR 2025 · similarity 0.86)
- Wasserstein Gradient Flows and Forward-Only Diffusion Are Not Enough for Multimodal Sampling (NeurIPS 2026 · similarity 0.86)
- Optimal Sample Complexity for Average Reward Markov Decision Processes (ICLR 2024 · similarity 0.86)
- Chain of Log-Concave Markov Chains (ICLR 2024 · similarity 0.86)
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.