Efficient sampling from the Bingham distribution

09/30/2020 ∙ by Rong Ge, et al. ∙ 0

We give a algorithm for exact sampling from the Bingham distribution p(x)∝(x^⊤ A x) on the sphere 𝒮^d-1 with expected runtime of poly(d, λ_max(A)-λ_min(A)). The algorithm is based on rejection sampling, where the proposal distribution is a polynomial approximation of the pdf, and can be sampled from by explicitly evaluating integrals of polynomials over the sphere. Our algorithm gives exact samples, assuming exact computation of an inverse function of a polynomial. This is in contrast with Markov Chain Monte Carlo algorithms, which are not known to enjoy rapid mixing on this problem, and only give approximate samples. As a direct application, we use this to sample from the posterior distribution of a rank-1 matrix inference problem in polynomial time.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.