English
Related papers

Related papers: Random zero sets with local growth guarantees

200 papers

Consider a random uniform sample of $n$ points in a compact region $A$ of Euclidean $d$-space, $d \geq 2$, with a smooth or (when $d=2$) polygonal boundary. Fix $k \in {\bf N}$. Let $T_{n,k}$ be the threshold $r$ at which the geometric…

Probability · Mathematics 2024-07-18 Mathew D. Penrose , Xiaochuan Yang

The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a…

Statistics Theory · Mathematics 2013-12-23 Charles Fefferman , Sanjoy Mitter , Hariharan Narayanan

We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube in an almost isometric way. We construct a simple, data-oblivious, and computationally efficient map that achieves this task with high…

Probability · Mathematics 2022-09-07 Sjoerd Dirksen , Shahar Mendelson , Alexander Stollenwerk

Let $U$ be a Morse function on a compact connected $m$-dimensional Riemannian manifold, $m \geq 2,$ satisfying $\min U=0$ and let $\mathcal{U} = \{x \in M \: : U(x) = 0\}$ be the set of global minimizers. Consider the stochastic algorithm…

Probability · Mathematics 2024-01-24 Michel Benaïm , Laurent Miclo

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

General Topology · Mathematics 2015-06-26 Semeon Bogatyi , Vesko Valov

We study the approximation of expectations $\E(f(X))$ for Gaussian random elements $X$ with values in a separable Hilbert space $H$ and Lipschitz continuous functionals $f \colon H \to \R$. We consider restricted Monte Carlo algorithms,…

Numerical Analysis · Mathematics 2018-02-15 Michael B. Giles , Mario Hefter , Lukas Mayer , Klaus Ritter

Let $H := \begin{pmatrix} 1 & {\mathbf R} & {\mathbf R} \\ 0 & 1 &{\mathbf R} \\ 0 & 0 & 1 \end{pmatrix}$ denote the Heisenberg group with the usual Carnot-Carath\'eodory metric $d$. It is known (since the work of Pansu and Semmes) that the…

Analysis of PDEs · Mathematics 2019-07-16 Terence Tao

Given independent standard Gaussian points $v_1, \ldots, v_n$ in dimension $d$, for what values of $(n, d)$ does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of the points? This…

Data Structures and Algorithms · Computer Science 2023-06-02 Aaron Potechin , Paxton Turner , Prayaag Venkat , Alexander S. Wein

In this article, we give probabilistic versions of Sobolev embeddings on any Riemannian manifold $(M,g)$. More precisely, we prove that for natural probability measures on $L^2(M)$, almost every function belong to all spaces $L^p(M)$,…

Analysis of PDEs · Mathematics 2011-12-01 Nicolas Burq , Gilles Lebeau

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

Numerical Analysis · Mathematics 2021-02-11 Nicolas Nagel , Martin Schäfer , Tino Ullrich

One of the landmarks in approximation algorithms is the $O(\sqrt{\log n})$-approximation algorithm for the Uniform Sparsest Cut problem by Arora, Rao and Vazirani from 2004. The algorithm is based on a semidefinite program that finds an…

Data Structures and Algorithms · Computer Science 2016-07-05 Thomas Rothvoss

Let $\mathcal{M}$ be a semifinite von Neumann algebra and let $E$ be a symmetric function space on $(0,\infty)$. Denote by $E(\mathcal{M})$ the non-commutative symmetric space of measurable operators affiliated with $\mathcal{M}$ and…

Operator Algebras · Mathematics 2024-12-09 Aleksey Ber , Fedor Sukochev , Dmitriy Zanin , Hongyin Zhao

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Data Structures and Algorithms · Computer Science 2014-03-19 David P. Woodruff , Qin Zhang

In a recent paper the author proved a theorem to the effect that the matrix of normalized Euclidean distances on the set of specially distributed random points in the $n$-dimensional Euclidean space $\mathbb R^{n}$ with independent…

Mathematical Physics · Physics 2015-09-07 A. P. Zubarev

It is proved that for any $0<\beta<\alpha$, any bounded Ahlfors $\alpha$-regular space contains a $\beta$-regular compact subset that embeds biLipschitzly in an ultrametric with distortion at most $O(\alpha/(\alpha-\beta))$. The bound on…

Metric Geometry · Mathematics 2022-12-02 Manor Mendel

We analyze the classical EM algorithm for parameter estimation in the symmetric two-component Gaussian mixtures in $d$ dimensions. We show that, even in the absence of any separation between components, provided that the sample size…

Statistics Theory · Mathematics 2019-08-30 Yihong Wu , Harrison H. Zhou

Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x, y in K is nearly…

Probability · Mathematics 2013-09-27 Yaniv Plan , Roman Vershynin

We study the nonparametric maximum likelihood estimator $\widehat{\pi}$ for Gaussian location mixtures in one dimension. It has been known since (Lindsay, 1983) that given an $n$-point dataset, this estimator always returns a mixture with…

Statistics Theory · Mathematics 2025-03-27 Yury Polyanskiy , Mark Sellke

Let $L_N = L_{MBM}(X_1,..., X_N; Y_1,..., Y_N)$ be the minimum length of a bipartite matching between two sets of points in $\mathbf{R}^d$, where $X_1,..., X_N,...$ and $Y_1,..., Y_N,...$ are random points independently and uniformly…

Combinatorics · Mathematics 2007-05-23 J. H. Boutet de Monvel , O. C. Martin

We study the fundamental problem of estimating the mean of a $d$-dimensional distribution with covariance $\Sigma \preccurlyeq \sigma^2 I_d$ given $n$ samples. When $d = 1$, \cite{catoni} showed an estimator with error $(1+o(1)) \cdot…

Statistics Theory · Mathematics 2024-02-20 Shivam Gupta , Samuel B. Hopkins , Eric Price