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

61122183244 · Jun 202019922001200920172026
48 results for Residual Connections

Graph neural networks suffer from oversmoothing, but adding residual connections helps.

problem Oversmoothing in deep graph neural networks where features become indistinguishable.
method Analyzed asymptotic oversmoothing rates with and without residual connections using the multiplicative ergodic theorem.
result Adding residual connections effectively mitigates or prevents oversmoothing.

Classifies connected components of meromorphic differentials with residue conditions.

problem Understanding the structure of meromorphic differentials with residue constraints.
method Analyzes the multi-scale compactification and residue conditions.
result Classified connected components of generalized strata of meromorphic differentials.

Residual connections significantly boost the performance of deep neural networks. However, there are few theoretical results that address the influence of residuals on the hypothesis complexity and the generalization ability of deep neural networks. This paper studies the influence of residual connections on the hypoth…

2019-04-02abs ↗pdf ↗

We present the Video Ladder Network (VLN) for efficiently generating future video frames. VLN is a neural encoder-decoder model augmented at all layers by both recurrent and feedforward lateral connections. At each layer, these connections form a lateral recurrent residual block, where the feedforward connection repres…

2016-12-06abs ↗pdf ↗

This paper classifies components of meromorphic differential strata.

problem Understanding the boundary of multi-scale compactification of meromorphic differentials.
method Classifying connected components of residueless meromorphic differentials.
result Classification of connected components of strata of residueless meromorphic differentials.

The paper establishes a Poisson Poincaré-Dulac theorem for Poisson-flat connections.

problem Analyzing Poisson-flat connections with logarithmic poles.
method Defining an Euler-Poisson principal part and residue theory, establishing a Poisson Poincaré-Dulac theorem.
result Any logarithmic Poisson-flat connection is holomorphically gauge equivalent to a pure Euler-Poisson normal form.

The paper establishes principles for initializing and designing GNNs with ReLU activations to avoid oversmoothing and correlation collapse.

problem Oversmoothing and correlation collapse in deep ReLU GNNs.
method The paper derives and validates three principles for initialization and architecture selection in finite width graph neural networks with ReLU activations.
result Correct initialization, residual aggregation operators, and residual connections significantly improve early training dynamics in deep ReLU GNNs.

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 ↗

New findings show mapping class groups of certain high-dimensional manifolds are not residually finite.

problem Understanding the mapping class groups of simply connected high-dimensional manifolds.
method Provided a counterexample showing mapping class groups are not residually finite.
result Mapping class groups of some high-dimensional manifolds are not residually finite.

Gradient oversmoothing and expansion hinder deep GNN training, solved with normalization.

problem Gradient oversmoothing and expansion prevent deep GNN training.
method Proposed normalization method to constrain the Lipschitz bound of each layer.
result Residual GNNs with hundreds of layers can be efficiently trained with the proposed normalization.

Theoretical limits of deep residual networks show consistent covariance structures.

problem Understanding the limits of deep residual networks.
method Analyzing the behavior of deep residual networks with skip connections as width and depth approach infinity.
result Theoretical analysis confirms that the covariance structure remains consistent regardless of the order of width and depth.

Due to the success of residual networks (resnets) and related architectures, shortcut connections have quickly become standard tools for building convolutional neural networks. The explanations in the literature for the apparent effectiveness of shortcuts are varied and often contradictory. We hypothesize that shortcut…

2018-06-01abs ↗pdf ↗

Residually finite groups found in manifold automorphisms.

problem Residual finiteness of automorphism groups of high-dimensional manifolds.
method Embedding calculus, Weiss fibre sequence, convergence of embedding calculus tower, smoothing theory.
result Topological mapping class group of high-dimensional manifolds is residually finite.

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 ↗

Using the Wodzicki residue, we build Wodzicki-Chern-Simons (WCS) classes in H2k1(LM)H^{2k-1}(LM) associated to the residue Chern character on the loop space LMLM of a Riemannian manifold M2k1M^{2k-1}. These WCS classes are associated to the L2L^2 connection and the Sobolev s=1s=1 connections on LM.LM. The WCS classes detect seve…

2014-07-09abs ↗pdf ↗

Researchers prove Transformers are Turing-complete and analyze their components.

