Sampling from a log-concave distribution with projected Langevin Monte Carlo (Q1650786): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q130021959, #quickstatements; #temporary_batch_1729520221944 |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s00454-018-9992-1 / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00454-018-9992-1 / rank | |||
Normal rank |
Latest revision as of 00:59, 11 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sampling from a log-concave distribution with projected Langevin Monte Carlo |
scientific article |
Statements
Sampling from a log-concave distribution with projected Langevin Monte Carlo (English)
0 references
13 July 2018
0 references
The authors establish a bound on the number of steps required for the Projected Langevin Monte Carlo to attain a small total variation distance to the target measure. The properties of reflected Brownian is used to obtain a total variation bound from the Wasserstein bound. The arguments are generalized to an arbitrary smooth potential. Some preliminary experimental comparison between Langevin Monte Carlo and hit-and-run is presented.
0 references
Langevin Monte Carlo
0 references
sampling and optimization
0 references
log-concave measures
0 references
rapidly-mixing random walks
0 references