Constructive subsampling of finite frames with applications in optimal function recovery

by   Felix Bartel, et al.

In this paper we present new constructive methods, random and deterministic, for the efficient subsampling of finite frames in ℂ^m. Based on a suitable random subsampling strategy, we are able to extract from any given frame with bounds 0 < A ≤ B < ∞ (and condition B/A) a similarly conditioned reweighted subframe consisting of merely 𝒪(m log m) elements. Further, utilizing a deterministic subsampling method based on principles developed in [1, Sec. 3], we are able to reduce the number of elements to 𝒪(m) (with a constant close to one). By controlling the weights via a preconditioning step, we can, in addition, preserve the lower frame bound in the unweighted case. This allows to derive new quasi-optimal unweighted (left) Marcinkiewicz-Zygmund inequalities for L_2(D, ν) with constructible node sets of size 𝒪(m) for m-dimensional subspaces of bounded functions. Those can be applied e.g. for (plain) least-squares sampling reconstruction of functions, where we obtain new quasi-optimal results avoiding the Kadison-Singer theorem. Numerical experiments indicate the applicability of our results.


page 1

page 2

page 3

page 4


Efficient recovery of non-periodic multivariate functions from few scattered samples

It has been observed by several authors that well-known periodization st...

Worst case recovery guarantees for least squares approximation using random samples

We consider a least squares regression algorithm for the recovery of com...

σ-locales and Booleanization in Formal Topology

A σ-frame is a poset with countable joins and finite meets in which bina...

Random sampling in weighted reproducing kernel subspaces of L^p_ν(R^d)

In this paper, we mainly study the random sampling and reconstruction fo...

Some improved bounds in sampling discretization of integral norms

The paper addresses a problem of sampling discretization of integral nor...

On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization

In this paper, we present several new results on minimizing a nonsmooth ...

Please sign up or login with your details

Forgot password? Click here to reset