14 citations · 14 across the 3 of their papers we have counts for
3 papers
stat.CO2022
Sampling via Rejection-Free Partial Neighbor Search
Sigeng Chen, Jeffrey S. Rosenthal, Aki Dote +2
The Metropolis algorithm involves producing a Markov chain to converge to a specified target density . In order to improve its efficiency, we can use the Rejection-Free version…
math.OC2022
Optimization via Rejection-Free Partial Neighbor Search
Sigeng Chen, Jeffrey S. Rosenthal, Aki Dote +2
Simulated Annealing using Metropolis steps at decreasing temperatures is widely used to solve complex combinatorial optimization problems. In order to improve its efficiency, we ca…
math.ST2019★ 14 cited
Jump Markov Chains and Rejection-Free Metropolis Algorithms
J. S. Rosenthal, A. Dote, K. Dabiri +3
We consider versions of the Metropolis algorithm which avoid the inefficiency of rejections. We first illustrate that a natural Uniform Selection Algorithm might not converge to th…