On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems

Details On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems

2012-03-10

arxiv.org/abs/1203.2213v1

Computer Science

Information Theory

Scientific paper

In this paper, we study the mixing time of Markov Chain Monte Carlo (MCMC) for integer least-square (LS) optimization problems. It is found that the mixing time of MCMC for integer LS problems depends on the structure of the underlying lattice. More specifically, the mixing time of MCMC is closely related to whether there is a local minimum in the lattice structure. For some lattices, the mixing time of the Markov chain is independent of the signal-to-noise ($SNR$) ratio and grows polynomially in the problem dimension; while for some lattices, the mixing time grows unboundedly as $SNR$ grows. Both theoretical and empirical results suggest that to ensure fast mixing, the temperature for MCMC should often grow positively as the $SNR$ increases. We also derive the probability that there exist local minima in an integer least-square problem, which can be as high as $1/3-\frac{1}{\sqrt{5}}+\frac{2\arctan(\sqrt{5/3})}{\sqrt{5}\pi}$.

Affiliated with

Also associated with

No associations

Rating

On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488141