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

Trend · papers per month

117233350466 · Jun 202019922001200920172026
48 results for spike layer solutions

Chemical networks outperform spiking neural networks in classification tasks.

problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.

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 ↗

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.

We propose reinforcement learning on simple networks consisting of random connections of spiking neurons (both recurrent and feed-forward) that can learn complex tasks with very little trainable parameters. Such sparse and randomly interconnected recurrent spiking networks exhibit highly non-linear dynamics that transf…

2019-06-04abs ↗pdf ↗

Configuring deep Spiking Neural Networks (SNNs) is an exciting research avenue for low power spike event based computation. However, the spike generation function is non-differentiable and therefore not directly compatible with the standard error backpropagation algorithm. In this paper, we introduce a new general back…

2018-09-05abs ↗pdf ↗

DIET-SNN optimizes SNNs for faster, lower-energy image classification.

problem High inference latency and inefficient input encoding in SNNs.
method End-to-end backpropagation to optimize membrane leak and firing threshold.
result Achieves top-1 accuracy of 69% on ImageNet with 5 timesteps and 12x less compute energy.

We present a confidence-based single-layer feed-forward learning algorithm SPIRAL (Spike Regularized Adaptive Learning) relying on an encoding of activation spikes. We adaptively update a weight vector relying on confidence estimates and activation offsets relative to previous activity. We regularize updates proportion…

2016-11-18abs ↗pdf ↗

Proposes a Bayesian approach for automatic node selection in sparse neural networks.

problem Reduces structural complexity and computational speedup in large-scale predictive models.
method Uses spike-and-slab Gaussian priors and variational Bayes approach for node selection.
result Establishes variational posterior consistency and optimal contraction rates for sparse networks.

A hybrid training method reduces SNN training time and complexity.

problem Training deep SNNs is computationally expensive and time-consuming.
method Hybrid training technique combining initialization from converted SNNs and incremental spike-timing dependent backpropagation (STDB).
result The method converges in less than 20 epochs, reducing training complexity and time.

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.

Attention learns PCA on Gaussian data, proving its connection to principal component analysis.

problem Principal component analysis on Gaussian data.
method Analysis of attention mechanisms through PCA, covering finite and infinite prompt regimes.
result Attention aligns with principal eigenvectors of covariance matrices, converging to optimal solutions in the infinite-prompt limit.

Gradient descent with growing learning rate enables learning non-linear features in neural networks.

problem Learning non-linear features in two-layer neural networks.
method Using gradient descent with a learning rate that grows with the sample size.
result Multiple rank-one components emerge, each corresponding to a specific polynomial feature.

SpecGD mitigates misalignment in phase retrieval models with anisotropic inputs.

problem Misalignment during gradient descent in phase retrieval models with anisotropic inputs.
method Spectral gradient descent modifies gradient updates to preserve directional information and remove spike amplification.
result SpecGD removes spike amplification, leading to stable alignment and accelerated noise contraction.

This project proposes using reinforcement learning to train spiking neural networks.

problem Training spiking neural networks using traditional methods is challenging due to the discrete nature of spikes.
method The project investigates two approaches: 1) treating each neuron as an RL agent, 2) applying the reparameterization trick.
result The project demonstrates that reinforcement learning can be applied to train spiking neural networks.

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.

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.

RFMs transition from linear to nonlinear under specific input-label correlation.

problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.

Anisotropic data structure affects learning dynamics and generalization error in linear networks.

problem Understanding the impact of data anisotropy on learning dynamics and generalization error in linear networks.
method Examined a spiked covariance structure as a model of anisotropy in a two-layer linear network in a linear regression setting.
result Learning dynamics proceed in two phases: initially driven by input-output correlation, then by other principal directions of the data structure. Derived an analytical expression for the generalization error.

This paper explains how low-precision arithmetic causes loss spikes in deep learning models.

problem Loss spikes during long-term training of deep neural networks.
method Analyzes the impact of floating-point precision limits on gradient updates and feature means.
result Numerical Feature Inflation (NFI) explains loss spikes and rapid parameter norm growth.

New method converts conventional ANNs to SNNs with minimal loss and efficiency.

problem Difficulty in training SNNs directly from conventional ANNs due to discreteness.
method Proposes a novel pipeline combining threshold balance and soft-reset mechanisms for efficient conversion.
result Achieves almost no accuracy loss with only 1/10 of typical SNN simulation time.

Framework for training stochastic spiking neural networks with rough signals.

problem Training stochastic spiking neural networks with noisy spike timing and dynamics.
method Rough path theory and signature kernels for gradient computation.
result Pathwise gradients of SSNNs' trajectories and event times exist and satisfy a recursive relation.

A brain-inspired spiking Transformer reduces energy consumption and enhances interpretability.

problem Energy inefficiency and lack of interpretability in Transformer models.
method Spiking STDP Transformer using spike-timing-dependent plasticity (STDP) for self-attention.
result Achieves 94.35% and 78.08% accuracy on CIFAR-10 and CIFAR-100 datasets respectively, with 88.47% energy reduction.

T-SVM improves learning in spiking neurons by maximizing dynamical margin.

problem Finding robust solutions in spiking neuronal networks with temporal correlations.
method Introduces Temporal Support Vector Machine (T-SVM) to maximize dynamical margin.
result T-SVM enables learning of tasks requiring nonlinear spatial integration.

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 ↗

Improves energy efficiency of neuromorphic hardware by optimizing memory organization and encoding schemes.

problem Energy inefficiency in neuromorphic hardware, especially in digital accelerators.
method Synthesized controller and memory for different encoding schemes, introduced functional encoding for structured connectivity.
result Functional encoding offers a 58% reduction in energy for weight updates in convolutional layers.

New insights into why neural networks generalize well.

problem Understanding why neural networks generalize well despite heavy-tailed weight distributions.
method Developed a simple model to analyze the emergence of heavy-tailed empirical spectral densities (ESDs) in two-layer neural networks without gradient noise.
result Learning rates play a crucial role in shaping the ESDs of two-layer neural networks, leading to better generalization.

SparseProp speeds up SNN simulations and training by four orders of magnitude.

problem Efficiently simulating and training large spiking neural networks.
method Event-based algorithm that reduces computational cost from O(N) to O(log(N)) per spike.
result Numerically exact simulations of large spiking networks and efficient training using backpropagation.