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,932 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Jan 199419922001200920172026
48 results for Spike count data

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 ↗

We develop a fast inference method for non-conjugate Gaussian process models on spike count data.

problem Non-Gaussian spike count data complicates Gaussian Process Factor Analysis.
method We introduce Polynomial Approximate Log-Likelihood (PAL) estimators for non-conjugate GPFA models.
result PAL estimators achieve fast and accurate extraction of latent structure from spike train data.

Flow Matching for count data improves sample quality and efficiency.

problem Mapping between count distributions across batches or time points in high-dimensional count data.
method count-FM, a flow-matching framework based on a continuous-time birth-death process with local unit jumps.
result count-FM achieves better sample quality than representative baselines while using fewer parameters.

NegBio-VAE models neural spike counts with negative binomial distribution.

problem Limited biological plausibility of continuous latent variables in VAEs for neural spike modeling.
method Proposes a negative binomial latent-variable model with a dispersion parameter for overdispersed spike count modeling.
result NegBio-VAE outperforms competing models in reconstruction and generation tasks.

New methods improve neural connectivity analysis at submillisecond timescales.

problem Limitations of standard spike train analysis methods in terms of temporal resolution and scalability.
method Developed Monte Carlo and polynomial approximation methods for continuous-time neural spike train analysis.
result Superior accuracy and scalability compared to traditional binned GLMs, enabling precise connectivity inference.

New algorithms sample spike-and-slab priors efficiently in high dimensions.

problem Sampling from spike-and-slab priors in high-dimensional settings.
method Provably efficient algorithms for posterior sampling with sublinear measurement count.
result First provable algorithms for spike-and-slab posterior sampling without strong SNR assumptions.

A new SNN model explains decision-making with learning and spiking neurons.

problem Lack of learning mechanism in existing models for decision-making.
method Proposes a Spiking Neural Network (SNN) model that incorporates a learning mechanism and uses multivariate Hawkes processes.
result Shows a coupling between DDM and Poisson counter models and derives a DDM from a Hawkes network of spiking neurons.

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.

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.

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 ↗

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.

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.

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.

Edge devices learn directly from personal data using spiking networks.

problem Processing personal data on edge devices with low latency and energy efficiency.
method Spiking Neural Networks for local training on edge devices.
result Spiking networks enable efficient local training on edge devices without scalability limitations.

A new method improves fitting neural data with spiking network models.

problem Fitting spiking network models to neural activity does not produce realistic data.
method Augment log-likelihood with dissimilarity terms measured by summary statistics and optimized via back-propagation.
result The new method generates more realistic neural activity statistics and improves network connectivity inference.

Improves detection of low-rank signals from noisy data matrices.

problem Statistical detection of low-rank signals in noisy data matrices.
method Entrywise pre-transforming data matrix for non-Gaussian noise, sharp phase transition thresholds, central limit theorem for linear spectral statistics, hypothesis test.
result Improves detection of low-rank signals from noisy data matrices, generalizing known results.

This work investigates how gradient-based learning performs with structured data, revealing issues and improvements.

problem Gradient-based learning under structured data, particularly with a spiked covariance structure.
method Investigates the effect of a spiked covariance structure on gradient-based feature learning and proposes weight normalization.
result Gradient-based dynamics may fail to recover the true direction in anisotropic settings, but weight normalization can improve performance.

Improved neural spike inference from calcium imaging data.

problem Neural spike inference from calcium imaging data.
method Importance weighted adversarial variational autoencoders (IWAE) with adversarial training.
result Adversarial IWAE methods outperform VAEs in inferring neural spikes.

Paper proposes a new method for Bayesian linear regression using spike-and-slab priors.

problem Identifying predictors with similar relationships in linear regression models.
method Hierarchical Bayesian models with spike-and-slab priors and a Gibbs sampler.
result The proposed method outperforms previous methods in simulations and real data analysis.

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 ↗

Method reconstructs neuron models from spike times efficiently.

problem Reconstructing neuron models from spike times in degenerate populations.
method Combining deep learning with DICs to map spike times to DIC densities and generate degenerate CBM populations.
result Fast and scalable reconstruction of degenerate populations from spike recordings.

We study the problem of detecting the presence of a single unknown spike in a rectangular data matrix, in a high-dimensional regime where the spike has fixed strength and the aspect ratio of the matrix converges to a finite limit. This setup includes Johnstone's spiked covariance model. We analyze the likelihood ratio …

2018-02-20abs ↗pdf ↗

New algorithms improve Bayesian linear regression with spike-and-slab priors.

problem Efficiently sampling from Bayesian linear regression models with sparsity-inducing priors.
method Design of two sampling algorithms: Gibbs sampling and Stochastic Localization.
result Stochastic Localization sampler shows significant advantage for poorly designed data matrices.

Study eigenvalues and eigenvectors in neural networks, focusing on signal propagation.

problem Characterize signal eigenvalues and eigenvectors in neural networks.
method Characterizes signal eigenvalues and eigenvectors for a nonlinear spiked covariance model.
result Provides precise quantitative characterizations of signal eigenvalues and eigenvectors in neural networks.

Self-distillation optimally improves model performance in spiked covariance models.

problem Improving model performance in spiked covariance models.
method Developed spectral shrinkage estimators and analyzed self-distillation.
result Self-distillation achieves optimal performance among spectral shrinkage estimators for spiked covariance matrices.

The paper analyzes the risk of a least squares estimator under a spike covariance model.

problem Risk analysis of the least squares estimator under a spike covariance model.
method Assumes spike covariance matrices, studies risk as d/nightarrowd/n ightarrow \infty.
result Risk of the minimum norm least squares estimator vanishes compared to the null estimator.

Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.

problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.

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.

Paper forecasts extreme Bitcoin volatility spikes using whale transactions and CryptoQuant data.

problem Forecasting extreme volatility spikes in Bitcoin market.
method Proposes Synthesizer Transformer model for forecasting.
result Model outperforms state-of-the-art models in forecasting extreme volatility spikes.

Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.

problem Energy constraints in computation.
method Poisson variational autoencoders with a Kullback-Leibler divergence term proportional to firing rates.
result Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.

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.

Study characterizes spike deconvolution basin for noisy data.

problem Recover spike locations from noisy convolution with PSF across multiple snapshots.
method Variable-projection formulation, explicit basin of convexity characterization, local convergence guarantees.
result Consistent estimator within basin of convexity under stochastic noise, complementary error bound under adversarial noise.