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

Trend · papers per month

2.0%4.0%6.0%8.0% · Aug 199719922001200920172026
48 results for ReLU Non-linearities

Gradient descent fails to train two-layer ReLU networks, leading to poor performance.

problem Gradient descent training of two-layer ReLU networks initialized by He et al. (2015) fails to find optimal solutions.
method Gradient descent on a least-squares loss for training two-layer (Leaky)ReLU networks.
result Gradient descent only finds bad local minima, leading to linear regression for non-linear target functions.

This paper explains a mechanism called phase collapse that improves image classification accuracy.

problem Understanding the role of non-linearities and convolutional filters in image classification.
method Demonstrates phase collapse as a mechanism that eliminates spatial variability and linearly separates classes.
result Phase collapse improves classification accuracy, while thresholding operators degrade performance.

New algorithms accelerate solving nonlinear matrix decomposition with ReLU.

problem Nonlinear matrix decomposition with ReLU function.
method Two new algorithms: A-NMD and 3B-NMD, with adaptive extrapolation and block parametrization.
result Effective algorithms accelerate solving ReLU-NMD problems.

Improved learning bounds for corrupted data using thresholded gradient descent.

problem Learning from corrupted data with adversarial noise.
method Thresholded gradient descent for sigmoidal, leaky-ReLU, and ReLU activations.
result Improved approximation bounds for various activation functions.

We develop algorithms to learn non-linear dynamical systems without mixing assumptions.

problem Learning non-linear dynamical systems from dependent data.
method We introduce an offline algorithm and a one-pass streaming method with SGD-RER.
result Our methods achieve optimal or near-optimal performance for learning non-linear systems.

We propose a new notion of `non-linearity' of a network layer with respect to an input batch that is based on its proximity to a linear system, which is reflected in the non-negative rank of the activation matrix. We measure this non-linearity by applying non-negative factorization to the activation matrix. Considering…

2018-10-08abs ↗pdf ↗

Theoretical analysis of deep neural networks for time series data.

problem Theoretical development for deep neural networks on temporally dependent observations is lacking.
method Established non-asymptotic bounds for prediction error of deep neural networks under mixing-type assumptions.
result Deep neural networks can model non-linear time series data with additional logarithmic factors due to dependence.

In adversarial attacks to machine-learning classifiers, small perturbations are added to input that is correctly classified. The perturbations yield adversarial examples, which are virtually indistinguishable from the unperturbed input, and yet are misclassified. In standard neural networks used for deep learning, atta…

2018-09-25abs ↗pdf ↗

We propose a new way of thinking about deep neural networks, in which the linear and non-linear components of the network are naturally derived and justified in terms of principles in probability theory. In particular, the models constructed in our framework assign probabilities to uncertain realizations, leading to Ku…

2018-09-26abs ↗pdf ↗

Study on dynamics of non-linear autoencoders learning principal components.

problem Technical difficulty in studying non-linear autoencoders due to non-trivial correlations.
method Derive asymptotically exact equations for SGD training of shallow, non-linear autoencoders.
result Autoencoders learn principal components sequentially and tie weights are ineffective.

Deep ReLU networks approximate functions in Sobolev and Besov spaces efficiently.

problem Efficiently approximating functions in Sobolev and Besov spaces using deep ReLU networks.
method Novel bit-extraction technique and VC-dimension method for deriving approximation bounds.
result Sharp upper and lower bounds for LpL_p-approximation of functions in Sobolev and Besov spaces.

SPLASH units improve deep neural network accuracy and adversarial robustness.

problem Improving deep neural network accuracy and adversarial robustness.
method SPLASH units are learnable activation functions with specific properties that enhance both accuracy and robustness.
result SPLASH units significantly increase adversarial robustness of deep neural networks.

New findings on how neural networks generalize with varying dimensions.

problem Understanding how neural networks generalize with different dimensions and noise levels.
method Study of 2-layer ReLU NNs in a classification setting, proving transitions in overfitting types.
result The type of overfitting transitions from tempered to benign as input dimension increases.

`Biologically inspired' activation functions, such as the logistic sigmoid, have been instrumental in the historical advancement of machine learning. However in the field of deep learning, they have been largely displaced by rectified linear units (ReLU) or similar functions, such as its exponential linear unit (ELU) v…

2018-03-19abs ↗pdf ↗

Neural networks extrapolate poorly in simple tasks but succeed in complex ones.

problem Understanding neural networks' extrapolation capabilities and conditions for success.
method Analyzing ReLU MLPs and GNNs, connecting to neural tangent kernel.
result ReLU MLPs learn linear functions but not most nonlinear ones, while GNNs succeed in complex tasks due to task-specific non-linearities.

GOLS finds activation functions affect training robustness, especially ReLU.

problem Investigate how different activation functions impact GOLS in neural network training.
method Identify SNN-GPPs for GOLS, analyze activation function effects on gradient continuity.
result GOLS robust for most activation functions but sensitive to ReLU.

A corrective neural network approach improves memorization and learning efficiency.

problem Improving neural network memorization and learning efficiency.
method Divide neural network into groups to sequentially approximate and correct errors.
result Two-layer neural networks can memorize arbitrary labels with optimal number of ReLUs.

