Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms.
Stefan HeinrichPublished in: MCQMC (2020)
Keyphrases
- monte carlo
- lower bound
- monte carlo methods
- computational complexity
- running times
- matrix inversion
- worst case
- markov chain
- stochastic approximation
- monte carlo tree search
- upper bound
- learning algorithm
- monte carlo method
- importance sampling
- monte carlo simulation
- combinatorial optimization
- temporal difference
- computational cost
- machine learning
- point processes
- markovian decision