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

Trend · papers per month

59118177236 · Jun 202019922001200920172026
48 results for neuron layers

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 ↗

In order to classify linearly non-separable data, neurons are typically organized into multi-layer neural networks that are equipped with at least one hidden layer. Inspired by some recent discoveries in neuroscience, we propose a new model of artificial neuron along with a novel activation function enabling the learni…

2020-02-02abs ↗pdf ↗

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.

Local convergence theory for mildly over-parameterized neural nets.

problem Understanding why over-parameterization works in neural networks.
method Developed a local convergence theory for two-layer neural nets, showing neuron convergence under certain conditions.
result All student neurons converge to one of teacher neurons when the loss is below a threshold.

Wide neural networks' last hidden layers split into groups of redundant neurons.

problem Understanding why wide neural networks generalize well despite overfitting.
method Analyzed the last hidden layer representations of various convolutional neural networks.
result Wide hidden layers split into groups of redundant neurons, which help generalize.

Training state-of-the-art, deep neural networks is computationally expensive. One way to reduce the training time is to normalize the activities of the neurons. A recently introduced technique called batch normalization uses the distribution of the summed input to a neuron over a mini-batch of training cases to compute…

2016-07-21abs ↗pdf ↗

3-layer NTK models generalize better than 2-layer models, especially with large input dimensions.

problem Understanding the generalization of overparameterized neural networks.
method Analyzing the 3-layer NTK model's test error and comparing it to 2-layer NTK models.
result 3-layer NTK models have a faster descent in test error with respect to the number of neurons in the second hidden layer.

A measure of neural complexity quantifies how hard it is to access information across neurons.

problem Understanding how mutual information is distributed among neurons in neural networks.
method Partial Information Decomposition (PID) to disentangle contributions of single neurons, multiple neurons, and synergistic effects.
result Representational Complexity measures the difficulty of accessing information across multiple neurons.

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.

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.

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.

Statistical neurodynamics studies macroscopic behaviors of randomly connected neural networks. We consider a deep layered feedforward network where input signals are processed layer by layer. The manifold of input signals is embedded in a higher dimensional manifold of the next layer as a curved submanifold, provided t…

2018-08-22abs ↗pdf ↗

A new framework for flexible neural network receptive fields.

problem Adaptive and flexible receptive fields in neural networks.
method Density-embedding layers that replace affine transformations with scalar products of input and density functions.
result Density-embedding layers can adaptively tune receptive fields and are computationally efficient.

This paper introduces a hierarchical associative memory model with multiple layers.

problem Limitations of traditional associative memory models with only one hidden layer.
method Develops a fully recurrent model with arbitrary layers, including locally connected ones, and a corresponding energy function.
result The model can dynamically assemble memories using weights from lower layers and higher layers' rules.

We demonstrate that a very deep ResNet with stacked modules with one neuron per hidden layer and ReLU activation functions can uniformly approximate any Lebesgue integrable function in dd dimensions, i.e. 1(Rd)\ell_1(\mathbb{R}^d). Because of the identity mapping inherent to ResNets, our network has alternating layers of…

2018-06-28abs ↗pdf ↗

The study analyzes how many neurons are needed for two-layer neural networks trained with gradient descent.

problem Determining the minimum number of neurons required for effective training of shallow neural networks.
method Analyzes two-layer neural networks in the NTK regime, trained with gradient descent. Derives fast rates of convergence and tracks the number of hidden neurons required for generalization.
result Derives fast rates of convergence and improves on existing results for the number of hidden neurons needed for generalization.

Two-layer neural networks need more neurons to be robust.

problem Understanding the robustness of two-layer neural networks and the role of overparametrization.
method Investigation of the tradeoffs between network size and robustness, using Lipschitz constant as a measure.
result A conjecture that robustness requires overparametrization, with precise bounds for different cases.

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 ↗

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.

Neuron-specific dropout reduces overfitting and data needs for neural networks.

