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

65130195260 · Jun 202019922001200920172026
48 results for neuronal connectivity

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.

Novel 'strong neuron' improves deep learning efficiency and robustness.

problem Improving deep learning efficiency and robustness against adversarial attacks.
method Introducing a novel 'strong neuron' model and a constructive training algorithm.
result Achieved 10x-100x reduction in operations count and hardware requirements.

This paper presents a new artificial neuron model capable of learning its receptive field in the topological domain of inputs. The model provides adaptive and differentiable local connectivity (plasticity) applicable to any domain. It requires no other tool than the backpropagation algorithm to learn its parameters whi…

2018-08-31abs ↗pdf ↗

To understand how rich dynamics emerge in neural populations, we require models exhibiting a wide range of activity patterns while remaining interpretable in terms of connectivity and single-neuron dynamics. However, it has been challenging to fit such mechanistic spiking networks at the single neuron scale to empirica…

2019-10-03abs ↗pdf ↗

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.

Proposes neuron alignment to optimize mode connectivity in neural networks.

problem Understanding and optimizing mode connectivity in deep neural networks.
method Introduces neuron alignment to approximate optimal weight permutations and improve mode connectivity.
result Neuron alignment significantly alleviates robust loss barriers and improves model robustness and accuracy.

Neural circuits contain heterogeneous groups of neurons that differ in type, location, connectivity, and basic response properties. However, traditional methods for dimensionality reduction and clustering are ill-suited to recovering the structure underlying the organization of neural circuits. In particular, they do n…

2016-10-26abs ↗pdf ↗

Estimates neuronal connectivity from spike times using flexible Hawkes processes.

problem Learning latent network structure from multivariate point process data.
method Proposes a new nonstationary Hawkes process and uses sparse least squares estimation.
result Establishes non-asymptotic error bounds and selection consistency for estimated parameters.

Improved NiNo networks accelerate Adam training by up to 50%.

problem Accelerating neural network training with stable and efficient methods.
method Proposed NiNo networks that leverage neuron connectivity and graph neural networks to nowcast parameters periodically during Adam training.
result Accelerates Adam training by up to 50% in vision and language tasks.

Paper improves neural interaction modeling using nonlinear Hawkes processes.

problem Inability of classic Hawkes process to model inhibitory interactions.
method Augmented auxiliary latent variables and EM algorithm for efficient inference.
result Demonstrates accurate and efficient estimation of neural interaction dynamics.

Efficiently estimates neural connectivity using ensemble stimulation.

problem Estimating functional connectivity in large, behaving neural populations.
method Noisy group testing combined with convex optimization and Bayesian inference.
result Connectivity can be inferred with logarithmic growth in tests, even for large networks.

One of the main difficulties in analyzing neural networks is the non-convexity of the loss function which may have many bad local minima. In this paper, we study the landscape of neural networks for binary classification tasks. Under mild assumptions, we prove that after adding one special neuron with a skip connection…

2018-05-22abs ↗pdf ↗

SGD with over-param. makes neural net landscape connected, aiding optimization.

problem Spurious local minima and disconnected landscape in neural networks optimization.
method Stochastic Gradient Descent (SGD) with over-parameterization.
result SGD solutions are connected via a piecewise linear path, making the landscape approximately connected.

RNNs trained on head direction task mimic brain's compass and shifter neurons.

problem Modeling brain's head direction system using neural networks.
method Optimized recurrent neural networks trained on angular velocity integration.
result RNNs naturally emerge with compass and shifter neuron-like properties.

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.

We introduce bio-inspired artificial neural networks consisting of neurons that are additionally characterized by spatial positions. To simulate properties of biological systems we add the costs penalizing long connections and the proximity of neurons in a two-dimensional space. Our experiments show that in the case wh…

2019-10-07abs ↗pdf ↗

Capsules are the multidimensional analogue to scalar neurons in neural networks, and because they are multidimensional, much more complex routing schemes can be used to pass information forward through the network than what can be used in traditional neural networks. This work treats capsules as collections of neurons …

2019-07-26abs ↗pdf ↗

New method estimates neuronal connectivity from partially observed data.

problem Estimating neuronal connectivity from partially observed data.
method Two-step approach: low-rank covariance completion followed by graph structure estimation.
result Graph selection consistency demonstrated for one approach.

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.

New metric captures individual neuron tuning across neural networks.

problem Need a metric that respects individual neuron tuning across different neural networks.
method Derived a 'soft' permutation-based metric using optimal transport theory.
result Metric avoids counter-intuitive outcomes and captures geometric insights.

DNN pruning reduces memory footprint and computational work of DNN-based solutions to improve performance and energy-efficiency. An effective pruning scheme should be able to systematically remove connections and/or neurons that are unnecessary or redundant, reducing the DNN size without any loss in accuracy. In this p…

2019-06-06abs ↗pdf ↗

Probabilistic bounds on neuron death in deep networks, showing depth can be increased indefinitely.

problem Understanding neuron death in deep rectifier networks and its impact on model trainability.
method Deriving upper and lower bounds on neuron death probability as a function of model hyperparameters.
result The probability of neuron death decreases as network depth increases, provided width increases proportionally.

This paper improves model fusion by training-time neuron alignment, reducing barriers in multi-model fusion.

problem Diverse neuron permutations across different settings hinder model fusion performances.
method Training-time neuron alignment using fixed neuron anchors to reduce training-time permutations.
result Training-time neuron alignment improves fusion of pretrained models and federated learning performances.

Knowledge of functional groupings of neurons can shed light on structures of neural circuits and is valuable in many types of neuroimaging studies. However, accurately determining which neurons carry out similar neurological tasks via controlled experiments is both labor-intensive and prohibitively expensive on a large…

2019-05-30abs ↗pdf ↗

Neuroscientific theory suggests that dopaminergic neurons broadcast global reward prediction errors to large areas of the brain influencing the synaptic plasticity of the neurons in those regions. We build on this theory to propose a multi-agent learning framework with spiking neurons in the generalized linear model (G…

2019-10-15abs ↗pdf ↗

The study quantifies geometric differences between axonal branches using splines.

problem Neuromorphology's focus on macroscopic features neglects neuron internal geometry.
method Fitting splines to neuron traces, using Frenet-Serret formulas to compute curvature and torsion.
result Parameters of curvature and torsion are distributed differently between axonal branches.

This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is to provide statistical tools for detecting changes in firing patterns with changing stimuli. Our framework is not restricted to the well-under…

2013-02-13abs ↗pdf ↗

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.