Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2023 May 15;381(2247):20220150.
doi: 10.1098/rsta.2022.0150. Epub 2023 Mar 27.

On free energy barriers in Gaussian priors and failure of cold start MCMC for high-dimensional unimodal distributions

Affiliations

On free energy barriers in Gaussian priors and failure of cold start MCMC for high-dimensional unimodal distributions

Afonso S Bandeira et al. Philos Trans A Math Phys Eng Sci. .

Abstract

We exhibit examples of high-dimensional unimodal posterior distributions arising in nonlinear regression models with Gaussian process priors for which Markov chain Monte Carlo (MCMC) methods can take an exponential run-time to enter the regions where the bulk of the posterior measure concentrates. Our results apply to worst-case initialized ('cold start') algorithms that are local in the sense that their step sizes cannot be too large on average. The counter-examples hold for general MCMC schemes based on gradient or random walk steps, and the theory is illustrated for Metropolis-Hastings adjusted methods such as preconditioned Crank-Nicolson and Metropolis-adjusted Langevin algorithm. This article is part of the theme issue 'Bayesian inference: challenges, perspectives, and prospects'.

Keywords: Bayesian inference; Gaussian processes; MCMC; computational hardness.

PubMed Disclaimer

Conflict of interest statement

We declare we have no competing interests.

Figures

Figure 1.
Figure 1.
Two possible sources of MCMC hardness in high dimensions: multi-modal likelihoods and entropic barriers. (a) In low dimensions (here D=1), MCMC hardness usually arises because of a non-unimodal likelihood, creating an ‘energy barrier’, even though the maximum likelihood is attained at θ=θ0. The MCMC algorithm is assumed to be initialized in the set S containing a local maximum of the likelihood. (b) Illustration of the arising of entropic (or volumetric) difficulties, here in dimension D=3: the set of points close to θ0 has much less volume than the set of points far away. As D increases, this phenomenon is amplified: all ratios of volumes of the three sets T,W,S scale exponentially with D. (Online version in colour.)
Figure 2.
Figure 2.
Illustration of a free-energy barrier (or free-entropy well) arising with a unimodal posterior. The model is an ‘averaged’ version of the spiked tensor model, with log-likelihood n(θ)=λθ,θ03/2 and uniform prior Π on the n-dimensional unit sphere Sn1. θ0 is chosen arbitrarily on Sn1. The posterior is dΠ(θ|Y)exp{nn(θ)}dΠ(θ), for θSn1. Up to a constant, the free entropy F(r)=(1/n)logdΠ(θ|Y)δ(r||θθ0||2) can be decomposed as the sum of n(θ) (that only depends on r=||θθ0||2) and the ‘entropic’ contribution (1/n)logdΠ(θ)δ(r||θθ0||2). In the figure we show λ=2.1. (Online version in colour.)

References

    1. Anderson PW. 1989. Spin glass VI: spin glass as cornucopia. Phys. Today 42, 9.
    1. Mézard M, Montanari A. 2009. Information, physics, and computation. Oxford, UK: Oxford University Press.
    1. Zdeborová L, Krzakala F. 2016. Statistical physics of inference: thresholds and algorithms. Adv. Phys. 65, 453-552.
    1. Ben Arous G, Gheissari R, Jagannath A. 2020. Algorithmic thresholds for tensor PCA. Ann. Probab. 48, 2052-2087. (10.1214/19-AOP1415) - DOI
    1. Ben Arous G, Wein AS, Zadik I. 2020. Free energy wells and overlap gap property in sparse PCA. In Conf. on Learning Theory, Graz, Austria, 9–12 July 2020, pp. 479–482. PMLR.

LinkOut - more resources