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

10192938 · Feb 202019922001200920172026
48 results for Leaky ResNets

Machine learning classifies topological phases in leaky photonic lattices.

problem Classifying topological phases in leaky photonic lattices using limited data.
method A fully connected neural network trained on bulk intensity measurements.
result Accurate determination of topological properties from intensity distributions.

New insights into how linear classifiers and leaky ReLU networks can overfit without harming generalization.

problem Understanding conditions for benign overfitting in linear classifiers and leaky ReLU networks.
method Utilizing Karush--Kuhn--Tucker (KKT) conditions for margin maximization.
result Satisfaction of KKT conditions leads to benign overfitting in linear classifiers and leaky ReLU networks.

Study on benign overfitting in leaky ReLUs with moderate input dimensions.

problem Understanding when overfitting is beneficial in neural networks.
method Two-layer leaky ReLU networks trained with hinge loss, considering signal-to-noise ratio.
result Characterization of conditions for benign overfitting based on signal-to-noise ratio.

Leaky ReLU activations improve the calibration of Bayesian neural networks.

problem Bayesian neural networks struggle with mean-field variational inference for ReLU activations.
method Investigated the effect of activation functions on the calibration of Bayesian neural networks.
result Leaky ReLU activations lead to more Gaussian-like weight posteriors and lower expected calibration error.

New methods for uncertainty in neural networks with leaky ReLU activations.

problem Uncertainty in feed-forward neural networks with random input perturbations.
method Analytical expressions for PDF and moments of neural network output, linearization of leaky ReLU, Gaussian copula surrogate models.
result Accurate statistical results for large input perturbations, excellent agreement with Monte Carlo simulations.

We propose Mish\textit{Mish}, a novel self-regularized non-monotonic activation function which can be mathematically defined as: f(x)=xtanh(softplus(x))f(x)=x\tanh(softplus(x)). As activation functions play a crucial role in the performance and training dynamics in neural networks, we validated experimentally on several well-known benchmarks…

2019-08-23abs ↗pdf ↗

In this paper we investigate the performance of different types of rectified activation functions in convolutional neural network: standard rectified linear unit (ReLU), leaky rectified linear unit (Leaky ReLU), parametric rectified linear unit (PReLU) and a new randomized leaky rectified linear units (RReLU). We evalu…

2015-05-05abs ↗pdf ↗

Gradient descent biases towards stable rank networks for nearly-orthogonal data.

problem Understanding implicit bias in non-smooth neural networks trained by gradient descent.
method Analysis of two-layer ReLU and leaky ReLU networks trained by gradient descent on nearly-orthogonal data.
result Gradient descent biases towards networks with stable rank and uniform margin for nearly-orthogonal data.

This study investigates how gradient-based methods bias neural networks trained on high-dimensional data.

problem The implicit biases of gradient-based optimization algorithms in neural networks trained on high-dimensional data.
method Investigation of gradient flow and gradient descent in two-layer fully-connected neural networks with leaky ReLU activations.
result Gradient flow and gradient descent lead to neural networks with low-rank solutions and linear decision boundaries.

Residual networks (ResNets) have recently achieved state-of-the-art on challenging computer vision tasks. We introduce Resnet in Resnet (RiR): a deep dual-stream architecture that generalizes ResNets and standard CNNs and is easily implemented with no computational overhead. RiR consistently improves performance over R…

2016-03-25abs ↗pdf ↗

Stable ResNet stabilizes gradients in deep networks.

problem Gradient vanishing and exploding in deep ResNet architectures.
method Introducing Stable ResNet architectures with gradient stabilization and infinite depth expressivity.
result Stable ResNet maintains gradient stability and expressivity in deep networks.

This study uses neural networks to solve interpolation problems with sparse, infinitely wide layers.

problem Exact data interpolation using sparse, infinitely wide neural networks.
method Atomic norm framework to derive convex hulls and equivalent convex formulations.
result Simple characterizations of convex hulls for different constraints on network weights and biases.

Early training of deep neural networks leads to small, directionally converging weights.

