Oscillation of adaptative Metropolis-Hasting and simulated annealing algorithms around penalized least squares estimator
classification
🧮 math.ST
stat.TH
keywords
metropolis-hastingalgorithmalgorithmsannealingaroundoscillationsimulatedtemperature
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.