what is implemented in the scikit matches the algorithms implemented in SPAMS.
SPAMS implements more like positivity constraints for example.
A real comparison in terms of speed and results has however not been done.
Note that for the positivity constraint we just need to modify
LassoLARS and Lass
Short answer, no.
sparse_encode is just a wrapper for funcionality that existed in the
scikit already (lasso, omp), with support for parallelization. We
couldn't embed SPAMS anyway, because of the license IIRC.
A benchmark would be interesting indeed.
Vlad
On 09.01.2012, at 18:02, Ian Goodfell
Is decomposition.sparse_encode implemented using SPAMS (
http://www.di.ens.fr/~mairal/software_eng.php ) ? If not, does anyone
know how the two implementations compare?
Thanks,
Ian
--
Ridiculously easy VDI. With Citrix VDI
