Nonasymptotic bounds for sampling algorithms without log-concavity (Q2657917)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonasymptotic bounds for sampling algorithms without log-concavity |
scientific article |
Statements
Nonasymptotic bounds for sampling algorithms without log-concavity (English)
0 references
18 March 2021
0 references
Euler schemes
0 references
Langevin Monte Carlo
0 references
Markov chain Monte Carlo
0 references
multi-level Monte Carlo
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
