A higher-order Langevin Monte Carlo algorithm family is proposed with Wasserstein mixing time improving in the dynamics order, under a strong Condition H2 that the abstract does not disclose.
Towards a theory of non-log-concave sampling: First-order stationarity guarantees for L angevin M onte C arlo
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
High-Order Langevin Monte Carlo Algorithms
A higher-order Langevin Monte Carlo algorithm family is proposed with Wasserstein mixing time improving in the dynamics order, under a strong Condition H2 that the abstract does not disclose.