Random Sampling in Reproducing Kernel Subspace of Mixed Lebesgue Spaces
Prashant Goyal, Dhiraj Patel, Sivananthan Sampath

TL;DR
This paper studies random sampling in the reproducing kernel subspace of mixed Lebesgue spaces, establishing stability of random samples and proposing an iterative reconstruction method for concentrated signals.
Contribution
It introduces a probabilistic framework for stable random sampling and reconstruction in mixed Lebesgue spaces under kernel decay and regularity conditions.
Findings
Random samples form a stable sampling set with high probability.
The set of concentrated functions is totally bounded.
An iterative scheme effectively reconstructs signals from random measurements.
Abstract
In this article, we consider the random sampling in the image space of mixed Lebesgue space under an idempotent integral operator. We assume some decay and regularity conditions of the kernel and approximate the unit sphere in on a bounded cube by a finite-dimensional subspace of . Consequently, the set of concentrated functions is totally bounded. We prove with an overwhelming probability that the random sample set uniformly distributed over is a stable set of sampling for the set of concentrated functions on . Moreover, we propose an iterative scheme to reconstruct the concentrated signal from its random measurements.
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 Analysis and Transform Methods · Numerical methods in inverse problems · Sparse and Compressive Sensing Techniques
