Convergence Speed of a Dynamical System for Sparse Recovery (bibtex)
by , and
Abstract:
This paper studies the convergence rate of continuous-time dynamical system for l1-minimization, known as the Locally Competitive Algorithm (LCA). Solving l1-minimization problems efficiently and rapidly is of great interest to the signal processing community, as these programs have been shown to recover sparse solutions to underdetermined systems of linear equations and come with strong performance guarantees. The LCA under study differs from the typical l1 solver in that it operates in continuous time: instead of being specified by discrete iterations, it evolves according to a system of nonlinear ordinary differential equations. The LCA is constructed from simple components, giving it the potential to be implemented as a large-scale analog circuit. The goal of this paper is to give guarantees on the convergence time of the LCA system. To do so, we analyze how the LCA evolves as it is recovering a sparse signal from underdetermined measurements. We show that under appropriate conditions on the measurement matrix and the problem parameters, the path the LCA follows can be described as a sequence of linear differential equations, each with a small number of active variables. This allows us to relate the convergence time of the system to the restricted isometry constant of the matrix. Interesting parallels to sparse-recovery digital solvers emerge from this study. Our analysis covers both the noisy and noiseless settings and is supported by simulation results.
Reference:
Convergence Speed of a Dynamical System for Sparse RecoveryA. Balavoine, C.J. Rozell and J. Romberg. IEEE Transactions on Signal Processing, 61(17), pp. 4259–4269, September 2013.
Bibtex Entry:
@Article{balavoine.12,
  author = 	 {Balavoine, A. and Rozell, C.J. and Romberg, J.},
  title = 	 {Convergence Speed of a Dynamical System for Sparse Recovery},
year = 2013,
  abstract =     {This paper studies the convergence rate of continuous-time dynamical system for l1-minimization, known as the Locally Competitive Algorithm (LCA). Solving l1-minimization problems efficiently and rapidly is of great interest to the signal processing community, as these programs have been shown to recover sparse solutions to underdetermined systems of linear equations and come with strong performance guarantees. The LCA under study differs from the typical l1 solver in that it operates in continuous time: instead of being specified by discrete iterations, it evolves according to a system of nonlinear ordinary differential equations. The LCA is constructed from simple components, giving it the potential to
be implemented as a large-scale analog circuit.
The goal of this paper is to give guarantees on the convergence time of the LCA system. To do so, we analyze how the LCA evolves as it is recovering a sparse signal from underdetermined measurements. We show that under appropriate conditions on the measurement matrix and the problem parameters, the path the LCA follows can be described as a sequence of linear differential equations, each with a small number of active variables. This allows us to relate the convergence time of the system to the restricted isometry constant of the matrix. Interesting parallels to sparse-recovery digital solvers emerge from this study. Our analysis covers both the noisy and noiseless settings and is supported by simulation results.},
journal = {IEEE Transactions on Signal Processing},
url = {http://arxiv.org/pdf/1301.1272v2.pdf},
volume = 61,
number = 17,
pages = {4259--4269},
month = sep
}
Powered by bibtexbrowser