Table of Contents
Fetching ...

Stochastic Exploration of Real Varieties via Variety Distributions

David Kahle, Jonathan D Hauenstein

Abstract

Nonlinear systems of polynomial equations arise naturally in many applied settings, for example loglinear models on contingency tables and Gaussian graphical models. The solution sets to these systems over the reals are often positive dimensional spaces that in general may be very complicated yet have very nice local behavior almost everywhere. Standard methods in real algebraic geometry for describing positive dimensional real solution sets include cylindrical algebraic decomposition and numerical cell decomposition, both of which can be costly to compute in many practical applications. In this work we communicate recent progress towards a Monte Carlo framework for exploring such real solution sets. After describing how to construct probability distributions whose mass focuses on a variety of interest, we describe how Hamiltonian Monte Carlo methods can be used to sample points near the variety that may then be moved to the variety using endgames. We conclude by showcasing trial experiments using practical implementations of the method in the Bayesian engine Stan.

Stochastic Exploration of Real Varieties via Variety Distributions

Abstract

Nonlinear systems of polynomial equations arise naturally in many applied settings, for example loglinear models on contingency tables and Gaussian graphical models. The solution sets to these systems over the reals are often positive dimensional spaces that in general may be very complicated yet have very nice local behavior almost everywhere. Standard methods in real algebraic geometry for describing positive dimensional real solution sets include cylindrical algebraic decomposition and numerical cell decomposition, both of which can be costly to compute in many practical applications. In this work we communicate recent progress towards a Monte Carlo framework for exploring such real solution sets. After describing how to construct probability distributions whose mass focuses on a variety of interest, we describe how Hamiltonian Monte Carlo methods can be used to sample points near the variety that may then be moved to the variety using endgames. We conclude by showcasing trial experiments using practical implementations of the method in the Bayesian engine Stan.

Paper Structure

This paper contains 18 sections, 18 equations, 20 figures.

Figures (20)

  • Figure 1: (Left to right.) $\mathfrak{N}_{2}\left(x^{2} + y^{2} - 1,\sigma^{2}\right)$ from (\ref{['defn:hvn']}) with $\sigma = .1$, $.2$, $.3$, and $.4$; $\mathcal{V}(g)$ in red.
  • Figure 2: Equidistant level sets of $g = y^{2} - (x^{3} + x^{2})$ do not result equidistant contours. From left to right: The graph of $g$ with equally spaced slices in $z$; those intersections projected down into the $xy$-plane; the gradient vector field on the variety; and the density plot of the HVN with $\sigma = .1$.
  • Figure 3: For a fixed amount of shifting up/down, varieties of rapidly changing functions exhibit less change than those of slowly changing functions. Curvature modulates this change in different directions.
  • Figure 4: Equidistant level sets of $\overline{g} = g/\left|\left|\nabla_{\bm{x}} g\right|\right|_{}$ result in approximately equidistant contours ($\sigma = .1$). Vectors drawn with $2\sigma$ magnitude.
  • Figure 5: From left to right, density plots of $\mathcal{N}_{2,\bm{\mathcal{X}}}\left(\overline{g},\sigma^{2}\right)$, truncated to the window, with $g = x^{2}+(4y)^{2}-1$, $(y-x)(y+x)$, $(x^{2}+y^{2})^{3}-4x^{2}y^{2}$, and $(x^{2}+y^{2}-1)^{3}-x^{2}y^{3}$ and $\sigma = .05$. Aesthetic scales are consistent across the images. Note abnormalities at singularities in the last image.
  • ...and 15 more figures

Theorems & Definitions (4)

  • Definition 1
  • Definition 2
  • Definition 3
  • Definition 4