q-Paths: Generalizing the Geometric Annealing Path using Power Means

Vaden Masrani, Rob Brekelmans, Thang Bui, Frank Nielsen, Aram Galstyan, Greg Ver Steeg, Frank Wood

TL;DR

This paper introduces "q-paths," a new family of interpolation paths between probability distributions that generalizes the standard "geometric path." Unlike previous methods, q-paths don't require distributions to be from an exponential family and have a simple closed-form expression, leading to improved performance in Bayesian inference and generative model evaluation.

What Problem Does This Paper Address?

Many machine learning tasks, such as estimating marginal likelihoods or performing Bayesian inference, require constructing a sequence of intermediate probability distributions (an "annealing path") between a known base distribution and a target distribution. The most common method is the "geometric path," which uses a geometric average. While alternatives like the "moment-averaging path" have shown promise, they often rely on restrictive assumptions about the distributions being from an "exponential family" and can lack a simple closed-form energy function, making them difficult to implement. This paper aims to overcome these limitations by proposing a more general and practical annealing path.

Methods

The core contribution is the introduction of q-paths, which are derived from a generalized notion of the mean called the "power mean." This generalized mean is based on the deformed logarithm and exponential functions from nonextensive thermodynamics. The q-path is defined as:

$$ \pi_{\beta,q}(z) = \left( (1 - \beta) \pi_0(z)^{1-q} + \beta \pi_1(z)^{1-q} \right)^{\frac{1}{1-q}} $$

where $\pi_0(z)$ and $\pi_1(z)$ are the unnormalized endpoint distributions, and $\beta \in [0,1]$ is the mixing parameter. A key aspect is that as $q \to 1$, the q-path recovers the standard geometric path. The authors also show that q-paths can be interpreted as corresponding to a "q-exponential family" of distributions and can be viewed as minimizing a mixture of $\alpha$-divergences to the endpoints. This generalized framework allows for arbitrary endpoint distributions and provides a closed-form energy function, making it suitable for MCMC sampling.

Datasets

The paper uses standard datasets for evaluation:

  • Pima Indians diabetes dataset and Sonar dataset for Sequential Monte Carlo (SMC) experiments.
  • Omniglot dataset for evaluating generative models using Annealed Importance Sampling (AIS).

Key Insights and Ideas

  • Generalization of Annealing Paths: Q-paths offer a unified framework that encompasses the geometric and arithmetic means as special cases, providing more flexibility than previous methods.
  • Relaxed Assumptions: The ability to handle arbitrary endpoint distributions, without requiring them to be from an exponential family, significantly broadens the applicability of annealing techniques.
  • Closed-Form Energy Function: The simple closed-form expression for q-paths is crucial for efficient implementation in MCMC sampling methods.
  • Connection to Nonextensive Thermodynamics: The use of deformed logarithms and exponentials links q-paths to a well-established theoretical framework, providing a principled way to generalize means.
  • Empirical Gains: Small deviations from the geometric path (i.e., using q ≠ 1) can lead to noticeable improvements in performance for both Bayesian inference and generative model evaluation.

Key Results

  • Improved SMC Performance: In experiments on binary regression models, q-paths with specific values of $q$ (e.g., $q=0.9972$) outperformed the geometric path in terms of marginal likelihood estimation and reduced variability across runs. Table 1 shows consistent gains for q-paths over the geometric path on both Pima and Sonar datasets.
  • Enhanced Generative Model Evaluation: For evaluating generative models using AIS on the Omniglot dataset, q-paths achieved better stochastic lower and upper bounds compared to the geometric path, especially for a large number of annealing distributions. Figure 7 and 11 illustrate these improvements.
  • Robustness: The paper demonstrates that q-paths can achieve mass-covering behavior in difficult annealing problems where the geometric path might fail.

Limitations and Future Work

  • Choosing q: While the paper provides a heuristic for choosing $q$ based on ESS (Effective Sample Size), finding the optimal $q$ can still be challenging and may require grid search or more sophisticated heuristics.
  • Heuristic Improvements: Future work could involve developing more advanced heuristics for selecting $q$, potentially by considering truncated or parallel sampling chains.
  • Broader Applications: The authors suggest exploring q-paths in other contexts like parallel tempering (PT) and variational inference.
  • Escort Moment-Averaging Path: While promising for parametric endpoints, the escort moment-averaging path's applicability is limited to specific family structures.

Summary updated

Abstract

Many common machine learning methods involve the geometric annealing path, a sequence of intermediate densities between two distributions of interest constructed using the geometric average. While alternatives such as the moment-averaging path have demonstrated performance gains in some settings, their practical applicability remains limited by exponential family endpoint assumptions and a lack of closed form energy function. In this work, we introduce $q$-paths, a family of paths which is derived from a generalized notion of the mean, includes the geometric and arithmetic mixtures as special cases, and admits a simple closed form involving the deformed logarithm function from nonextensive thermodynamics. Following previous analysis of the geometric path, we interpret our $q$-paths as corresponding to a $q$-exponential family of distributions, and provide a variational representation of intermediate densities as minimizing a mixture of $\alpha$-divergences to the endpoints. We show that small deviations away from the geometric path yield empirical gains for Bayesian inference using Sequential Monte Carlo and generative model evaluation using Annealed Importance Sampling.
BibTeX
@inproceedings{masrani2021q,
  author = {Vaden Masrani and Rob Brekelmans and Thang Bui and Frank Nielsen and Aram Galstyan and Greg Ver Steeg and Frank Wood},
  title = {{q-Paths: Generalizing the Geometric Annealing Path using Power Means}},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year = {2021},
  url = {https://openreview.net/forum?id=7hRdrxbg7},
}

Loading related content...

Figure