Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

591418 · May 202619922001200920172026
48 results for spike sorting

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.

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.

We propose an O(NM)O(N\cdot 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.

2018-05-11abs ↗pdf ↗

Probabilistic clustering models (or equivalently, mixture models) are basic building blocks in countless statistical models and involve latent random variables over discrete spaces. For these models, posterior inference methods can be inaccurate and/or very slow. In this work we introduce deep network architectures tra…

2018-12-28abs ↗pdf ↗

Sorting an array is a fundamental routine in machine learning, one that is used to compute rank-based statistics, cumulative distribution functions (CDFs), quantiles, or to select closest neighbors and labels. The sorting function is however piece-wise constant (the sorting permutation of a vector does not change if th…

2019-05-28abs ↗pdf ↗

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…

2017-06-14abs ↗pdf ↗

Short-and-sparse deconvolution (SaSD) is the problem of extracting localized, recurring motifs in signals with spatial or temporal structure. Variants of this problem arise in applications such as image deblurring, microscopy, neural spike sorting, and more. The problem is challenging in both theory and practice, as na…

2019-08-28abs ↗pdf ↗

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…

2009-12-30abs ↗pdf ↗

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.

We propose a novel concept of a Systemic Optimal Risk Transfer Equilibrium (SORTE), which is inspired by the Bühlmann's classical notion of an Equilibrium Risk Exchange. We provide sufficient general assumptions that guarantee existence, uniqueness, and Pareto optimality of such a SORTE. In both the Bühlmann and the SO…

2019-07-09abs ↗pdf ↗

Paper introduces differentiable sorting and ranking with O(nlogn)O(n \log n) 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)O(n \log n) time and O(n)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.

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.

Sorting input objects is an important step in many machine learning pipelines. However, the sorting operator is non-differentiable with respect to its inputs, which prohibits end-to-end gradient-based optimization. In this work, we propose NeuralSort, a general-purpose continuous relaxation of the output of the sorting…

2019-03-21abs ↗pdf ↗

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.

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.

A central problem of random matrix theory is to understand the eigenvalues of spiked random matrix models, introduced by Johnstone, in which a prominent eigenvector (or "spike") is planted into a random matrix. These distributions form natural statistical models for principal component analysis (PCA) problems throughou…

2018-07-02abs ↗pdf ↗

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.…

2017-05-31abs ↗pdf ↗

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.

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.

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…

2016-05-10abs ↗pdf ↗

Spiking neural networks perform similarly to deep networks on occluded images.

problem Robust object recognition in partially occluded images.
method Developed a two-layer spiking neural network trained on natural scenes with a biologically plausible learning rule, compared to deep convolutional networks.
result Spiking neural networks achieve good accuracy and robustness on stepwise pixel erasement tasks.

Spike-and-slab priors are improved for high-dimensional Bayesian regression.

problem Prohibitive computational costs for existing samplers in high-dimensional settings.
method Proposes Scalable Spike-and-Slab (S3S^3) for high-dimensional Bayesian regression.
result Improves computational cost to max{n2pt,np}\max\{ n^2 p_t, np \} per iteration, demonstrating significant speed-ups and quality gains.