Lower bounds for the number of random bits in Monte Carlo algorithms.
Stefan HeinrichPublished in: CoRR (2020)
Keyphrases
- monte carlo
- lower bound
- monte carlo methods
- computational complexity
- stochastic approximation
- running times
- monte carlo simulation
- matrix inversion
- worst case
- markov chain
- importance sampling
- branch and bound
- adaptive sampling
- markov chain monte carlo
- genetic algorithm
- upper bound
- computational cost
- particle filter
- policy evaluation
- reinforcement learning