Random points are good for universal discretization

F. Dai; V. Temlyakov

doi:10.1016/j.jmaa.2023.127570

Home/Archive/arXiv

arXiv · 2301.12536

Random points are good for universal discretization

F. Dai·V. Temlyakov

View original source ↗Read source document ↗Export metadata ↓

Abstract

There has been significant progress in the study of sampling discretization of integral norms for both a designated finite-dimensional function space and a finite collection of such function spaces (universal discretization). Sampling discretization results turn out to be very useful in various applications, particularly in sampling recovery. Recent sampling discretization results typically provide existence of good sampling points for discretization. In this paper, we show that independent and identically distributed random points provide good universal discretization with high probability. Furthermore, we demonstrate that a simple greedy algorithm based on those points that are good for universal discretization provides excellent sparse recovery results in the square norm.

Explore related subjects

math.FA cs.NA math.CA math.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

F. Dai, V. Temlyakov. 2023-10-12. Random points are good for universal discretization. https://doi.org/10.1016/j.jmaa.2023.127570

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Metric Poincaré type inequalities and lower bounds on the infimum of the spectrum for graphs

We study metric Poincaré type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants geometrically as diameters and inradii. Moreover, we can relate them to spectral theory of Laplacians once a probability measure on the graph is chosen. More specifically, we obtain a variational characterization of these constants as infimum over spectral gaps of all Laplacians on the graphs associated to probability measures

math.FA↗

arXiv2026

Natural methods of unsupervised topological alignment

In this paper, we consider methods for the diagonal multi-omics integration of heterogeneous datasets. Several approaches to the nature of biological heterogeneity are analyzed and developed to comprehend more clearly the generated differences. Specifically, the extremal trace problems for the coupled Laplacian on sets homeomorphic to the Stiefel manifold embedded in the complex Euclidean space are investigated. The gradient ascent method for the maximization problem is elaborated in the classical terms of functional analysis, which is of significant interest in itself. On this basis, we introduce a novel characteristic of dataset heterogeneity by employing the norm of the difference between the maximum and minimum points.

math.FA↗

arXiv2026

On Toeplitz operators on compact Abelian groups and discrete Wiener--Hopf operators

This paper introduces the concept of a rotation number for a continuous, non-degenerate two-dimensional vector field (a zero-free complex-valued function) on a compact connected Abelian group. This concept generalizes the notion of a finite rotation number for such groups, previously introduced by the author. Using this concept, a Gohberg-Krein index formula is derived for semi-Fredholm Toeplitz operators with continuous symbols defined on such groups. Criteria for these operators to be semi-Fredholm are established, and their essential spectra are described. As a by-product for the continuous symbol case, conditions for Fredholmness and semi-Fredholmness are established, and the Fredholm index of Wiener-Hopf operators over a linearly ordered discrete Abelian group is calculated in terms of their symbols. Spectral properties-including the spectra and essential spectra-of the Wiener-Hopf operators under consideration are also described.

math.FA↗