problem Overfitting and insufficient training data for deep neural networks.
method Compares training and validation passes of a layer, drops targeted neurons based on feature analysis.
result Achieves similar or better testing accuracy with less data, reducing overfitting.

Recent advancements in language representation models such as BERT have led to a rapid improvement in numerous natural language processing tasks. However, language models usually consist of a few hundred million trainable parameters with embedding space distributed across multiple layers, thus making them challenging t…

2019-12-10abs ↗pdf ↗

Recently, deep learning has achieved huge successes in many important applications. In our previous studies, we proposed quadratic/second-order neurons and deep quadratic neural networks. In a quadratic neuron, the inner product of a vector of data and the corresponding weights in a conventional neuron is replaced with…

2018-07-31abs ↗pdf ↗

It is well-known that neural networks are universal approximators, but that deeper networks tend in practice to be more powerful than shallower ones. We shed light on this by proving that the total number of neurons mm required to approximate natural classes of multivariate polynomials of nn variables grows only line…

2017-05-16abs ↗pdf ↗

SGD efficiently learns the XOR function with near-optimal sample complexity.

problem Learning the XOR function with a 2-layer neural network.
method Minibatch SGD on a 2-layer neural network with ReLU activations, focusing on signal-finding and signal-heavy phases.
result Achieves population error o(1)o(1) with dextpolylog(d)d \: ext{polylog}(d) samples.

We show that a collection of Gaussian mixture models (GMMs) in RnR^{n} can be optimally classified using O(n)O(n) neurons in a neural network with two hidden layers (deep neural network), whereas in contrast, a neural network with a single hidden layer (shallow neural network) would require at least O(exp(n))O(\exp(n)) neurons …

2019-02-15abs ↗pdf ↗

Paper introduces supervised and unsupervised TAM models for binary neurons.

problem Learning and retrieval of structured triplets of patterns in neural networks.
method Extends Hebbian paradigm to supervised and unsupervised protocols, using glassy statistical mechanical techniques.
result Obtained self-consistency equations for critical dataset sizes and retrieval performance.

While neural networks are powerful approximators used to classify or embed data into lower dimensional spaces, they are often regarded as black boxes with uninterpretable features. Here we propose Graph Spectral Regularization for making hidden layers more interpretable without significantly impacting performance on th…

2018-09-30abs ↗pdf ↗

New L1L_1 regularization controls neural network generalization error and sparsifies input dimensions.

problem Selecting the optimal number of hidden neurons in neural networks.
method Theoretical analysis of L1L_1 regularization in two-layer neural networks.
result Appropriate L1L_1 regularization leads to near minimax optimal generalization risk bounds.

AGF explains feature learning in neural networks through alternating steps.

problem Understanding what features neural networks learn and how they learn them.
method AGF is an algorithmic framework that approximates the dynamics of feature learning in two-layer networks.
result AGF provides a unified framework to understand feature learning in neural networks, matching experimental results across various architectures.

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 ↗

Self-ONNs adapt nodal operators during training for higher diversity and efficiency.

problem Limited network heterogeneity and high computational demand in ONNs.
method Self-organized ONNs with generative neurons that adapt nodal operators during training.
result Self-ONNs achieve utmost heterogeneity and computational efficiency.

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.

Error backpropagation is a highly effective mechanism for learning high-quality hierarchical features in deep networks. Updating the features or weights in one layer, however, requires waiting for the propagation of error signals from higher layers. Learning using delayed and non-local errors makes it hard to reconcile…

2017-11-17abs ↗pdf ↗

We propose doubly nested network(DNNet) where all neurons represent their own sub-models that solve the same task. Every sub-model is nested both layer-wise and channel-wise. While nesting sub-models layer-wise is straight-forward with deep-supervision as proposed in \cite{xie2015holistically}, channel-wise nesting has…

2018-06-20abs ↗pdf ↗