41 research outputs found
Subspace Expanders and Matrix Rank Minimization
Matrix rank minimization (RM) problems recently gained extensive attention
due to numerous applications in machine learning, system identification and
graphical models. In RM problem, one aims to find the matrix with the lowest
rank that satisfies a set of linear constraints. The existing algorithms
include nuclear norm minimization (NNM) and singular value thresholding. Thus
far, most of the attention has been on i.i.d. Gaussian measurement operators.
In this work, we introduce a new class of measurement operators, and a novel
recovery algorithm, which is notably faster than NNM. The proposed operators
are based on what we refer to as subspace expanders, which are inspired by the
well known expander graphs based measurement matrices in compressed sensing. We
show that given an PSD matrix of rank , it can be uniquely
recovered from a minimal sampling of measurements using the proposed
structures, and the recovery algorithm can be cast as matrix inversion after a
few initial processing steps
Capacity region of the deterministic multi-pair bi-directional relay network
In this paper we study the capacity region of the multi-pair bidirectional
(or two-way) wireless relay network, in which a relay node facilitates the
communication between multiple pairs of users. This network is a generalization
of the well known bidirectional relay channel, where we have only one pair of
users. We examine this problem in the context of the deterministic channel
interaction model, which eliminates the channel noise and allows us to focus on
the interaction between signals. We characterize the capacity region of this
network when the relay is operating at either full-duplex mode or half-duplex
mode (with non adaptive listen-transmit scheduling). In both cases we show that
the cut-set upper bound is tight and, quite interestingly, the capacity region
is achieved by a simple equation-forwarding strategy.Comment: Will be presented in the 2009 IEEE Information Theory Workshop on
Networking and Information Theor
Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing
We introduce a new class of measurement matrices for compressed sensing,
using low order summaries over binary sequences of a given length. We prove
recovery guarantees for three reconstruction algorithms using the proposed
measurements, including minimization and two combinatorial methods. In
particular, one of the algorithms recovers -sparse vectors of length in
sublinear time , and requires at most
measurements. The empirical oversampling constant
of the algorithm is significantly better than existing sublinear recovery
algorithms such as Chaining Pursuit and Sudocodes. In particular, for and , the oversampling factor is between 3 to 8. We provide
preliminary insight into how the proposed constructions, and the fast recovery
scheme can be used in a number of practical applications such as market basket
analysis, and real time compressed sensing implementation
On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We focus on measurement matrices that are sparse, i.e., have only a constant number of nonzero (and non-negative) entries in each column. For such measurement matrices we give a simple necessary and sufficient condition for l1 optimization to successfully recover the unknown vector. Using a simple ldquoperturbationrdquo to the adjacency matrix of an unbalanced expander, we obtain simple closed form expressions for the threshold relating the ambient dimension n, number of measurements m and sparsity level k, for which l1 optimization is successful with overwhelming probability. Simulation results suggest that the theoretical thresholds are fairly tight and demonstrate that the ldquoperturbationsrdquo significantly improve the performance over a direct use of the adjacency matrix of an expander graph
Weighted β_1 minimization for sparse recovery with prior information
In this paper we study the compressed sensing problem of recovering a sparse signal from a system of underdetermined linear equations when we have prior information about the probability of each entry of the unknown signal being nonzero. In particular, we focus on a model where the entries of the unknown vector fall into two sets, each with a different probability of being nonzero. We propose a weighted β_1 minimization recovery algorithm and analyze its performance using a Grassman angle approach. We compute explicitly the relationship between the system parameters (the weights, the number of measurements, the size of the two sets, the probabilities of being non-zero) so that an iid random Gaussian measurement matrix along with weighted β_1 minimization recovers almost all such sparse signals with overwhelming probability as the problem dimension increases. This allows us to compute the optimal weights. We also provide simulations to demonstrate the advantages of the method over conventional β_1 optimization
Sparse Recovery of Positive Signals with Minimal Expansion
We investigate the sparse recovery problem of reconstructing a
high-dimensional non-negative sparse vector from lower dimensional linear
measurements. While much work has focused on dense measurement matrices, sparse
measurement schemes are crucial in applications, such as DNA microarrays and
sensor networks, where dense measurements are not practically feasible. One
possible construction uses the adjacency matrices of expander graphs, which
often leads to recovery algorithms much more efficient than
minimization. However, to date, constructions based on expanders have required
very high expansion coefficients which can potentially make the construction of
such graphs difficult and the size of the recoverable sets small.
In this paper, we construct sparse measurement matrices for the recovery of
non-negative vectors, using perturbations of the adjacency matrix of an
expander graph with much smaller expansion coefficient. We present a necessary
and sufficient condition for optimization to successfully recover the
unknown vector and obtain expressions for the recovery threshold. For certain
classes of measurement matrices, this necessary and sufficient condition is
further equivalent to the existence of a "unique" vector in the constraint set,
which opens the door to alternative algorithms to minimization. We
further show that the minimal expansion we use is necessary for any graph for
which sparse recovery is possible and that therefore our construction is tight.
We finally present a novel recovery algorithm that exploits expansion and is
much faster than optimization. Finally, we demonstrate through
theoretical bounds, as well as simulation, that our method is robust to noise
and approximate sparsity.Comment: 25 pages, submitted for publicatio