List of Russian physicists: Difference between revisions
en>CommonsDelinker m Removing "Sakharov,_Andrei_(1921-1989).jpg", it has been deleted from Commons by Fastily because: Per commons:Commons:Deletion requests/File:Sakharov, Andrei (1921-1989).jpg. |
No edit summary |
||
| Line 1: | Line 1: | ||
{{technical|date=November 2013}} | |||
In [[mathematics]] and [[machine learning]], '''basis pursuit denoising''' (BPDN) is one approach to solving a [[mathematical optimization]] problem of the form: | |||
:<math>\min_x \frac{1}{2}\|y-Ax\|^2_2+\lambda\|x\|_1.</math> | |||
where <math>\lambda</math> is a parameter that controls the trade-off between [[Sparse_vector|sparsity]] and reconstruction fidelity, <math>x</math> is an <math>N \times 1</math> solution vector, <math>y</math> is an <math>M \times 1</math> vector of observations, <math>A</math> is an <math>M \times N</math> transform matrix and <math>M < N</math>. This is an instance of [[convex optimization]] and also of [[quadratic programming]]. | |||
Some authors refer to basis pursuit denoising as the following closely related problem: | |||
:<math>\min_x \|x\|_1 \;\textrm{subject} \ \textrm{to}\;\;\|y-Ax\|^2_2 \le \delta</math> | |||
which, for any given <math>\lambda</math>, is equivalent to the unconstrained formulation for some (usually unknown ''a priori'') value of <math>\delta</math>. The two problems are quite similar, but most specialized [[numerical algorithm]]s can only solve the unconstrained formulation. | |||
Either type of basis pursuit denoising solves a [[Regularization (mathematics)|regularization]] problem with a trade-off between having a small residual (making <math>y</math> close to <math>Ax</math> in terms of an <math>L_2</math> distance) and making <math>x</math> simple in the <math>L_1</math> sense. It can be thought of as a mathematical statement of [[Occam's razor]], finding the simplest possible explanation (<math>\min_x \|x\|_1</math>) capable of accounting for the observations (<math> \min_x \|y-Ax\|^2_2</math>). | |||
Exact solutions to basis pursuit denoising are often the best computationally tractable approximation of an underdetermined system of equations.{{cn|date=January 2014}} Basis pursuit denoising has potential applications in statistics (c.f. the [[Lasso_(statistics)#Lasso_method|LASSO]] method of [[Regularization (mathematics)|regularization]]), [[image compression]] and [[compressed sensing]]. | |||
As <math>\lambda \rightarrow 0</math> (or when <math>\delta = 0</math>), this problem becomes [[basis pursuit]]. | |||
==Solving basis pursuit denoising== | |||
The problem is a convex quadratic problem, so it can be solved by many general solvers, such as [[interior point method]]s. For very large problems, many specialized methods that are faster than interior point methods have been proposed. | |||
Several popular methods for solving basis pursuit denoising include the [[in-crowd algorithm]] (a fast solver for large, sparse problems<ref>See ''The In-Crowd Algorithm for Fast Basis Pursuit Denoising'', IEEE Trans Sig Proc 59 (10), Oct 1 2011, pp. 4595 - 4605, [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5940245], demo [[MATLAB]] code available [http://molnargroup.ece.cornell.edu/files/InCrowdBeta1.zip]</ref>), [[homotopy continuation]], [[fixed-point continuation]] (a special case of the [http://www.ugcs.caltech.edu/~srbecker/wiki/Forward_Backward_Algorithm forward backward algorithm]) and [[spectral projected gradient for L1 minimization]] (which actually solves [[Lasso_(statistics)#Lasso_method|LASSO]], a related problem). | |||
==References== | |||
{{reflist}} | |||
==External links== | |||
*A list of [http://ugcs.caltech.edu/~srbecker/wiki/Category:Solvers BPDN solvers] at the [http://ugcs.caltech.edu/~srbecker/wiki/Main_Page sparse- and low-rank approximation wiki]. | |||
[[Category:Mathematical optimization]] | |||
{{Mathapplied-stub}} | |||
Revision as of 22:11, 14 January 2014
My name is Winnie and I am studying Anthropology and Sociology and Modern Languages and Classics at Rillieux-La-Pape / France.
Also visit my web site ... hostgator1centcoupon.info
In mathematics and machine learning, basis pursuit denoising (BPDN) is one approach to solving a mathematical optimization problem of the form:
where is a parameter that controls the trade-off between sparsity and reconstruction fidelity, is an solution vector, is an vector of observations, is an transform matrix and . This is an instance of convex optimization and also of quadratic programming.
Some authors refer to basis pursuit denoising as the following closely related problem:
which, for any given , is equivalent to the unconstrained formulation for some (usually unknown a priori) value of . The two problems are quite similar, but most specialized numerical algorithms can only solve the unconstrained formulation.
Either type of basis pursuit denoising solves a regularization problem with a trade-off between having a small residual (making close to in terms of an distance) and making simple in the sense. It can be thought of as a mathematical statement of Occam's razor, finding the simplest possible explanation () capable of accounting for the observations ().
Exact solutions to basis pursuit denoising are often the best computationally tractable approximation of an underdetermined system of equations.Template:Cn Basis pursuit denoising has potential applications in statistics (c.f. the LASSO method of regularization), image compression and compressed sensing.
As (or when ), this problem becomes basis pursuit.
Solving basis pursuit denoising
The problem is a convex quadratic problem, so it can be solved by many general solvers, such as interior point methods. For very large problems, many specialized methods that are faster than interior point methods have been proposed.
Several popular methods for solving basis pursuit denoising include the in-crowd algorithm (a fast solver for large, sparse problems[1]), homotopy continuation, fixed-point continuation (a special case of the forward backward algorithm) and spectral projected gradient for L1 minimization (which actually solves LASSO, a related problem).
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
External links
- A list of BPDN solvers at the sparse- and low-rank approximation wiki.