Marcinkiewicz--Zygmund measures on manifolds

Let ${\mathbb X}$ be a compact, connected, Riemannian manifold (without boundary), $\rho$ be the geodesic distance on ${\mathbb X}$, $\mu$ be a probability measure on ${\mathbb X}$, and $\{\phi_k\}$ be an orthonormal system of continuous functions, $\phi_0(x)=1$ for all $x\in{\mathbb X}$, $\{\ell_k\}_{k=0}^\infty$ be an nondecreasing sequence of real numbers with $\ell_0=1$, $\ell_k\uparrow\infty$ as $k\to\infty$, $\Pi_L:={\mathsf {span}}\{\phi_j : \ell_j\le L\}$, $L\ge 0$. We describe conditions to ensure an equivalence between the $L^p$ norms of elements of $\Pi_L$ with their suitably discretized versions. We also give intrinsic criteria to determine if any system of weights and nodes allows such inequalities. The results are stated in a very general form, applicable for example, when the discretization of the integrals is based on weighted averages of the elements of $\Pi_L$ on geodesic balls rather than point evaluations.Comment: 28 pages, submitted for publicatio

Bernstein-Markov type inequalities and discretization of norms

In this expository paper we will give a survey of some recent results concerning discretization of uniform and integral norms of polynomials and exponential sums which are based on various new Bernstein-Markov type inequalities. © 2021, Padova University Press. All rights reserved

Bypassing the quadrature exactness assumption of hyperinterpolation on the sphere

This paper focuses on the approximation of continuous functions on the unit sphere by spherical polynomials of degree $n$ via hyperinterpolation. Hyperinterpolation of degree $n$ is a discrete approximation of the $L^2$-orthogonal projection of degree $n$ with its Fourier coefficients evaluated by a positive-weight quadrature rule that exactly integrates all spherical polynomials of degree at most $2n$. This paper aims to bypass this quadrature exactness assumption by replacing it with the Marcinkiewicz--Zygmund property proposed in a previous paper. Consequently, hyperinterpolation can be constructed by a positive-weight quadrature rule (not necessarily with quadrature exactness). This scheme is referred to as unfettered hyperinterpolation. This paper provides a reasonable error estimate for unfettered hyperinterpolation. The error estimate generally consists of two terms: a term representing the error estimate of the original hyperinterpolation of full quadrature exactness and another introduced as compensation for the loss of exactness degrees. A guide to controlling the newly introduced term in practice is provided. In particular, if the quadrature points form a quasi-Monte Carlo (QMC) design, then there is a refined error estimate. Numerical experiments verify the error estimates and the practical guide.Comment: 22 pages, 7 figure

Does generalization performance of lql^q regularization learning depend on qq? A negative example

$l^q$-regularization has been demonstrated to be an attractive technique in machine learning and statistical modeling. It attempts to improve the generalization (prediction) capability of a machine (model) through appropriately shrinking its coefficients. The shape of a $l^q$ estimator differs in varying choices of the regularization order $q$. In particular, $l^1$ leads to the LASSO estimate, while $l^{2}$ corresponds to the smooth ridge regression. This makes the order $q$ a potential tuning parameter in applications. To facilitate the use of $l^{q}$-regularization, we intend to seek for a modeling strategy where an elaborative selection on $q$ is avoidable. In this spirit, we place our investigation within a general framework of $l^{q}$-regularized kernel learning under a sample dependent hypothesis space (SDHS). For a designated class of kernel functions, we show that all $l^{q}$ estimators for $0< q < \infty$ attain similar generalization error bounds. These estimated bounds are almost optimal in the sense that up to a logarithmic factor, the upper and lower bounds are asymptotically identical. This finding tentatively reveals that, in some modeling contexts, the choice of $q$ might not have a strong impact in terms of the generalization capability. From this perspective, $q$ can be arbitrarily specified, or specified merely by other no generalization criteria like smoothness, computational complexity, sparsity, etc..Comment: 35 pages, 3 figure