English
Related papers

Related papers: Discretizing $L_p$ norms and frame theory

200 papers

The paper addresses a problem of sampling discretization of integral norms of elements of finite-dimensional subspaces satisfying some conditions. We prove sampling discretization results under a standard assumption formulated in terms of…

Functional Analysis · Mathematics 2023-04-13 F. Dai , E. Kosov , V. Temlyakov

In the first part of the paper we study absolute error of sampling discretization of the integral $L_p$-norm for function classes of continuous functions. We use basic approaches from chaining technique to provide general upper bounds for…

Numerical Analysis · Mathematics 2024-08-12 E. D. Kosov , V. N. Temlyakov

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…

Functional Analysis · Mathematics 2024-05-08 E. D. Kosov , V. N. Temlyakov

The paper studies the sampling discretization problem for integral norms on subspaces of $L^p(\mu)$. Several close to optimal results are obtained on subspaces for which certain Nikolskii-type inequality is valid. The problem of norms…

Functional Analysis · Mathematics 2021-03-11 Egor Kosov

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set…

Numerical Analysis · Mathematics 2021-12-14 Boris Kashin , Sergei Konyagin , Vladimir Temlyakov

This survey addresses sampling discretization and its connections with other areas of mathematics. The survey concentrates on sampling discretization of norms of elements of finite-dimensional subspaces. We present here known results on…

Functional Analysis · Mathematics 2022-02-11 B. Kashin , E. Kosov , I. Limonova , V. Temlyakov

We prove a sampling discretization theorem for the square norm of functions from a finite dimensional subspace satisfying Nikol'skii's inequality with an upper bound on the number of sampling points of the order of the dimension of the…

Functional Analysis · Mathematics 2021-04-23 Irina Limonova , Vladimir Temlyakov

The paper addresses the problem of sampling discretization of integral norms of elements of finite-dimensional subspaces satisfying some conditions. We prove sampling discretization results under two standard kinds of assumptions --…

Numerical Analysis · Mathematics 2021-09-21 F. Dai , V. Temlyakov

In this paper, we resolve the one-pass space complexity of $L_p$ sampling for $p \in (0,2)$. Given a stream of updates (insertions and deletions) to the coordinates of an underlying vector $f \in \mathbb{R}^n$, a perfect $L_p$ sampler must…

Data Structures and Algorithms · Computer Science 2019-11-12 Rajesh Jayaram , David P. Woodruff

We study the $L_p$-discrepancy of random point sets in high dimensions, with emphasis on small values of $p$. Although the classical $L_p$-discrepancy suffers from the curse of dimensionality for all $p \in (1,\infty)$, the gap between…

Numerical Analysis · Mathematics 2025-12-10 Erich Novak , Friedrich Pillichshammer

Let $X_N$ be an $N$-dimensional subspace of $L_2$ functions on a probability space $(\Omega, \mu)$ spanned by a uniformly bounded Riesz basis $\Phi_N$. Given an integer $1\leq v\leq N$ and an exponent $1\leq q\leq 2$, we obtain universal…

Functional Analysis · Mathematics 2021-07-27 Feng Dai , V. Temlyakov

In this paper, we propose a novel sparse learning based feature selection method that directly optimizes a large margin linear classification model sparsity with l_(2,p)-norm (0 < p < 1)subject to data-fitting constraints, rather than using…

Machine Learning · Computer Science 2015-04-03 Hanyang Peng , Yong Fan

We consider infinitely dimensional classes of functions and instead of the relative error setting, which was used in previous papers on the integral norm discretization, we consider the absolute error setting. We demonstrate how known…

Numerical Analysis · Mathematics 2022-03-15 V. N. Temlyakov

Let $H$ be an infinite-dimensional separable Hilbert space and let $(X,d,\mu)$ be a metric measure space satisfying the doubling and upper Alhfors regularity conditions at small scale. We prove that every bounded continuous tight frame…

Functional Analysis · Mathematics 2026-03-12 Marcin Bownik , Pu-Ting Yu

A discrete frame for $L^2({\mathbb R}^d)$ is a countable sequence $\{e_j\}_{j\in J}$ in $L^2({\mathbb R}^d)$ together with real constants $0<A\leq B< \infty$ such that $$ A\|f\|_2^2 \leq \sum_{j\in J}|\langle f,e_j \rangle |^2 \leq…

Classical Analysis and ODEs · Mathematics 2021-02-05 Mahya Ghandehari , Kris Hollingsworth

We characterize the streaming space complexity of every symmetric norm $l$ (a norm on $\mathbb{R}^n$ invariant under sign-flips and coordinate-permutations), by relating this space complexity to the measure-concentration characteristics of…

Data Structures and Algorithms · Computer Science 2017-06-27 Jaroslaw Blasiok , Vladimir Braverman , Stephen R. Chestnut , Robert Krauthgamer , Lin F. Yang

The L1 norm has been tremendously popular in signal and image processing in the past two decades due to its sparsity-promoting properties. More recently, its generalization to non-Euclidean domains has been found useful in shape analysis…

Numerical Analysis · Computer Science 2016-09-20 Alex Bronstein , Yoni Choukroun , Ron Kimmel , Matan Sela

We study the problem of sampling from a distribution under local differential privacy (LDP). Given a private distribution $P \in \mathcal{P}$, the goal is to generate a single sample from a distribution that remains close to $P$ in…

Machine Learning · Computer Science 2025-10-13 Hrad Ghoukasian , Bonwoo Lee , Shahab Asoodeh

We consider the unconstrained $L_2$-$L_p$ minimization: find a minimizer of $\|Ax-b\|^2_2+\lambda \|x\|^p_p$ for given $A \in R^{m\times n}$, $b\in R^m$ and parameters $\lambda>0$, $p\in [0,1)$. This problem has been studied extensively in…

Computational Complexity · Computer Science 2011-05-04 Xiaojun Chen , Dongdong Ge , Zizhuo Wang , Yinyu Ye

We obtain new sampling discretization results in Orlicz norms on finite dimensional spaces. As applications, we study sampling recovery problems, where the error of the recovery process is calculated with respect to different Orlicz norms.…

Functional Analysis · Mathematics 2024-08-27 Egor Kosov , Sergey Tikhonov
‹ Prev 1 2 3 10 Next ›