Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin Algorithm.
Vishwak SrinivasanAndre WibisonoAshia C. WilsonPublished in: CoRR (2023)
Keyphrases
- simulated annealing
- search space
- objective function
- optimization algorithm
- k means
- high accuracy
- dynamic programming
- computational cost
- improved algorithm
- recognition algorithm
- preprocessing
- learning algorithm
- theoretical analysis
- worst case
- probabilistic model
- experimental evaluation
- np hard
- cost function
- computational complexity
- similarity measure
- data structure
- detection algorithm
- times faster
- matching algorithm
- monte carlo
- sampling algorithm
- markov chain monte carlo
- neural network
- tree structure
- clustering method
- segmentation algorithm
- expectation maximization
- significant improvement
- probability distribution