相关论文: An Almost Constant Lower Bound of the Isoperimetri…
We prove that the Bourgain slicing conjecture and the Kannan-Lov\'asz-Simonovits (KLS) isoperimetric conjecture in $\mathbb{R}^n$ hold true up to a factor of $\sqrt{\log n}$. A new ingredient used in the proof is an improved log-concave…
We prove that Bourgain's hyperplane conjecture and the Kannan-Lov\'asz-Simonovits (KLS) isoperimetric conjecture hold true up to a factor that is polylogarithmic in the dimension.
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…
It is well known that if a random vector satisfies a log-Sobolev inequality, all of its marginals have subgaussian tails. In the spirit of the KLS conjecture, we investigate whether this implication can be reversed under a log-concavity…
What is the optimal way to cut a convex bounded domain $K$ in Euclidean space $(\mathbb{R}^n,|\cdot|)$ into two halves of equal volume, so that the interface between the two halves has least surface area? A conjecture of Kannan, Lov\'asz…
We show that the Cheeger constant for $n$-dimensional isotropic logconcave measures is $O(n^{1/4})$, improving on the previous best bound of $O(n^{1/3}\sqrt{\log n}).$ As corollaries we obtain the same improved bound on the thin-shell…
Log-concave sampling has witnessed remarkable algorithmic advances in recent years, but the corresponding problem of proving lower bounds for this task has remained elusive, with lower bounds previously known only in dimension one. In this…
We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…
Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…
Having its origin in theoretical computer science, the Kannan-Lov\'asz-Simonovits (KLS) conjecture is one of the major open problems in asymptotic convex geometry and high-dimensional probability theory today. In this work, we establish a…
Bayesian coresets speed up posterior inference in the large-scale data regime by approximating the full-data log-likelihood function with a surrogate log-likelihood based on a small, weighted subset of the data. But while Bayesian coresets…
We consider the isoperimetric inequality on the class of high-dimensional isotropic convex bodies. We establish quantitative connections between two well-known open problems related to this inequality, namely, the thin shell conjecture, and…
We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…
An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…
The central limit theorem for convex bodies says that with high probability the marginal of an isotropic log-concave distribution along a random direction is close to a Gaussian, with the quantitative difference determined asymptotically by…
Recent study in K-stability suggests that klt singularities whose local volumes are bounded away from zero should be bounded up to special degeneration. We show that this is true in dimension three, or when the minimal log discrepancies of…
Bregman divergences $D_\phi$ are a class of divergences parametrized by a convex function $\phi$ and include well known distance functions like $\ell_2^2$ and the Kullback-Leibler divergence. There has been extensive research on algorithms…
These are lecture notes focusing on recent progress towards Bourgain's slicing problem and the isoperimetric conjecture proposed by Kannan, Lovasz and Simonovits (KLS).
We present theoretical properties of the log-concave maximum likelihood estimator of a density based on an independent and identically distributed sample in $\mathbb{R}^d$. Our study covers both the case where the true underlying density is…