Some improved bounds in sampling discretization of integral norms
F. Dai, E. Kosov, V. Temlyakov

TL;DR
This paper improves bounds on the number of sample points needed for discretizing integral norms of functions in finite-dimensional subspaces, using advanced functional analysis techniques.
Contribution
It introduces new bounds for sampling discretization of $L_p$ norms, leveraging Talagrand's deep results and under standard Nikol'skii-type assumptions.
Findings
Improved upper bounds on sample points for $L_p$ norm discretization.
Applicable to finite-dimensional subspaces of continuous functions.
Utilizes novel techniques based on Talagrand's functional analysis results.
Abstract
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 norms, , 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Numerical methods in inverse problems · Sparse and Compressive Sensing Techniques
