Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases

by   Nima Anari, et al.

We define a notion of isotropy for discrete set distributions. If μ is a distribution over subsets S of a ground set [n], we say that μ is in isotropic position if P[e ∈ S] is the same for all e∈ [n]. We design a new approximate sampling algorithm that leverages isotropy for the class of distributions μ that have a log-concave generating polynomial; this class includes determinantal point processes, strongly Rayleigh distributions, and uniform distributions over matroid bases. We show that when μ is in approximately isotropic position, the running time of our algorithm depends polynomially on the size of the set S, and only logarithmically on n. When n is much larger than the size of S, this is significantly faster than prior algorithms, and can even be sublinear in n. We then show how to transform a non-isotropic μ into an equivalent approximately isotropic form with a polynomial-time preprocessing step, accelerating subsequent sampling times. The main new ingredient enabling our algorithms is a class of negative dependence inequalities that may be of independent interest. As an application of our results, we show how to approximately count bases of a matroid of rank k over a ground set of n elements to within a factor of 1+ϵ in time O((n+1/ϵ^2)· poly(k, log n)). This is the first algorithm that runs in nearly linear time for fixed rank k, and achieves an inverse polynomially low approximation error.



There are no comments yet.


page 1

page 2

page 3

page 4


Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees

We prove tight mixing time bounds for natural random walks on bases of m...

Domain Sparsification of Discrete Distributions using Entropic Independence

We present a framework for speeding up the time it takes to sample from ...

Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids

We give a deterministic polynomial time 2^O(r)-approximation algorithm f...

Strong Coresets for Subspace Approximation and k-Median in Nearly Linear Time

Recently the first (1+ϵ)-approximate strong coresets for k-median and su...

Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid

We use recent developments in the area of high dimensional expanders and...

Rejection sampling from shape-constrained distributions in sublinear time

We consider the task of generating exact samples from a target distribut...
This week in AI

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