A windowed active set algorithm solves large-scale Lasso for convolutional spike sorting with linear complexity in temporal dimension and parallel efficiency.
Coordinate descent algorithms for lasso penalized regression,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Large scale Lasso with windowed active set for convolutional spike sorting
A windowed active set algorithm solves large-scale Lasso for convolutional spike sorting with linear complexity in temporal dimension and parallel efficiency.