2020
DOI: 10.4208/cicp.oa-2020-0168
|View full text |Cite
|
Sign up to set email alerts
|

Random Batch Algorithms for Quantum Monte Carlo Simulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 38 publications
0
1
0
Order By: Relevance
“…This random mini batch idea was the key component of the so-called stochastic gradient descent (SGD) [37,3] in machine learning. Due to the simplicity and scalability, it already has a variety of applications in solving the Poisson-Nernst-Planck, Poisson-Boltzmann and Fokker-Planck-Landau equations [29,5], efficient sampling [31], molecular simulation [24,32], and quantum Monte-Carlo method [26]. Readers can refer to the review article [20].…”
Section: Introductionmentioning
confidence: 99%
“…This random mini batch idea was the key component of the so-called stochastic gradient descent (SGD) [37,3] in machine learning. Due to the simplicity and scalability, it already has a variety of applications in solving the Poisson-Nernst-Planck, Poisson-Boltzmann and Fokker-Planck-Landau equations [29,5], efficient sampling [31], molecular simulation [24,32], and quantum Monte-Carlo method [26]. Readers can refer to the review article [20].…”
Section: Introductionmentioning
confidence: 99%