REVIEW 2 cited by
Parallelized Midpoint Randomization for Langevin Monte Carlo
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study the problem of sampling from a target probability density function in frameworks where parallel evaluations of the log-density gradient are feasible. Focusing on smooth and strongly log-concave densities, we revisit the parallelized randomized midpoint method and investigate its properties using recently developed techniques for analyzing its sequential version. Through these techniques, we derive upper bounds on the Wasserstein distance between sampling and target densities. These bounds quantify the substantial runtime improvements achieved through parallel processing.
Forward citations
Cited by 2 Pith papers
-
Shifted Composition III: Local Error Framework for KL Divergence
A new local-error framework converts Wasserstein coupling estimates into KL divergence bounds and yields the first KL rates for randomized midpoint Langevin Monte Carlo under strong-log-concavity, weak-log-concavity, ...
-
Advancing Wasserstein Convergence Analysis of Score-Based Models: Insights from Discretization and Second-Order Acceleration
A second-order local linearization sampler is shown to reach O~(1/ε) Wasserstein-2 accuracy for strongly log-concave score-based diffusion models, improving on the O~(1/ε²) rate of Euler and exponential integrator schemes.
Discussion (0). Continue with ORCID to comment.