Research map / Learning theory and algorithms / Sample complexity
Flexible Modeling of Diversity with Strongly Log-Concave Distributions
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 |
|---|---|---|---|
| Use the rescaled proposal μ instead of the scaled-homogenization proposal H_d ν (ablation) | Metropolis–Hastings sampler for SLC distributions · Empirical mixing-time comparison (d=100, n=250) | mixing time | Helped |
Closest papers by meaning
- Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions (NeurIPS 2023 · similarity 0.87)
- Sampling from Log-Concave Distributions with Infinity-Distance Guarantees (NeurIPS 2022 · similarity 0.86)
- Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusion (NeurIPS 2024 · similarity 0.85)
- Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers (ICLR 2024 · similarity 0.84)
- Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel (ICLR 2025 · similarity 0.84)
- Sampling from Binary Quadratic Distributions via Stochastic Localization (ICML 2025 · similarity 0.83)
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.