Sliding window strategy for convolutional spike sorting with Lasso. Algorithm, theoretical guarantees and complexity
From MaRDI portal
Publication:2145675
DOI10.1007/s10440-022-00494-xzbMath1489.90216arXiv2110.15813OpenAlexW4280488859MaRDI QIDQ2145675
Laurent Dragoni, Patricia Reynaud-Bouret, Karim Lounici, Rémi Flamary
Publication date: 17 June 2022
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.15813
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Optimal recognition of neuronal waveforms
- Adaptive estimation of the intensity of inhomogeneous Poisson processes via concentration inequalities
- Honest variable selection in linear and logistic regression models via \(\ell _{1}\) and \(\ell _{1}+\ell _{2}\) penalization
- Subcritical phase of \(d\)-dimensional Poisson-Boolean percolation and its vacant set
- Goodness-of-fit tests and nonparametric adaptive estimation for spike train analysis
- Simultaneous analysis of Lasso and Dantzig selector
- Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators
- A review of methods for spike sorting: the detection and classification of neural action potentials
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
- Surrogate Data Methods Based on a Shuffling of the Trials for Synchrony Detection: The Centering Issue
- Multiple Tests Based on a Gaussian Approximation of the Unitary Events Method with Delayed Coincidence Count
This page was built for publication: Sliding window strategy for convolutional spike sorting with Lasso. Algorithm, theoretical guarantees and complexity