problem Training dynamics of deep homogeneous neural networks with small initializations.
method Gradient flow analysis and study of KKT points for neural correlation function.
result Weights converge in direction to KKT points during early training stages.

ResNets and their GP generalization align ideas via function space warping, revealing robust properties and connections to image registration.

problem Aligning abstract shapes (ideas) using neural networks.
method Introducing a generalization of ResNets as a GP, showing convergence to image registration variational algorithms, and revealing properties via a Hamiltonian interpretation.
result ResNets and their GP generalization align ideas via function space warping, revealing robust properties and connections to image registration.

Deep residual networks (ResNets) and their variants are widely used in many computer vision applications and natural language processing tasks. However, the theoretical principles for designing and training ResNets are still not fully understood. Recently, several points of view have emerged to try to interpret ResNet …

2017-10-27abs ↗pdf ↗

Universal approximation for ODENet and ResNet with a single activation function.

problem Approximating complex dynamical systems with limited vector fields.
method Examined ODENet and ResNet with vector fields composed of a single activation function and affine mapping.
result ODENet and ResNet with restricted vector fields can uniformly approximate those with general vector fields.

Residual Network (ResNet) is the state-of-the-art architecture that realizes successful training of really deep neural network. It is also known that good weight initialization of neural network avoids problem of vanishing/exploding gradients. In this paper, simplified models of ResNets are analyzed. We argue that good…

2017-09-09abs ↗pdf ↗

We study the stability and convergence of training deep ResNets with gradient descent. Specifically, we show that the parametric branch in the residual block should be scaled down by a factor τ=O(1/L)τ=O(1/\sqrt{L}) to guarantee stable forward/backward process, where LL is the number of residual blocks. Moreover, we establi…

2019-03-17abs ↗pdf ↗

In this paper, we aim to understand Residual Network (ResNet) in a scientifically sound way by providing a bridge between ResNet and Feynman path integral. In particular, we prove that the effect of residual block is equivalent to partial differential equation, and the ResNet transforming process can be equivalently co…

2019-04-16abs ↗pdf ↗

Recent results in the literature indicate that a residual network (ResNet) composed of a single residual block outperforms linear predictors, in the sense that all local minima in its optimization landscape are at least as good as the best linear predictor. However, these results are limited to a single residual block …

2019-07-09abs ↗pdf ↗

Gradient descent finds global optima in ResNets with sufficient parameters.

problem Finding optimal parameters in ResNet models.
method Mean-field analysis and gradient-flow PDE to study convergence of first-order optimization methods.
result First-order methods can find global minimizers in overparameterized ResNets.

Residual Neural Networks (ResNets) achieve state-of-the-art performance in many computer vision problems. Compared to plain networks without residual connections (PlnNets), ResNets train faster, generalize better, and suffer less from the so-called degradation problem. We introduce simplified (but still nonlinear) vers…

2019-05-27abs ↗pdf ↗

ResNets approximate log-Gaussian at initialization, improving network performance.

problem Understanding the initialization behavior of deep neural networks like ResNets.
method Analyzing ReLU ResNets in the infinite-depth-and-width limit, showing log-Gaussian behavior.
result ResNets at initialization exhibit hypoactivation and interlayer correlations, which are not captured by Gaussian limits.

This paper extends ResNet theory to infinitely deep networks, linking them to diffusion processes.

problem Training infinitely deep ResNets with i.i.d. initializations leads to undesirable properties.
method Introduced doubly infinite ResNets with i.i.d. initializations, linking to diffusion processes.
result The dynamics of quantities of interest converge to deterministic limits in the limit of infinite depth.

This paper explains why ResNets generalize better than FFNets using neural tangent kernels.

problem Understanding why deep ResNets generalize better than deep FFNets.
method Using neural tangent kernels to compare the learnability of functions induced by the kernels of ResNets and FFNets.
result The kernel of ResNets does not exhibit degeneracy as depth increases, unlike FFNets.

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 ↗

New method stabilizes deep neural networks by setting Lyapunov exponent to zero.

problem Stability issues in deep neural networks with low width.
method Lyapunov initialization method to set Lyapunov exponent to zero.
result Lyapunov exponent governs stability of deep networks; standard methods fail for low width.