Related papers: A robust Khintchine inequality, and algorithms for…
We propose new optimal estimators for the Lipschitz frontier of a set of points. They are defined as kernel estimators being sufficiently regular, covering all the points and whose associated support is of smallest surface. The estimators…
The Bohnenblust-Hille inequality for $m$-linear forms was proven in 1931 as a generalization of the famous 4/3-Littlewood inequality. The optimal constants (or at least their asymptotic behavior as $m$ grows) is unknown, but significant for…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
This article investigates sharp comparison of moments for various classes of random variables appearing in a geometric context. In the first part of our work we find the optimal constants in the Khintchine inequality for random vectors…
First we consider the following problem which dates back to Chebyshev, Zolotarev and Achieser: among all trigonometric polynomials with given leading coefficients $a_0,...,a_l,$ $b_0,...,b_l \in \mathbb R$ find that one with least maximum…
This note is concerned with the Bianchi-Egnell inequality, which quantifies the stability of the Sobolev inequality, and its generalization to fractional exponents $s \in (0, \frac{d}{2})$. We prove that in dimension $d \geq 2$ the best…
We obtain new proofs with improved constants of the Khintchine-type inequality with matrix coefficients in two cases. The first case is the Pisier and Lust-Piquard noncommutative Khintchine inequality for $p=1$, where we obtain the sharp…
We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…
We study the fundamental problem of high-dimensional mean estimation in a robust model where a constant fraction of the samples are adversarially corrupted. Recent work gave the first polynomial time algorithms for this problem with…
We give a partial negative answer to a question left open in a previous work by Brasco and the first and third-named authors concerning the sharp constant in the fractional Hardy inequality on convex sets. Our approach has a geometrical…
Principal component analysis (PCA) is a powerful standard tool for reducing the dimensionality of data. Unfortunately, it is sensitive to outliers so that various robust PCA variants were proposed in the literature. This paper addresses the…
We study the dimensional Brunn-Minkowski inequality for even log-concave probability measures $\mu$ on $\mathbb{R}^n$ via an analytic approach based on diffusion operators and gradient estimates. Our main result asserts that for every pair…
Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…
Let K be a closed bounded convex subset of $\Bbb R^n$; then by a result of the first author, which extends a classical theorem of Whitney there is a constant $w_m(K)$ so that for every continuous function f on K there is a polynomial $\phi$…
We establish optimal stability estimates in terms of the Fraenkel asymmetry with universal dimensional constants for a Lorentzian isoperimetric inequality due to Bahn and Ehrlich and, as a consequence, for a special version of a Lorentzian…
A mean step in Haagerup's proof for the optimal constants in Khintchine's inequality is to show integral inequalities of type $\int(g^s-f^s)\mathrm{d}\mu\geq 0$. F.L. Nazarov and A.N. Podkorytov made Haagerup's proof much more clearer for…
Sliced Wasserstein distances preserve properties of classic Wasserstein distances while being more scalable for computation and estimation in high dimensions. The goal of this work is to quantify this scalability from three key aspects: (i)…
This paper considers phase retrieval from the magnitude of 1D over-sampled Fourier measurements, a classical problem that has challenged researchers in various fields of science and engineering. We show that an optimal vector in a…
We explore the optimality of the constants making valid the recently established Little Grothendieck inequality for JB$^*$-triples and JB$^*$-algebras. In our main result we prove that for each bounded linear operator $T$ from a…
We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $\Omega(n^{1/2-c})$. This improves the $\tilde\Omega(n^{1/3})$ lower bound of [CWX17] and…