Oscillation of adaptative Metropolis-Hasting and simulated annealing algorithms around penalized least squares estimator
Abstract
In this work we study, as the temperature goes to zero, the oscillation of Metropolis-Hasting's algorithm around the Basis Pursuit De-noising solutions. We derive new criteria for choosing the proposal distribution and the temperature in Metropolis-Hasting's algorithm. Finally we apply these results to compare Metropolis-Hasting's and simulated annealing algorithms.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.