1,982 research outputs found
Info-Greedy sequential adaptive compressed sensing
We present an information-theoretic framework for sequential adaptive
compressed sensing, Info-Greedy Sensing, where measurements are chosen to
maximize the extracted information conditioned on the previous measurements. We
show that the widely used bisection approach is Info-Greedy for a family of
-sparse signals by connecting compressed sensing and blackbox complexity of
sequential query algorithms, and present Info-Greedy algorithms for Gaussian
and Gaussian Mixture Model (GMM) signals, as well as ways to design sparse
Info-Greedy measurements. Numerical examples demonstrate the good performance
of the proposed algorithms using simulated and real data: Info-Greedy Sensing
shows significant improvement over random projection for signals with sparse
and low-rank covariance matrices, and adaptivity brings robustness when there
is a mismatch between the assumed and the true distributions.Comment: Preliminary results presented at Allerton Conference 2014. To appear
in IEEE Journal Selected Topics on Signal Processin
Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
Adaptive sampling results in dramatic improvements in the recovery of sparse
signals in white Gaussian noise. A sequential adaptive sampling-and-refinement
procedure called Distilled Sensing (DS) is proposed and analyzed. DS is a form
of multi-stage experimental design and testing. Because of the adaptive nature
of the data collection, DS can detect and localize far weaker signals than
possible from non-adaptive measurements. In particular, reliable detection and
localization (support estimation) using non-adaptive samples is possible only
if the signal amplitudes grow logarithmically with the problem dimension. Here
it is shown that using adaptive sampling, reliable detection is possible
provided the amplitude exceeds a constant, and localization is possible when
the amplitude exceeds any arbitrarily slowly growing function of the dimension.Comment: 23 pages, 2 figures. Revision includes minor clarifications, along
with more illustrative experimental results (cf. Figure 2
Sequentiality and Adaptivity Gains in Active Hypothesis Testing
Consider a decision maker who is responsible to collect observations so as to
enhance his information in a speedy manner about an underlying phenomena of
interest. The policies under which the decision maker selects sensing actions
can be categorized based on the following two factors: i) sequential vs.
non-sequential; ii) adaptive vs. non-adaptive. Non-sequential policies collect
a fixed number of observation samples and make the final decision afterwards;
while under sequential policies, the sample size is not known initially and is
determined by the observation outcomes. Under adaptive policies, the decision
maker relies on the previous collected samples to select the next sensing
action; while under non-adaptive policies, the actions are selected independent
of the past observation outcomes.
In this paper, performance bounds are provided for the policies in each
category. Using these bounds, sequentiality gain and adaptivity gain, i.e., the
gains of sequential and adaptive selection of actions are characterized.Comment: 12 double-column pages, 1 figur
Adaptive multiscale model reduction with Generalized Multiscale Finite Element Methods
In this paper, we discuss a general multiscale model reduction framework
based on multiscale finite element methods. We give a brief overview of related
multiscale methods. Due to page limitations, the overview focuses on a few
related methods and is not intended to be comprehensive. We present a general
adaptive multiscale model reduction framework, the Generalized Multiscale
Finite Element Method. Besides the method's basic outline, we discuss some
important ingredients needed for the method's success. We also discuss several
applications. The proposed method allows performing local model reduction in
the presence of high contrast and no scale separation
- …