First proper learning algorithm for Gaussian halfspaces with matching sample and computational complexity.

problem Agnostically learning halfspaces under Gaussian distribution.
method First proper learning algorithm with matching sample and computational complexity.
result First proper learning algorithm for agnostically learning halfspaces under Gaussian distribution with matching sample and computational complexity.

Wide networks with polynomial activations have proven asymptotic behavior.

problem Understanding the behavior of neural networks in the large width limit.
method Proving a conjecture for deep networks with polynomial activation functions.
result Tight bounds on the behavior of wide networks during stochastic gradient descent and derivation of their finite-width dynamics.

New algorithms improve neural network verification by exploiting piecewise linear structure.

problem Efficiently verify the correctness of neural networks, especially those with high-dimensional inputs.
method Branch-and-Bound (BaB) framework applied to Mixed Integer Linear Programming (MIP) formulation.
result Significant performance improvements and new branching strategies for neural networks.

Study shows depth improves trainability of neural networks by improving kernel conditioning.

problem Improving trainability of neural networks with random initialization and overparameterization.
method Analyzes the role of depth in training neural networks, proving that depth improves conditioning of kernel matrices.
result General result showing depth improves trainability of neural networks by improving the conditioning of kernel matrices.

This study connects ReLU neural networks to toric geometry to analyze function realization.

problem Determining which continuous piecewise linear functions can be realized by ReLU neural networks.
method Established a connection between toric geometry and ReLU neural networks, defining key structures like the ReLU fan, toric variety, and Cartier divisor.
result Proved a criterion for functions realizable by unbiased shallow ReLU networks using intersection numbers.

The paper investigates how target normalization and momentum affect dying ReLUs in neural networks.

problem Understanding and mitigating the dying ReLU problem in neural networks.
method Empirical analysis and theoretical modeling of a discrete-time linear autonomous system.
result Target variance plays a crucial role in the dying ReLU phenomenon, and momentum exacerbates this issue.

Paper proposes a new activation function to reduce overfitting and large weight update issues.

problem Overfitting and large weight update problems in neural networks.
method Introduces a new activation function called Thresholded Exponential Rectified Linear Units (TERELU).
result TERELU shows better performance in reducing overfitting and large weight update issues compared to other activation functions.

Large deviation principle for deep neural networks with ReLU activation.

problem Understanding the behavior of deep neural networks with ReLU activation.
method Proving a large deviation principle for networks with Gaussian weights and ReLU activation functions.
result Simplified expressions and power-series expansions for the ReLU case.

This work uses tropical geometry to understand neural network decision boundaries.

problem Characterizing neural network decision boundaries with piecewise linear activations.
method Tropical geometry applied to a simple neural network model.
result Decision boundaries are a subset of a tropical hypersurface related to a polytope formed by zonotopes.

Study shows efficient neural network approach for stochastic bandits.

problem Optimizing decisions in uncertain environments with neural network models.
method OFU-ReLU algorithm that balances exploration and exploitation, using a transformed feature space.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret guarantee for stochastic bandits with ReLU neural networks.

The dying ReLU refers to the problem when ReLU neurons become inactive and only output 0 for any input. There are many empirical and heuristic explanations of why ReLU neurons die. However, little is known about its theoretical analysis. In this paper, we rigorously prove that a deep ReLU network will eventually die in…

2019-03-15abs ↗pdf ↗

Hard to learn ReLU with Gaussian data, but can approximate efficiently.

problem Learning a ReLU with Gaussian marginals under arbitrary labels.
method Proved hardness and developed an efficient approximation algorithm.
result Efficient approximation algorithm for best-fitting ReLU with error O(opt2/3)O(\mathsf{opt}^{2/3}).

The paper analyzes deep ReLU CNNs' approximation properties in 2D space.

problem Establishing L2L^2 approximation properties for deep ReLU CNNs.
method Analysis based on decomposition theorem for convolutional kernels, properties of ReLU activation, and connections with one-hidden-layer ReLU NNs.
result Universal approximation theorem for deep ReLU CNNs with classic structure.

Proves existence of optimal shallow neural networks with ReLU activation.

problem Proving the existence of optimal shallow feedforward networks with ReLU activation.
method Proves existence of global minima in the loss landscape for continuous target functions using shallow feedforward neural networks with ReLU activation.
result Existence of global minima in the loss landscape for shallow feedforward networks with ReLU activation.

Bayesian ReLU nets fix asymptotic overconfidence with infinite features.

problem Bayesian ReLU nets can be asymptotically overconfident far from training data.
method Extend finite ReLU BNNs with infinite ReLU features via a Gaussian process.
result The resulting model is asymptotically maximally uncertain far from the data.

Despite their prevalence in neural networks we still lack a thorough theoretical characterization of ReLU layers. This paper aims to further our understanding of ReLU layers by studying how the activation function ReLU interacts with the linear component of the layer and what role this interaction plays in the success …

2018-12-06abs ↗pdf ↗

Gradient descent converges to minimum Bayes risk for two-layer ReLU networks in mean field regime.

problem Training two-layer ReLU networks using gradient descent in the mean field regime.
method Describes a condition for convergence to minimum Bayes risk, extending previous results to ReLU-activated networks.
result The condition for convergence does not depend on initialization and concerns weak convergence of network realization.