New method improves spike count estimation for neural populations.
problem Model overfitting and inaccurate parameter estimates in spike count modeling.
method Hierarchical parametric empirical Bayes method integrating GLMs and empirical Bayes theory.
result Improved accuracy and reliability of parameter estimation compared to existing methods.
This paper uses cPF to build recommender systems from raw count data.
problem Sparse, over-dispersed and bursty count data make direct use in recommender systems challenging.
method Compound Poisson Factorization (cPF) with a unified framework (dcPF) and adaptive algorithm.
result dcPF achieves better recommendation scores than Poisson Factorization on raw or binarized data.
New method calculates DMN log-likelihood faster.
problem Precise and fast computation of DMN log-likelihood.
method Derived a closed form expression using gamma function properties.
result Closed form calculation is faster with same accuracy.
Improved peak detection in ChIP-seq data reduces over-dispersion.
problem Over-dispersion in ChIP-seq data reduces peak detection accuracy.
method Supervised segmentation models with alternative noise assumptions.
result Improved peak detection accuracy compared to natural assumptions.
NBMF improves recommendation precision by modeling count data dispersion.
problem Predicting user preferences in recommender systems with over-dispersed data.
method NBMF extends PF with a multiplicative term to handle over-dispersion, skipping binarization.
result NBMF predicts user tastes more accurately than Poisson matrix factorization.
Enhances count process modelling with Markov-modulated non-homogeneous Poisson process.
problem Count data modelling challenges, especially in complex scenarios.
method Introduces a flexible frequency perturbation measure into Markov-modulated Poisson process framework.
result Natural incorporation of observed event arrivals and latent factors.
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.
Transformer learns to estimate negative binomial parameters efficiently.
problem Parameter estimation for over-dispersed count data in large screens.
method Pre-trained transformer trained on synthetic data generation to invert parameter to count transformation.
result Method of moments provides faster, more efficient, and better-calibrated estimates.
Single spiking neuron outperforms ConvNets in counting weakly labeled concepts.
problem Counting weakly labeled concepts in MNIST task.
method Improved gradient-based local learning rule for leaky integrate and fire model.
result Single spiking neuron outperforms conventional ConvNets in MNIST counting task.
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.
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.
Bayesian model tackles spatial count data issues with flexible non-parametric techniques.
problem Challenges in traditional parametric models for spatial count data with unbalanced distributions and complex dependencies.
method Bayesian semi-parametric spatial dispersed count model combining non-parametric techniques and adapted count models.
result Demonstrates superior performance in managing dispersion and capturing intricate spatial patterns.
Develops a method to model multivariate count processes with Cox processes and shot noise intensities.
problem Modeling and estimating dependent count processes using granular data.
method Multivariate Cox process with shot noise intensities, connected via Lévy copulas.
result Allows for over-dispersion, auto-correlation, and realistic features in count processes.
p-SNE embeds Poisson count data into low dimensions preserving structure.
problem Embedding high-dimensional sparse Poisson data into a low-dimensional space.
method p-SNE (Poisson Stochastic Neighbor Embedding) using KL divergence and Hellinger distance.
result p-SNE recovers meaningful structure in real-world count datasets.
Modified EAT method improves Poisson gradient estimation.
problem Challenging differentiation through Poisson-distributed latent variables.
method Exponential Arrival Time (EAT) simulation with modifications and Gumbel-SoftMax relaxation.
result Modified EAT method provides unbiased first moment and reduced second-moment bias.
We define a family of probability distributions for random count matrices with a potentially unbounded number of rows and columns. The three distributions we consider are derived from the gamma-Poisson, gamma-negative binomial, and beta-negative binomial processes. Because the models lead to closed-form Gibbs sampling …
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.
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.
Next-generation sequencing technologies provide a revolutionary tool for generating gene expression data. Starting with a fixed RNA sample, they construct a library of millions of differentially abundant short sequence tags or "reads", which constitute a fundamentally discrete measure of the level of gene expression. A…
Estimates rank-one spikes from heavy-tailed noise using self-avoiding walks.
problem Estimating rank-one spikes from heavy-tailed noise.
method Self-avoiding walks to count and estimate the spikes.
result Optimal estimation up to the BBP threshold for heavy-tailed noise.
End-to-end deep learning boosts IM/DD fiber communication over dispersive channels.
problem Improving data transmission over dispersive IM/DD channels with memory.
method Bidirectional recurrent neural network (BRNN) for end-to-end deep learning of the communication system.
result End-to-end SBRNN achieves significant bit-error-rate reduction compared to FFNNs.
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.
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.
PRGDS models count tensors with sparsity and burstiness.
problem Modeling sequential count data with sparsity and burstiness.
method Poisson-randomized gamma dynamical system with alternating Poisson and gamma latent states.
result Sparse PRGDS often outperforms other models in predicting count data.
Develops a new neural spike train decoding framework using topological data.
problem Decoding neural spike trains from head direction and grid cells.
method Combines simplicial complex discovery with deep learning to capture higher-order connectivity.
result Demonstrates effectiveness on head direction and trajectory prediction datasets.
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.
Gradient descent optimizes spiking neural networks for dynamic tasks.
problem Lack of efficient supervised learning algorithms for spiking networks.
method Differentiable formulation of spiking networks and exact gradient calculation.
result Optimizes spiking network dynamics on both spike and behavioral time scales.
Paper trains SNNs for classification using first-to-spike decoding.
problem Training SNNs for classification under GLM model.
method Proposes first-to-spike decoding method for SNNs.
result Improves accuracy and efficiency of SNN classification.
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.
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.
SuperSpike learns spiking neural networks to perform complex computations.
problem Training spiking neural networks to perform nonlinear computations.
method Derive SuperSpike, a learning rule for multi-layer spiking neural networks.
result SuperSpike enables training of multi-layer spiking neural networks to solve complex tasks.
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.
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.
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.
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.
SPIRAL uses spikes to adaptively update weights, improving robustness and reducing overfitting.
problem Improving robustness and reducing overfitting in learning algorithms.
method Adaptive weight updates based on confidence estimates and activation offsets, regularized by spike rates.
result SPIRAL is more robust and less prone to overfitting compared to averaged perceptron and AROW.
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.