English
Related papers

Related papers: A sharp upper bound for sampling numbers in $L_{2}…

200 papers

Large scale optimization problems are ubiquitous in machine learning and data analysis and there is a plethora of algorithms for solving such problems. Many of these algorithms employ sub-sampling, as a way to either speed up the…

Optimization and Control · Mathematics 2016-02-29 Farbod Roosta-Khorasani , Michael W. Mahoney

We show that, for $n\geq 3$, $\lim_{t \to 0} e^{it\Delta}f(x) = f(x)$ holds almost everywhere for all $f \in H^s (\mathbb{R}^n)$ provided that $s>\frac{n}{2(n+1)}$. Due to a counterexample by Bourgain, up to the endpoint, this result is…

Classical Analysis and ODEs · Mathematics 2019-03-14 Xiumin Du , Ruixiang Zhang

In this paper, we consider the problem of recovering a compactly supported multivariate function from a collection of pointwise samples of its Fourier transform taken nonuniformly. We do this by using the concept of weighted Fourier frames.…

Numerical Analysis · Mathematics 2015-09-08 Ben Adcock , Milana Gataric , Anders C. Hansen

For a general Calderon-Zygmund operator $T$ on $R^N$, it is shown that $\|Tf\|_{L^2(w)}\leq C(T)\|w\|_{A_2}\|f\|_{L^2(w)}$ for all Muckenhoupt weights $w\in A_2$. This optimal estimate was known as the $A_2$ conjecture. A recent result of…

Classical Analysis and ODEs · Mathematics 2010-07-27 Tuomas P. Hytönen

We consider two theorems from the theory of compressive sensing. Mainly a theorem concerning uniform recovery of random sampling matrices, where the number of samples needed in order to recover an $s$-sparse signal from linear measurements…

Information Theory · Computer Science 2013-06-05 Joel Andersson , Jan-Olov Strömberg

The high complexity of many-body quantum dynamics means that essentially all approaches either exploit special structure or are approximate in nature. One such approach--the memory function formalism--involves a carefully chosen split into…

Quantum Physics · Physics 2026-03-04 Oliver Lunt , Thomas Kriecherbauer , Kenneth T-R McLaughlin , Curt von Keyserlingk

It is well-known that the problem of sampling recovery in the $L_2$-norm on unweighted Korobov spaces (Sobolev spaces with mixed smoothness) as well as classical smoothness classes such as H\"older classes suffers from the curse of…

Numerical Analysis · Mathematics 2024-02-26 David Krieg

We consider the recovery of real-valued bandlimited functions from the absolute values of their samples, possibly spaced nonuniformly. We show that such a reconstruction is always possible if the function is sampled at more than twice its…

Numerical Analysis · Mathematics 2012-01-17 Gaurav Thakur

In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying distribution. Our variant allows for tighter…

Machine Learning · Computer Science 2017-11-07 Noga Alon , Moshe Babaioff , Yannai A. Gonczarowski , Yishay Mansour , Shay Moran , Amir Yehudayoff

The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…

Analysis of PDEs · Mathematics 2024-05-07 Nicholas Edelen , Aaron Naber , Daniele Valtorta

Let Y={f(i), Af(i),..., A^{li} f(i): i in Omega}, where A is a bounded operator on l^2(I). The problem under consideration is to find necessary and sufficient conditions on A, Omega, {l_i:i in Omega} in order to recover any f \in l^2(I)…

Classical Analysis and ODEs · Mathematics 2014-10-01 A. Aldroubi , C. Cabrelli , U. Molter , S. Tang

We provide sufficient conditions on a family of functions $(\phi_\alpha)_{\alpha\in A}:\mathbb{R}^d\to\mathbb{R}$ for sampling of multivariate bandlimited functions at certain nonuniform sequences of points in $\mathbb{R}^d$. We consider…

Functional Analysis · Mathematics 2018-02-14 Keaton Hamm

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

Data Structures and Algorithms · Computer Science 2018-12-24 Haim Avron , Michael Kapralov , Cameron Musco , Christopher Musco , Ameya Velingker , Amir Zandieh

Universal (pointwise uniform and time shifted) truncation error upper bounds are presented in Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function class $B_{\pi,d}^q\,,\ q \ge 1,$ $d\in \mathbb N\,,$ when…

Information Theory · Computer Science 2013-07-15 Andriy Olenko , Tibor K. Pogány

We discuss the problems of uniqueness, sampling and reconstruction with derivatives in the space of bandlimited functions. We prove that if X is sequence of real numbers such that the maximum gap between two consecutive samples is less than…

Functional Analysis · Mathematics 2020-07-23 A Antony Selvan

We proved that for every sufficiently large $n$, the complete graph $K_{2n}$ with an arbitrary edge signing $\sigma: E(K_{2n}) \to \{-1, +1\}$ admits a high discrepancy $1$-factor decomposition. That is, there exists a universal constant $c…

Combinatorics · Mathematics 2025-03-24 Jiangdong Ai , Fankang He , Seonghyuk Im , Hyunwoo Lee

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

General Mathematics · Mathematics 2023-04-04 Zsófia Juhász , Máté Bartalos , Péter Magyar , Gábor Farkas

We study integration and $L^2$-approximation in the worst-case setting for deterministic linear algorithms based on function evaluations. The underlying function space is a reproducing kernel Hilbert space with a Gaussian kernel of tensor…

Numerical Analysis · Mathematics 2025-12-08 Michael Gnewuch , Klaus Ritter , Robin Rüßmann

Let $\xi = \{x^j\}_{j=1}^n$ be a grid of $n$ points in the $d$-cube ${\II}^d:=[0,1]^d$, and $\Phi = \{\phi_j\}_{j =1}^n$ a family of $n$ functions on ${\II}^d$. We define the linear sampling algorithm $L_n(\Phi,\xi,\cdot)$ for an…

Functional Analysis · Mathematics 2010-09-23 Dinh Dũng

Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We select a partition from the set $\Sigma_{2n}$ uniformly at random. Let $2G_n$ be the number partitioned by…

Number Theory · Mathematics 2015-08-20 Ljuben Mutafchiev