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

4999148197 · Jun 202019922001200920172026
48 results for Neuron Activation Profiles

Introspects convolutional speech recognition models using Gradient-adjusted Neuron Activation Profiles.

problem Lack of interpretability in deep learning ASR models.
method Gradient-adjusted Neuron Activation Profiles (GradNAPs) for feature and representation visualization.
result Gains insight into how data is processed in convolutional ASR models.

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 ↗

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.

An artificial neuron is modelled as a weighted summation followed by an activation function which determines its output. A wide variety of activation functions such as rectified linear units (ReLU), leaky-ReLU, Swish, MISH, etc. have been explored in the literature. In this short paper, we explore what happens when the…

2019-12-27abs ↗pdf ↗

Recent developments in high throughput profiling of individual neurons have spurred data driven exploration of the idea that there exist natural groupings of neurons referred to as cell types. The promise of this idea is that the immense complexity of brain circuits can be reduced, and effectively studied by means of i…

2019-11-06abs ↗pdf ↗

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.

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.

This work makes vision networks more interpretable by identifying key neurons.

problem Complex deep networks are hard to interpret, hindering safety-critical applications.
method Uses stochastic local competition and multimodal models to dissect and interpret neurons.
result The method generates understandable descriptions for a few active neurons, revealing network decision-making.

Gradient descent dynamics in neural networks show quenching and activation phases.

problem Understanding training dynamics in neural networks.
method Numerical and phenomenological study of gradient descent algorithm for two-layer neural networks.
result Gradient descent dynamics exhibit quenching and activation phases in under-parametrized networks.

Many neural network architectures rely on the choice of the activation function for each hidden layer. Given the activation function, the neural network is trained over the bias and the weight parameters. The bias catches the center of the activation, and the weights capture the scale. Here we propose to train the netw…

2019-01-28abs ↗pdf ↗

Study learns a neuron with non-monotonic activation functions.

problem Learning a single neuron with non-monotonic activation functions.
method Gradient descent (GD) with conditions on activation function and input distribution.
result Learnability of non-monotonic activation functions is established without monotonicity assumption.

Artificial neural networks typically have a fixed, non-linear activation function at each neuron. We have designed a novel form of piecewise linear activation function that is learned independently for each neuron using gradient descent. With this adaptive activation function, we are able to improve upon deep neural ne…

2014-12-21abs ↗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 ↗

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.

Gradient descent struggles with learning a single neuron with bias.

problem Learning a single neuron with a bias term in the realizable setting with ReLU activation.
method Theoretical study using gradient descent, characterizing critical points, and providing convergence guarantees.
result Gradient descent faces significant challenges in learning a single neuron with bias, unlike the bias-less case.

This paper explores adaptive neural activation in RNNs for better learning.

problem Fixed neural activation functions limit the performance and adaptability of RNNs.
method Developed a novel parametric family of nonlinear activation functions inspired by biological neurons.
result Adaptive neural activation improves learning speed and performance in RNNs.

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 ↗

The paper explores properties of the Radon transform in relation to neural networks and ridges.

problem Understanding the Radon transform and its application to neural networks and ridges.
method Investigates properties of the Radon transform, introduces new subspaces, and characterizes ridges for any distributional profile.
result Clarifies and simplifies results on the optimality of ReLU networks using the Radon transform.

Algorithm learns arbitrary ReLU neurons under Gaussian inputs.

problem Learn an arbitrary ReLU activation over Gaussian marginals.
method Statistical Query (SQ) algorithm that outputs a ReLU activation achieving O(OPT)+εO(\mathrm{OPT}) + \varepsilon loss.
result First constant factor approximation for arbitrary bias in polynomial time.

Many activation functions have been proposed in the past, but selecting an adequate one requires trial and error. We propose a new methodology of designing activation functions within a neural network at each layer. We call this technique an "activation ensemble" because it allows the use of multiple activation functio…

2017-02-24abs ↗pdf ↗

Automated method finds meaningful directions in neural network activations.

problem Mixed selectivity in neurons makes interpretation challenging.
method Automated quantification of interpretability and discovery of meaningful directions.
result Meaningful directions in neural network activations are more interpretable than individual neurons.

This work proposes a novel solution to the problem of internal covariate shift and dying neurons using the concept of linked neurons. We define the neuron linkage in terms of two constraints: first, all neuron activations in the linkage must have the same operating point. That is to say, all of them share input weights…

2017-12-07abs ↗pdf ↗

For using neural networks in safety critical domains, it is important to know if a decision made by a neural network is supported by prior similarities in training. We propose runtime neuron activation pattern monitoring - after the standard training process, one creates a monitor by feeding the training data to the ne…

2018-09-18abs ↗pdf ↗

Over-parametrization speeds up learning a single neuron model.

problem Understanding why over-parametrization accelerates learning in neural networks.
method Studied a simple model of a single teacher neuron with quadratic activation, showing how over-parametrization can lead to faster convergence.
result Over-parametrization helps gradient descent enter the neighborhood of a global optimal solution faster.

We introduce switched linear projections for expressing the activity of a neuron in a deep neural network in terms of a single linear projection in the input space. The method works by isolating the active subnetwork, a series of linear transformations, that determine the entire computation of the network for a given i…

2019-09-25abs ↗pdf ↗

Simple neural networks approximate any continuous function with fixed neurons.

problem Approximating arbitrary continuous functions with limited neurons.
method Developed simple feed-forward neural networks with a specific activation function.
result Proven that networks with 36d(2d+1) neurons and depth 11 can approximate any continuous function.

Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.

problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.

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 ↗