Optimizing Irreversible Perturbations of the Unadjusted Langevin Algorithm
This paper presents a systematic framework for optimizing position-independent irreversible perturbations in the Unadjusted Langevin Algorithm by formulating a constrained optimization problem that balances mixing efficiency and discretization bias, resulting in an explicit optimal design that achieves faster convergence with controlled error.