Learning to Recover Sparse Signals
In compressed sensing, a primary problem to solve is to reconstruct a high dimensional sparse signal from a small number of observations. In this work, we develop a new sparse signal recovery algorithm using reinforcement learning (RL) and Monte CarloTree Search (MCTS). Similarly to orthogonal matching pursuit (OMP), our RL+MCTS algorithm chooses the support of the signal sequentially. The key novelty is that the proposed algorithm learns how to choose the next support as opposed to following a pre-designed rule as in OMP. Empirical results are provided to demonstrate the superior performance of the proposed RL+MCTS algorithm over existing sparse signal recovery algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
compressed sensingreinforcement-learningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
SPP-SBL: Space-Power Prior Sparse Bayesian Learning for Block Sparse Recovery
The recovery of block-sparse signals with unknown structural patterns remains a fundamental challenge in structured sparse signal reconstruction. By proposing a variance transformation framework, this paper unifies exist…
parameter estimationRecovery of Sparse Signals Using Multiple Orthogonal Least Squares
We study the problem of recovering sparse signals from compressed linear measurements. This problem, often referred to as sparse recovery or sparse reconstruction, has generated a great deal of interest in recent years. …
Computational EfficiencySimultaneous Block-Sparse Signal Recovery Using Pattern-Coupled Sparse Bayesian Learning
In this paper, we consider the block-sparse signals recovery problem in the context of multiple measurement vectors (MMV) with common row sparsity patterns. We develop a new method for recovery of common row sparsity MMV…
Matching Pursuit LASSO Part II: Applications and Sparse Recovery over Batch Signals
Matching Pursuit LASSIn Part I \cite{TanPMLPart1}, a Matching Pursuit LASSO ({MPL}) algorithm has been presented for solving large-scale sparse recovery (SR) problems. In this paper, we present a subspace search to furth…
Compressive SensingFace RecognitionSparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices
This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis rel…
compressed sensing