Log-concave sampling: Metropolis-Hastings algorithms are fast (Q5214293)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7164783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Log-concave sampling: Metropolis-Hastings algorithms are fast |
scientific article; zbMATH DE number 7164783 |
Statements
7 February 2020
0 references
log-concave sampling
0 references
Langevin algorithms
0 references
MCMC algorithms
0 references
conductance methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8208460807800293
0 references
0.8048943281173706
0 references
0.7980197668075562
0 references
0.796448826789856
0 references
