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

1.2%2.3%3.5%4.7% · Dec 201819922001200920172026
48 results for resnet autoencoder

Adversarial attack methods have demonstrated the fragility of deep neural networks. Their imperceptible perturbations are frequently able fool classifiers into potentially dangerous misclassifications. We propose a novel way to interpret adversarial perturbations in terms of the effective input signal that classifiers …

2018-03-21abs ↗pdf ↗

The method learns disentangled representations for localized image manipulations.

problem Image generating neural networks are viewed as black boxes with global effects.
method Localized ResNet Autoencoder with multiple loss functions.
result The network can transfer specific facial attributes like shape and color of eyes, hair, mouth, etc. between persons.

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.

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.

Neural ODEs and i-ResNets can't approximate all continuous invertible functions.

problem Neural ODEs and i-ResNets' limitations in approximating continuous invertible functions.
method Proving the approximation capabilities of Neural ODEs and i-ResNets.
result Neural ODEs and i-ResNets can approximate homeomorphisms on a p-dimensional Euclidean space.

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 ↗

Residual Networks (ResNets) have become state-of-the-art models in deep learning and several theoretical studies have been devoted to understanding why ResNet works so well. One attractive viewpoint on ResNet is that it is optimizing the risk in a functional space by combining an ensemble of effective features. In this…

2018-02-25abs ↗pdf ↗

Shortcut connections in ResNet help avoid local optima, leading to efficient training.

problem Understanding why shortcut connections in ResNet lead to efficient training.
method Two-layer non-overlapping convolutional ResNet, gradient descent with proper normalization.
result Gradient descent avoids spurious local optima, converging to a global optimum.

Hybrid ResNet and RMT improve covariance matrix estimation for cryptocurrency portfolios.

problem Noisy, non-Gaussian financial data leads to unstable covariance matrices.
method Combines RMT regularization and ResNet learning for data-driven corrections.
result Hybrid estimator outperforms traditional methods in portfolio optimization.

An adaptive time-stepping controller improves stability and accuracy of ResNets.

problem Improving stability and performance of ResNets using adaptive time stepping.
method Developed an adaptive time-stepping controller based on Runge-Kutta-Fehlberg method.
result Demonstrated improved stability and accuracy of ResNets without additional overhead.

ResNets and DenseNets converge to NTK with depth and width, offering advantages for kernel regression.

problem Understanding convergence of ResNets and DenseNets to Neural Tangent Kernel (NTK).
method Analysis of finite width and depth corrections for NTK of ResNets and DenseNets.
result ResNets and DenseNets can converge to NTK with depth and width, unlike vanilla networks.

UDENet and ResNet can approximate any function, with ODENet showing UAP for continuous functions.

problem Approximating any function using ODENet and ResNet.
method Proved UAP for ODENet and ResNet, derived gradient, and applied to various problems.
result UDENet and ResNet can approximate any function, with ODENet showing UAP for continuous functions.