Exact spike train inference via _0 optimization
From MaRDI portal
Publication:152825
Abstract: In recent years, new technologies in neuroscience have made it possible to measure the activities of large numbers of neurons simultaneously in behaving animals. For each neuron, a fluorescence trace is measured; this can be seen as a first-order approximation of the neuron's activity over time. Determining the exact time at which a neuron spikes on the basis of its fluorescence trace is an important open problem in the field of computational neuroscience. Recently, a convex optimization problem involving an penalty was proposed for this task. In this paper, we slightly modify that recent proposal by replacing the penalty with an penalty. In stark contrast to the conventional wisdom that optimization problems are computationally intractable, we show that the resulting optimization problem can be efficiently solved for the global optimum using an extremely simple and efficient dynamic programming algorithm. Our R-language implementation of the proposed algorithm runs in a few minutes on fluorescence traces of timesteps. Furthermore, our proposal leads to substantial improvements over the previous proposal, in simulations as well as on two calcium imaging data sets. R-language software for our proposal is available on CRAN in the package LZeroSpikeInference. Instructions for running this software in python can be found at https://github.com/jewellsean/LZeroSpikeInference.
Recommendations
- Sliding window strategy for convolutional spike sorting with Lasso. Algorithm, theoretical guarantees and complexity
- Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-space models
- Fast inference of interactions in assemblies of stochastic integrate-and-fire neurons from spike recordings
- Bayesian Spiking Neurons I: Inference
- The computational structure of spike trains
Cites work
- A Cluster Analysis Method for Grouping Means in the Analysis of Variance
- A novel spike distance
- Algorithms for the optimal identification of segment neighborhoods
- Circular binary segmentation for the analysis of array-based DNA copy number data
- Consistencies and rates of convergence of jump-penalized least squares estimators
- Constrained dynamic programming and supervised penalty learning algorithms for peak detection in genomic data
- Estimating the number of change points in a sequence of independent normal random variables
- Estimating the number of change-points via Schwarz' criterion
- scientific article; zbMATH DE number 4169866 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Local extremes, runs, strings and multiresolution. (With discussion)
- Locally adaptive regression splines
- Metric-space analysis of spike trains: theory, algorithms and application
- Multiple Change-Point Estimation With a Total Variation Penalty
- On optimal multiple changepoint algorithms for large data
- On stepwise pattern recovery of the fused Lasso
- On the prediction performance of the Lasso
- Optimal detection of changepoints with a linear computational cost
- Properties and refinements of the fused Lasso
- Sparsity and Smoothness Via the Fused Lasso
- Statistical methods for DNA sequence segmentation
- Structural Break Estimation for Nonstationary Time Series Models
- Structural breaks in time series
- The Adaptive Lasso and Its Oracle Properties
- Wild binary segmentation for multiple change-point detection
Cited in
(17)- Scalpel: extracting neurons from calcium imaging data
- Consistency of a range of penalised cost approaches for detecting multiple changepoints
- Sliding window strategy for convolutional spike sorting with Lasso. Algorithm, theoretical guarantees and complexity
- HNCcorr: combinatorial optimization for neuron identification
- On estimation of isotonic piecewise constant signals
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Strictly positive-definite spike train kernels for point-process divergences
- scientific article; zbMATH DE number 6378149 (Why is no real title available?)
- LZeroSpikeInference
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Outlier detection in time series via mixed-integer conic quadratic optimization
- Efficient position decoding methods based on fluorescence calcium imaging in the mouse hippocampus
- Detecting Abrupt Changes in the Presence of Local Fluctuations and Autocorrelated Noise
- Subbotin graphical models for extreme value dependencies with applications to functional neuronal connectivity
- A changepoint approach to modelling nonstationary soil moisture dynamics
- An inexact projected regularized Newton method for fused zero-norms regularization problems
This page was built for publication: Exact spike train inference via \(\ell_{0}\) optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q152825)
