We present two Bayesian procedures to infer the interactions and external currents in an assembly of stochastic integrate-and-fire neurons from the recording of their spiking activity. The first procedure is based on the exact calculation of the most likely time courses of the neuron membrane potentials conditioned by …
Mesoscopic model infers neural population dynamics from spike trains.
problem Challenges in fitting mechanistic spiking networks to empirical population data.
method Fit mesoscopic model to aggregate population activity, using likelihood of single-neuron and connectivity parameters.
result Extracts posterior correlations between model parameters and defines subsets of parameters able to reproduce data.
A new neural model evolves to learn at the synaptic level.
problem Lack of biologically realistic neural models in deep learning.
method Evolve individual neuron and synaptic models using ENUs.
result Evolved neural network learns complex tasks like a T-maze.
Hierarchical spiking networks resist physical distortions for neuromorphic computing.
problem Distortions in physical neuromorphic implementations of spiking networks.
method Used hierarchical leaky integrate-and-fire neurons to create robust spiking networks.
result Hierarchical spiking networks are robust to physical distortions.
The seemingly stochastic transient dynamics of neocortical circuits observed in vivo have been hypothesized to represent a signature of ongoing stochastic inference. In vitro neurons, on the other hand, exhibit a highly deterministic response to various types of stimulation. We show that an ensemble of deterministic le…
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.
High-conductance neurons sample from target distributions in stochastic inference.
problem Understanding stochastic inference in neocortical circuits.
method Analytical derivation of neural activation function, simulation of spiking networks, Bayesian inference.
result Ensemble of spiking neurons can sample from a target distribution.
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.
Researchers develop methods to learn neuron dynamics from colored noise.
problem Learning nonlocal stochastic neuron dynamics from colored noise.
method Proposed two methods for closing Fokker-Planck equations: nonlocal large-eddy-diffusivity closure and data-driven sparse regression.
result Mutual information and total correlation between stimulus and neuron states calculated for FHN neuron.
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.
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…
Improved SNNs for speech classification with PyTorch.
problem Training convolutional spiking neural networks efficiently.
method Supervised training using backpropagation through time, surrogate gradient, and novel connections.
result Achieved nearly state-of-the-art accuracy on speech classification task.
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.
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.
Three ways synchronization in financial markets can cause contagion, using models of decision-making and oscillators.
problem Contagion in financial markets caused by synchronization of decision-making.
method Agent-based modeling, integrate-and-fire oscillators, and communication models.
result Synchronization in financial markets can lead to turbulent periods and contagion.
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.
Shallow networks with local learning rules can match deep learning performance.
problem Training deep neural networks is biologically implausible; the goal is to achieve similar performance with shallow networks.
method Investigated shallow networks with one hidden layer and a single readout layer, using various local learning rules for the hidden layer and supervised learning for the readout layer.
result Shallow networks can achieve test accuracy comparable to deep learning models, suggesting the use of different datasets for testing.
Paper trains multi-layer SNNs using NormAD for spatio-temporal error backpropagation.
problem Training multi-layer SNNs with non-linear integrate-and-fire dynamics.
method Formulates training as optimization, uses NormAD for iterative synaptic weight update.
result Validated on 2- and 3-layer SNNs solving spike-based XOR and generic problems.
This paper introduces a new learning rule for probabilistic SNNs that improves log-likelihood, accuracy, and calibration.
problem Training and inference of deterministic SNNs are constrained by their inability to generate multiple independent outputs.
method Introduces a generalized expectation-maximization (GEM) learning rule for probabilistic SNNs.
result The GEM-SNN learning rule leads to significant improvements in log-likelihood, accuracy, and calibration.
This work bridges theory and practice in spiking reservoirs, identifying robust parameter ranges.
problem Challenging tuning of spiking reservoirs at the edge-of-chaos.
method Introducing robustness interval, systematic evaluations, and control experiments.
result Consistent monotonic trends in robustness interval width across network configurations.
We study how the phenomenon of contagion can take place in the network of the world's stock exchanges due to the behavioral trait "blindeness to small changes". On large scale individual, the delay in the collective response may significantly change the dynamics of the overall system. We explicitely insert a term descr…
DCT-SNN uses DCT to reduce inference latency in SNNs.
problem High inference latency in SNNs.
method Proposes a time-based encoding scheme using DCT to reduce timesteps.
result Achieves top-1 accuracy comparable to standard deep learning while reducing inference latency.
Neuron Shapley identifies key neurons in deep networks, improving model accuracy and fairness.
problem Identifying responsible neurons in deep networks for better model performance and fairness.
method Neuron Shapley framework quantifies neuron contributions, accounting for interactions.
result Removing just 30 critical filters can destroy model accuracy, revealing network function.
New q-neurons improve neural network performance.
problem Improving neural network activation functions.
method Introducing q-neurons based on Jackson's q-derivatives with stochastic parameters. result Consistently improved performance over state-of-the-art activation functions.
Describes explaining neurons in deep representations using compositional logical concepts.
problem Interpreting neuron behavior in deep neural networks.
method Identifying compositional logical concepts that closely approximate neuron behavior.
result Compositional explanations provide insights into model performance and allow for adversarial example creation.
SeReNe prunes neurons with low sensitivity to reduce network size.
problem Large neural networks consume too many resources on resource-constrained devices.
method Exploits neural sensitivity as a regularizer to prune neurons with low sensitivity.
result Pruning neurons with low sensitivity achieves competitive compression ratios.
Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.
problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.
This research investigates selectively pruning hyper and hypo neurons to improve neural network generalization.
problem Improving neural network generalization to unseen data.
method Investigates pruning hyper and hypo neurons selectively in fully connected layers of CNNs.
result Selective pruning of hyper and hypo neurons improves model performance on out-of-domain data.
Modeling hidden neurons in SNNs using mesoscopic approximations.
problem Underconstrained problem of modeling unobserved neurons in SNNs.
method Coarse-graining and mean-field approximations to derive neuLVM.
result neuLVM can efficiently model large SNNs and recover connectivity parameters.
Topological methods improve neuron analysis and tracer injection summary.
problem Traditional methods fail to capture the tree-like structure of neurons.
method Discrete Morse (DM) Theory for neuron skeletonization and consensus tree summarization.
result Significant performance improvements over non-topological methods.
Developed a BP algorithm for training neural networks with 2nd order neurons.
problem Training neural networks with nonlinear quadratic operations.
method Created a general backpropagation algorithm.
result Validated the generalized BP algorithm through numerical studies.
Quadratic autoencoder improves low-dose CT image denoising.
problem Low-dose CT image denoising.
method Quadratic autoencoder architecture applied to CT denoising.
result Quadratic autoencoder achieves superior denoising performance and efficiency.
Solves internal covariate shift and dying neurons with linked neurons.
problem Internal covariate shift and dying neurons in deep learning.
method Defining linked neurons with two constraints: shared operating point and non-zero gradient.
result Linked neurons effectively solve internal covariate shift and improve training efficiency.
Neural network robustness evaluated in the presence of failing neurons.
problem Evaluating robustness of neural networks in the face of neuron failures.
method Leveraging Lipschitz continuity of activation functions, calculating Forward Error Propagation.
result Tight bounds on the number of failing neurons before network accuracy is compromised.
We developed a faster method for calculating neuron importance in neural networks.
problem Assigning importance to individual neurons in deep learning models.
method We developed Neuron Integrated Gradients, a scalable implementation of Total Conductance.
result Neuron Integrated Gradients is faster and empirically stronger than DeepLIFT.
BEAN models neuronal correlations to create interpretable representations.
problem Hard interpretation of dense-layer representations in DNNs.
method Inspired by neuroscience, BEAN models neuronal correlations and dependencies.
result BEAN enables formation of interpretable neuronal clusters without sacrificing model performance.
SpaRCe optimizes reservoir computing by learning neuron thresholds to improve performance and prevent forgetting.
problem Improving performance and preventing forgetting in reservoir computing networks.
method Integrates neuron-specific learnable thresholds to optimize sparsity without altering dynamics, learning read-out weights and thresholds via gradient rule.
result Threshold learning improves performance and alleviates catastrophic forgetting.
It will be shown that according to theorems of K. Menger, every neuron grid if identified with a curve is able to preserve the adopted qualitative structure of a data space. Furthermore, if this identification is made, the neuron grid structure can always be mapped to a subset of a universal neuron grid which is constr…
This work improves DNN interpretability by reducing neuron ambiguity.
problem Lack of interpretability in DNNs, especially in healthcare applications.
method Developed a metric to evaluate neuron consistency, used adversarial examples to identify ambiguous features, and proposed adversarial training to improve consistency.
result Reduced ambiguity of neurons in DNNs, improving interpretability.
A new method to understand neural networks by sampling the 'inverse set' of a neuron.
problem Understanding the internal representation of neurons in neural networks.
method Optimization-based sampling approach to characterize the input space that excites a neuron.
result Inspection of samples reveals regularities that help understand the neuron's representation.
Neural networks learn to mimic brain neurons with two-input activation functions, improving performance and robustness.
problem Training neural networks to mimic the complex interactions of brain neurons.
method Developed a network-in-network architecture with two-input activation functions, optimized hyperparameters, and compared to conventional ReLU networks.
result Two-input activation functions can learn soft XOR functions, improving network performance and robustness.
CHANI learns classification tasks with local transformations inspired by biology.
problem Proving neural networks can learn classification tasks with local transformations.
method CHANI uses spiking neurons modeled by Hawkes processes with expert aggregation for local learning.
result CHANI can learn and encode multiple classes, forming assemblies of neurons.
BinaryGAN uses binary neurons for GAN training.
problem Training GANs with binary outputs.
method End-to-end backpropagation with sigmoid-adjusted straight-through estimators.
result BinaryGAN can generate binary-valued predictions.
Single neuron with ADA learns XOR and outperforms other functions.
problem Classifying linearly non-separable data.
method Proposed a new artificial neuron with apical dendrite activation.
result ADA function achieves 100% accuracy on XOR and superior performance on benchmark datasets.
Despite our extensive knowledge of biophysical properties of neurons, there is no commonly accepted algorithmic theory of neuronal function. Here we explore the hypothesis that single-layer neuronal networks perform online symmetric nonnegative matrix factorization (SNMF) of the similarity matrix of the streamed data. …
Stable unactivated neurons reduce expressiveness in ReLU networks.
problem Reducing expressiveness in ReLU neural networks due to stably unactivated neurons.
method Investigated the probability of neurons being stably unactivated in ReLU networks with symmetric weight and bias distributions.
result Proved the probability of a neuron being stably unactivated in the second hidden layer of a ReLU network.
Novel chaotic neurons improve AI with minimal training data.
problem Limited training data for AI algorithms.
method Intrinsically chaotic neurons inspired by chaos theory.
result Classification accuracy up to 95.8% with just 2 training samples per class.
Optimal neuron activation functions improve neural network performance.
problem Limited expressive power of standard neuron activation functions in neural networks.
method Additive Gaussian process regression to construct individual neuron activation functions.
result Optimal neuron activation functions lead to better performance and reduced overfitting.