Some improved bounds in sampling discretization of integral norms

08/20/2022
by   F. Dai, et al.
0

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 the Nikol'skii-type inequality. In particular, we obtain some upper bounds on the number of sample points sufficient for good discretization of the integral L_p norms, 1≤ p<2, of functions from finite-dimensional subspaces of continuous functions. Our new results improve upon the known results in this direction. We use a new technique based on deep results of Talagrand from functional analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2021

Sampling discretization of integral norms and its application

The paper addresses the problem of sampling discretization of integral n...
research
07/23/2021

Universal sampling discretization

Let X_N be an N-dimensional subspace of L_2 functions on a probability s...
research
01/25/2020

Sampling discretization of integral norms

The paper is devoted to discretization of integral norms of functions fr...
research
05/12/2020

Sampling discretization of integral norms of the hyperbolic cross polynomials

The paper is devoted to discretization of integral norms of functions fr...
research
01/02/2022

On universal sampling representation

For the multivariate trigonometric polynomials we study convolution with...
research
02/25/2022

Constructive subsampling of finite frames with applications in optimal function recovery

In this paper we present new constructive methods, random and determinis...
research
01/19/2021

Subspace exploration: Bounds on Projected Frequency Estimation

Given an n × d dimensional dataset A, a projection query specifies a sub...

Please sign up or login with your details

Forgot password? Click here to reset