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.

169,051 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jul 199219922001200920182026
48 results for Neuron Ranking

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.

Elite ONNs learn better with synaptic plasticity, improving performance over CNNs.

problem Limited heterogeneity in ONNs due to fixed operator sets.
method Synaptic plasticity-based search for optimal operator sets.
result Elite ONNs achieve superior learning performance compared to conventional methods.

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

Single neuron learns predictive uncertainty in deep learning models.

problem Uncertainty estimation in deep learning models, especially with respect to model specification and training procedure.
method Introduces a non-parametric quantile estimation method using a single neuron.
result The method achieves competitive predictive uncertainty quantification quality and coverage compared to state-of-the-art solutions.

Biological neural network mimics CCA for multi-channel data.

problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.

Active learning method for neural population dynamics using optogenetics.

problem Efficiently selecting neurons to stimulate for identifying neural population dynamics.
method Developed active learning procedure for low-rank regression to determine informative photostimulation patterns.
result Demonstrated a two-fold reduction in data required for predictive power using low-rank linear dynamical systems model.

HOPE uses Hilbert space to deconstruct deep network representations.

problem Deconstructing learned representations in deep networks is challenging.
method Introduces Hilbert Operator for Progressive Encoding (HOPE) to deconstruct network weights.
result HOPE provides an unbiased approach to network compression and fine-tuning.

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.

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.

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.

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.

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.

New methods estimate brain connectivity from calcium imaging data with missing data.

problem Estimating functional neuronal connectivity from calcium imaging data with missing data.
method Two approaches for nonparanormal Graph Quilting based on the Gaussian copula graphical model.
result Our methods yield more meaningful functional connectivity estimates than existing Gaussian graph quilting methods.

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.

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.

LoRA fine-tuning explained with gradient dynamics for low-rank perturbations.

problem Understanding why gradient descent converges to useful low-rank perturbations in LoRA fine-tuning.
method Generalized student-teacher setting with i.i.d. samples and online gradient descent.
result Gradient descent converges to the teacher model in dkO(1)dk^{O(1)} iterations under certain conditions.

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.

The challenge of assigning importance to individual neurons in a network is of interest when interpreting deep learning models. In recent work, Dhamdhere et al. proposed Total Conductance, a "natural refinement of Integrated Gradients" for attributing importance to internal neurons. Unfortunately, the authors found tha…

2018-07-26abs ↗pdf ↗

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.

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.

We view a neural network as a distributed system of which neurons can fail independently, and we evaluate its robustness in the absence of any (recovery) learning phase. We give tight bounds on the number of neurons that can fail without harming the result of a computation. To determine our bounds, we leverage the fact…

2017-06-27abs ↗pdf ↗

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 ↗

Novel method decorrelates neurons for better deep learning model generalization.

problem High correlations between neurons limit deep learning model generalization.
method Regularization terms from minimum spanning tree of neuron cliques, using correlation dissimilarities.
result Our regularizers outperform existing methods and minimize neuron redundancies.

A neuron is a basic physiological and computational unit of the brain. While much is known about the physiological properties of a neuron, its computational role is poorly understood. Here we propose to view a neuron as a signal processing device that represents the incoming streaming data matrix as a sparse vector of …

2014-05-12abs ↗pdf ↗