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

Trend · papers per month

4088161,2241,632 · Jun 202019922001200920172026
48 results for deep residual learning

Deep residual networks trained with gradient descent have small generalization gap.

problem Limited theoretical understanding of why residual networks generalize well.
method Analyzing overparameterized deep residual networks trained by gradient descent.
result Demonstrates that residual networks have a small generalization gap between training and test error.

Deep learning for HJB PDEs using synthetic data and residual minimization.

problem Solving Hamilton-Jacobi-Bellman PDEs for optimal control problems.
method Gradient-augmented synthetic dataset for supervised learning, residual minimization.
result Improves accuracy and efficiency of deep learning for HJB PDEs.

Generalization bounds derived for neural ODEs and deep residual networks.

problem Understanding the generalization capability of neural ODEs and deep residual networks.
method Lipschitz-based argument and analogy with deep residual networks.
result A generalization bound involving the magnitude of weight matrix differences.

Deep learning networks are approximated using dynamical systems theory.

problem Understanding the approximation capabilities of deep learning networks.
method Modeling deep residual networks as continuous-time dynamical systems and using approximation theories in LpL^p.
result Established general sufficient conditions for universal approximation of deep residual networks.

ResGCN detects anomalies in attributed networks by capturing sparsity and nonlinearity.

problem Detecting anomalous nodes in attributed networks.
method Attention-based deep residual modeling using Graph Convolutional Networks.
result ResGCN effectively detects anomalies in attributed networks.

This research improves asset life prediction by integrating deep learning with mixture distributions.

problem Predicting residual useful life for assets with multiple failure modes.
method Integrates mixture (log)-location-scale distribution with deep learning.
result Proposed models outperform existing methods in predicting residual useful life.

A new network learns market conditions and predicts stock performance.

problem Optimizing stock portfolio performance in the US equities market.
method Residual Switching Network combining two ResNets: a switching module and a main module.
result The residual switching network strategy outperformed other models with an average annual Sharpe ratio of 2.22.

We revisit residual algorithms in both model-free and model-based reinforcement learning settings. We propose the bidirectional target network technique to stabilize residual algorithms, yielding a residual version of DDPG that significantly outperforms vanilla DDPG in the DeepMind Control Suite benchmark. Moreover, we…

2019-05-03abs ↗pdf ↗

SRFRN accelerates image super-resolution using shallow residual units.

problem High computational complexity and time in deep learning image super-resolution.
method SRFRN uses a bicubic interpolated low-resolution image and residual representative units (RFR) for faster and more efficient high-resolution image reconstruction.
result SRFRN achieves superior performance and faster execution time compared to existing methods.

New measure assesses deep neural networks' robustness to adversarial attacks.

problem Deep learning's fragility to adversarial attacks limits its adoption in mission-critical applications.
method Introduces residual error as a new performance measure for assessing adversarial robustness.
result Demonstrates effectiveness of residual error in assessing robustness of deep neural networks.

Adaptive weights improve physics-informed neural networks and deep operator networks.

problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Study proposes a new method for deep portfolio optimization using residual factors.

problem Non-stationary financial market makes traditional machine learning methods ineffective.
method Predict distribution of residual factors using a novel neural network architecture with financial inductive biases.
result Demonstrated improved performance on U.S. and Japanese stock market data.

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.

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.

An emerging design principle in deep learning is that each layer of a deep artificial neural network should be able to easily express the identity transformation. This idea not only motivated various normalization techniques, such as \emph{batch normalization}, but was also key to the immense success of \emph{residual …

2016-11-14abs ↗pdf ↗

Study shows how deep residual networks can be analyzed as shallow network ensembles for optimization.

problem Understanding why deep neural networks can be trained to zero loss despite non-convex optimization landscapes.
method Mean-field analysis of deep residual networks, focusing on their continuum limit as a two-layer network.
result Derives the first global convergence result for multilayer neural networks in the mean-field regime.

Deep residual networks can approximate any continuous function using control theory.

problem Universal approximation capabilities of deep residual neural networks.
method Relating residual networks to control systems and using Lie algebraic techniques.
result Deep residual networks with adequately deep layers can approximate any continuous function on a compact set.

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.

DAS-PINNs uses deep learning to solve complex PDEs more accurately.

problem Solving high-dimensional PDEs with high accuracy.
method Deep neural networks and generative models for adaptive sampling.
result DAS-PINNs significantly improves solution accuracy for low regularity and high-dimensional problems.

RKD improves model compression by distilling residual knowledge from a deep teacher model.

problem Performance degradation due to the gap between student and teacher models.
method Introduces an assistant model to distill residual knowledge from the teacher model.
result RKD achieves better results on popular classification datasets than state-of-the-art methods.

CEFOL uses deep learning for dynamic programming with recursive utility.

problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.

GResNet tackles suspended animation in deep GNNs by adding extensive connections.

problem Performance degradation of deep GNNs, especially spectral-based models.
method Introducing GResNet framework with extensively connected highways.
result Avoids dramatic changes to node representations between layers, enhancing learnability.

Proposes a framework for quantifying aleatoric uncertainty in image restoration.

problem Quantifying aleatoric uncertainty in image restoration problems.
method Divides conditional probability modeling into deterministic and stochastic levels, enabling efficient sampling and regularization.
result Shows significant potential in giving state-of-the-art point estimates and associated uncertainty information.

IRNet improves material property prediction from composition and crystal structure.

problem Predicting material properties from composition and crystal structure.
method Deep residual regression network with individual residual learning.
result IRNet outperforms state-of-the-art machine learning approaches in predicting material properties.

Gradient descent converges to global minima for ResNets with linearly scaled width.

problem Understanding the convergence of deep residual networks with varying network width and dataset size.
method Analyzing the Jacobian of ResNets and applying gradient descent for quadratic loss.
result Gradient descent converges to global minima for ResNets with linearly scaled width and independent of depth.

D2SRM solves complex PDEs using deep learning.

problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.

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 ↗