Sampling can be faster than optimization

Optimization algorithms and Monte Carlo sampling algorithms have provided the computational foundations for the rapid growth in applications of statistical machine learning in recent years. There is, however, limited theoretical understanding of the relationships between these 2 kinds of methodology...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the National Academy of Sciences - PNAS Ročník 116; číslo 42; s. 20881
Hlavní autori:	Ma, Yi-An, Chen, Yuansi, Jin, Chi, Flammarion, Nicolas, Jordan, Michael I
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States 15.10.2019
Predmet:	Langevin Monte Carlo nonconvex optimization computational complexity
ISSN:	1091-6490, 1091-6490
On-line prístup:	Zistit podrobnosti o prístupe
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!