problem Understanding the computational power and limitations of Transformers.
method Analyzed Turing-completeness of vanilla and modified Transformers, and necessity of components.
result Transformers with positional masking and positional encodings are Turing-complete.

The study examines Hopfian properties of conjugation quandles and their underlying groups.

problem Understanding the relationship between Hopfian properties of conjugation quandles and their underlying groups.
method Examined Hopfian and residual finiteness properties of conjugation quandles of specific groups.
result Conjugation quandles of Baumslag-Solitar groups are infinitely generated and not necessarily Hopfian.

The study proves residual finiteness for certain lattice extensions and negatively curved projective varieties.

problem Residual finiteness of central extensions of arithmetic lattices in PU(n,1).
method General theorem on residual finiteness of extensions with characteristic class in span of Poincaré duals to totally geodesic divisors.
result Residual finiteness of central extensions for congruence lattices in PU(n,1) for n ≥ 4.

RDL-Net improves speech enhancement with fewer parameters and better performance.

problem Improving speech enhancement with fewer parameters and better performance.
method Proposes RDL-Net, a CNN combining residual and dense aggregations without over-allocating parameters.
result RDL-Net achieves higher speech enhancement performance with fewer parameters and lower computational requirements.

We show that Residual Networks (ResNet) is equivalent to boosting feature representation, without any modification to the underlying ResNet training algorithm. A regret bound based on Online Gradient Boosting theory is proved and suggests that ResNet could achieve Online Gradient Boosting regret bounds through neural n…

2019-09-25abs ↗pdf ↗

New method diagnoses criticality in deep neural networks, improving performance.

problem Improving theoretical understanding and practical initialization of deep neural networks.
method Introducing partial Jacobians and deriving recurrence relations for their norms to analyze criticality.
result Proper stacking of LayerNorm and residual connections leads to a critical architecture for any initialization.

We discuss dense embeddings of surface groups and fully residually free groups in topological groups. We show that a compact topological group contains a nonabelian dense free group of finite rank if and only if it contains a dense surface group. Also, we obtain a characterization of those Lie groups which admit a dens…

2006-02-27abs ↗pdf ↗

We identify and study two common failure modes for early training in deep ReLU nets. For each we give a rigorous proof of when it occurs and how to avoid it, for fully connected and residual architectures. The first failure mode, exploding/vanishing mean activation length, can be avoided by initializing weights from a …

2018-03-05abs ↗pdf ↗

Paper introduces a new multilinear functional for spectral triples and computes its properties.

problem Computing properties of spectral triples and their associated Hodge operators.
method Introduces a new multilinear functional for spectral triples and computes its properties using noncommutative residue and perturbed de-Rham Hodge operators.
result Recover two forms, torsion of the linear connection, and four forms by the noncommutative residue and perturbed de-Rham Hodge Dirac triple.

We add size factor to CAPM and normalize residuals by Volatility Index.

problem Capturing the size effect in CAPM and making residuals Gaussian.
method Insert size effect, normalize residuals by Volatility Index, and fit model to real-world data.
result The new model shows long-term stability and connects to Stochastic Portfolio Theory.

Residual networks (ResNets) are a deep learning architecture that substantially improved the state of the art performance in certain supervised learning tasks. Since then, they have received continuously growing attention. ResNets have a recursive structure xk+1=xk+Rk(xk)x_{k+1} = x_k + R_k(x_k) where RkR_k is a neural network cal…

2019-10-21abs ↗pdf ↗

In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …

2017-03-30abs ↗pdf ↗

On a complex curve, we establish a correspondence between integrable connections with irregular singularities, and Higgs bundles such that the Higgs field is meromorphic with poles of any order. The moduli spaces of these objects are obtained by fixing at each singularity the polar part of the connection. We prove that…

2001-11-08abs ↗pdf ↗

In this work, we propose a deep neural network architecture motivated by primal-dual splitting methods from convex optimization. We show theoretically that there exists a close relation between the derived architecture and residual networks, and further investigate this connection in numerical experiments. Moreover, we…

2018-06-15abs ↗pdf ↗

Nontrivial connectivity has allowed the training of very deep networks by addressing the problem of vanishing gradients and offering a more efficient method of reusing parameters. In this paper we make a comparison between residual networks, densely-connected networks and highway networks on an image classification tas…

2017-11-28abs ↗pdf ↗