Constrained Adaptive Sensing

From MaRDI portal




Abstract: Suppose that we wish to estimate a vector mathbfxinmathbbCn from a small number of noisy linear measurements of the form mathbfy=mathbfAx+mathbfz, where mathbfz represents measurement noise. When the vector mathbfx is sparse, meaning that it has only s nonzeros with slln, one can obtain a significantly more accurate estimate of mathbfx by adaptively selecting the rows of mathbfA based on the previous measurements provided that the signal-to-noise ratio (SNR) is sufficiently large. In this paper we consider the case where we wish to realize the potential of adaptivity but where the rows of mathbfA are subject to physical constraints. In particular, we examine the case where the rows of mathbfA are constrained to belong to a finite set of allowable measurement vectors. We demonstrate both the limitations and advantages of adaptive sensing in this constrained setting. We prove that for certain measurement ensembles, the benefits offered by adaptive designs fall far short of the improvements that are possible in the unconstrained adaptive setting. On the other hand, we also provide both theoretical and empirical evidence that in some scenarios adaptivity does still result in substantial improvements even in the constrained setting. To illustrate these potential gains, we propose practical algorithms for constrained adaptive sensing by exploiting connections to the theory of optimal experimental design and show that these algorithms exhibit promising performance in some representative applications.












This page was built for publication: Constrained Adaptive Sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620997)