This paper compares spike sorting techniques for rat brain neuronal activity.
problem Improving the accuracy of spike sorting for neuronal activity analysis.
method Three-step spike sorting process: detection, feature extraction, and clustering. Various methods are compared.
result Kernel PCA outperforms in feature extraction, leading to better spike sorting results.
New algorithm speeds up spike sorting for large datasets.
problem Numerical complexity limits processing large scale neuroscience datasets.
method Windowed active set Lasso algorithm for convolutional spike sorting.
result Linear complexity ensures scalability and opens online sorting.
C-FAR automates clustering assessment for neural tracking.
problem Manual assessment of clusters by humans is slow and impractical for large datasets.
method C-FAR uses automated feedback queries to select optimal clustering from multiple algorithms.
result C-FAR produces near-perfect clustering on simulated neural data.
I propose a frequency domain adaptation of the Expectation Maximization (EM) algorithm to group a family of time series in classes of similar dynamic structure. It does this by viewing the magnitude of the discrete Fourier transform (DFT) of each signal (or power spectrum) as a probability density/mass function (pdf/pm…
Deep networks approximate posterior cluster labels efficiently.
problem Inaccurate and slow posterior inference in clustering models.
method Two deep network architectures trained with labeled data.
result Generative models learn posterior cluster labels for new datasets.
CRsAE auto-encoder recovers convolutional dictionary from noisy signals.
problem Recovering a convolutional dictionary from noisy signals.
method Constrained recurrent sparse auto-encoder (CRsAE) architecture.
result CRsAE successfully recovers the underlying dictionary in the presence of noise.
We introduce the functional mean-shift algorithm, an iterative algorithm for estimating the local modes of a surrogate density from functional data. We show that the algorithm can be used for cluster analysis of functional data. We propose a test based on the bootstrap for the significance of the estimated local modes …
Monotonic differentiable sorting networks improve upon previous methods.
problem Non-monotonicity in differentiable sorting networks.
method Relaxation of conditional swap operations using sigmoid functions to ensure monotonicity.
result Monotonic differentiable sorting networks improve upon previous methods.
We propose an O(N⋅M) sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we discuss the application of this algorithm to sparse hash table.
Neural sorting network improves sorting accuracy for complex inputs.
problem Sorting complex inputs like multi-digit images.
method Differentiable swap function and permutation-equivariant Transformer network.
result Our method outperforms baseline methods on various sorting benchmarks.
Single-spike neurons can approximate as well as multi-spike neurons.
problem Limitation of single-spike neurons in spiking neural networks.
method Comparison of single-spike and multi-spike neural networks.
result Single-spike and multi-spike neural networks are equivalent in approximation capabilities.
Differentiable sorting framework using optimal transport.
problem Piecewise constant sorting function without gradient information.
method Linking sorting to optimal transport, adding entropic regularization, and approximating with Sinkhorn iterations.
result Differentiable sorting operators (S-sorts, S-CDFs, S-quantiles) for machine learning applications.
NeuralSort optimizes sorting networks using continuous relaxations.
problem Non-differentiability of sorting operator hinders gradient-based optimization.
method Continuous relaxation of sorting operator to unimodal row-stochastic matrices, enabling gradient-based optimization.
result Gradient-based stochastic optimization over permutations is achieved.
Much of studies on neural computation are based on network models of static neurons that produce analog output, despite the fact that information processing in the brain is predominantly carried out by dynamic neurons that produce discrete pulses called spikes. Research in spike-based computation has been impeded by th…
SORTE optimizes systemic performance over individual rationality.
problem Systemic risk and optimal risk transfer.
method Endogenous determination of budget constraints through systemic utility maximization.
result Existence, uniqueness, and Pareto optimality of SORTE.
Neurons perform computations, and convey the results of those computations through the statistical structure of their output spike trains. Here we present a practical method, grounded in the information-theoretic analysis of prediction, for inferring a minimal representation of that structure and for characterizing its…
Bayesian method detects neuron spike activities from noisy fluorescence data.
problem Detecting neuron spike activities from noisy fluorescence data.
method Random finite set (RFS) based Bayesian approach.
result Gains 12% extra detection accuracy compared to MLSpike method.
The paper examines how spike strengths and alignments affect overfitting in linear regression models.
problem The impact of spike strengths and alignments on overfitting in linear regression models.
method Characterization of generalization error through exact expressions and analysis of spike strengths, aspect ratio, and target alignment.
result Increasing spike strength can lead to catastrophic overfitting before benign overfitting, especially in well-specified aligned problems.
SNNs enhance high-frequency price spike forecasting in HFT environments.
problem Conventional financial models fail to capture fine temporal structure in high-frequency price spikes.
method Application of Spiking Neural Networks (SNNs) with hyperparameter tuning via Bayesian Optimization (BO).
result SNN models optimized with PSA achieve significantly higher cumulative returns in backtesting.
SNNs can represent complex functions efficiently.
problem Understanding the representational power of SNNs.
method Viewed as sequence-to-sequence processors, analyzed using spike train functions.
result SNNs have the universal representation property for certain functions.
Third-generation neural networks, or Spiking Neural Networks (SNNs), aim at harnessing the energy efficiency of spike-domain processing by building on computing elements that operate on, and exchange, spikes. In this paper, the problem of training a two-layer SNN is studied for the purpose of classification, under a Ge…
We address the problem of learning a ranking by using adaptively chosen pairwise comparisons. Our goal is to recover the ranking accurately but to sample the comparisons sparingly. If all comparison outcomes are consistent with the ranking, the optimal solution is to use an efficient sorting algorithm, such as Quicksor…
Machine learning speeds up search procedures for sorted tables.
problem Improving the speed of sorted table search procedures.
method Systematic experimental comparison of efficient implementations with learned counterparts.
result Learned data structures can significantly speed up search procedures.
Paper introduces differentiable sorting and ranking with O(nlogn) time complexity.
problem Non-differentiability of sorting and ranking operations in machine learning.
method Differentiable proxies constructed as projections onto the permutahedron and reduction to isotonic optimization.
result First differentiable sorting and ranking operators with O(nlogn) time and O(n) space complexity. DSPO optimizes portfolio construction from raw stock data efficiently.
problem Manual design and misalignment in traditional portfolio construction methods.
method End-to-end neural network framework with Monotonical Logistic Regression loss.
result DSPO constructs optimal sorted portfolios with high performance metrics.
Affine spiking neural networks learn efficiently and generalize well.
problem Learning with spiking neural networks, especially with positive weights.
method Affine encoders and decoders, continuous parameter dependence, gradient-based training.
result Affine spiking neural networks can approximate shallow ReLU networks and generalize well.
PCA can detect a low-rank signal in spiked random matrix models, but not always optimally.
problem Understanding when PCA can detect a low-rank signal in the presence of noise.
method Le Cam's notion of contiguity, analysis of spiked Wishart ensemble, and non-spectral tests.
result PCA is sub-optimal for detection in non-Gaussian Wigner ensembles and certain negative spikes in Gaussian Wishart ensemble.
New method improves neural spike train models by minimizing divergence directly, leading to better performance.
problem Poor performance and divergence issues in spike train models using maximum likelihood estimation.
method Directly minimize maximum mean discrepancy using spike train kernels and stochastic optimization.
result The proposed method generates well-behaved models with better control over feature trade-offs.
New method detects spike-and-wave epileptiform discharges using Kendall's Tau-b.
problem Detecting spike-and-wave epileptiform discharges in EEG signals.
method Proposes a new method based on Kendall's Tau-b coefficient.
result High Specificity and rule in (SpPIn) for spike-and-wave discharge detection.
SNNs as first-to-spike policies improve energy efficiency in RL control.
problem Reducing energy consumption in RL control systems.
method Policy gradient approach with GLM for spiking neurons.
result Online trained SNNs outperform ANN conversion in energy efficiency and control performance.
Develops generic spike-and-slab priors for high-dimensional linear regression.
problem Bayesian high-dimensional linear regression challenges.
method Proposes a class of generic spike-and-slab priors and a unified framework for theoretical assessment.
result Achieves nearly-optimal posterior contraction rate and model selection consistency under general conditions.
Synthesizes images from audio and visual data using spike-based autoencoders.
problem Extracting meaningful information from spatio-temporal data for image synthesis.
method Spike-based autoencoders trained to learn spatio-temporal representations of audio and visual data.
result Synthesized images from audio samples with high fidelity, achieving competitive performance.
T2FSNN improves deep SNNs by reducing spikes and latency.
problem Inefficiency in spiking neural networks due to lack of scalable training algorithms.
method Introduces time-to-first-spike coding with kernel-based dynamic threshold and dendrite, combined with gradient-based optimization and early firing methods.
result Reduces inference latency and spike count by 22% and less than 1% compared to burst coding.
Improved SNNs with quantized activations outperform traditional networks.
problem Maintaining SotA accuracy in SNNs with limited bit precision.
method Interpolating between non-spiking and spiking regimes using signal processing tools.
result First hybrid SNN outperforms traditional RNNs in accuracy with reduced bit precision.
A learning rule for first-spike times in neural networks reduces energy consumption and reaction times.
problem Energy efficiency and reaction time in neuromorphic systems.
method Derivation of a learning rule for first-spike times in leaky integrate-and-fire neurons, using only input and output spike times.
result Demonstrated that the approach can implement error backpropagation in hierarchical spiking networks and is capable of harnessing neuromorphic system's speed and energy characteristics.
New method uses surrogate gradients to train efficient spiking networks on neuromorphic hardware.
problem Training high-performing spiking networks on analog neuromorphic hardware is challenging due to device mismatch and lack of efficient algorithms.
method Introduces a general in-the-loop learning framework based on surrogate gradients.
result Learning self-corrects for device mismatch, resulting in competitive spiking network performance.
This research bridges binary and spiking neural networks for efficient on-chip AI.
problem Reducing compute requirements in machine learning frameworks.
method Training Spiking Neural Networks in extreme quantization regime and utilizing standard training techniques for conversion.
result Training Spiking Neural Networks in extreme quantization regime achieves near full precision accuracies.
A vast majority of computation in the brain is performed by spiking neural networks. Despite the ubiquity of such spiking, we currently lack an understanding of how biological spiking neural circuits learn and compute in-vivo, as well as how we can instantiate such capabilities in artificial spiking circuits in-silico.…
Study recovers spike order in noisy tensor estimation without SNR assumptions.
problem Estimating multiple signal vectors from noisy tensor observations.
method Gradient flow optimization of a nonconvex function.
result Determines sample complexity for efficient permutation recovery.
The paper sorts big data by revealed preferences, improving consumer and policy decisions.
problem Sorting diverse consumer preferences for big data objects like colleges.
method Endogenous weighting of revealed preferences, considering spillover effects.
result Consistent steady-state solution to counterbalance equilibrium.
Spiking-YOLO improves object detection with low power and fast convergence.
problem Challenging object detection tasks with spiking neural networks.
method Channel-wise normalization and signed neuron with imbalanced threshold.
result Spiking-YOLO achieves comparable results to Tiny YOLO but with significantly less energy consumption.
Diffsurv extends differentiable sorting to handle censored time-to-event data.
problem Handling censored time-to-event data in survival analysis.
method Extending differentiable sorting methods to account for censored samples.
result Diffsurv outperforms established baselines in various risk prediction scenarios.
This paper analyzes generalization for linear models with spiked covariance structures.
problem Understanding the generalization performance of linear models with spiked covariance structures.
method Derives the generalization error for two simple models with spiked covariances using random matrix theory.
result The eigenvector and eigenvalue corresponding to the spike significantly influence the generalization error.
Framework for sorting with diverse value models and valued assignment examples.
problem Sorting with diverse value models and valued assignment examples.
method Optimization model for constructing preference model from valued examples, regularization techniques, and efficient algorithm.
result Improved predictive ability and flexibility in classification performance.
This paper suggests a learning-theoretic perspective on how synaptic plasticity benefits global brain functioning. We introduce a model, the selectron, that (i) arises as the fast time constant limit of leaky integrate-and-fire neurons equipped with spiking timing dependent plasticity (STDP) and (ii) is amenable to the…
Algorithm detects and estimates correlated signals in spiked matrices.
problem Detect and estimate correlated signals in spiked matrices.
method Proposes an efficient algorithm based on counting edge-decorated cycles.
result Algorithm succeeds under certain signal-to-noise ratio conditions.
Accurate statistical models of neural spike responses can characterize the information carried by neural populations. But the limited samples of spike counts during recording usually result in model overfitting. Besides, current models assume spike counts to be Poisson-distributed, which ignores the fact that many neur…
New method solves sparse deconvolution problems with theoretical guarantees and practical applications.
problem Extracting localized, recurring motifs in signals with spatial or temporal structure.
method Geometric approach using sphere constraints and data-driven initialization to derive a provable algorithm.
result Practical algorithm solves real-world deconvolution problems with good performance and generalizability.