Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling.
Keru WuScott C. SchmidlerYuansi ChenPublished in: CoRR (2021)
Keyphrases
- learning algorithm
- preprocessing
- np hard
- times faster
- worst case
- detection algorithm
- cost function
- theoretical analysis
- optimal solution
- computational complexity
- improved algorithm
- simulated annealing
- experimental evaluation
- expectation maximization
- high accuracy
- probabilistic model
- monte carlo
- objective function
- similarity measure
- sparse representation
- sampling algorithm
- clustering method
- optimization algorithm
- state space
- computational cost
- dynamic programming
- k means
- search space