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

2735468181,091 · Jun 202019922001200920172026
48 results for Wide Residual Networks

Wide residual networks generalize well with uniform convergence to RNTK as width increases.

problem Understanding the generalization ability of wide residual networks.
method Uniform convergence of residual network kernel to residual neural tangent kernel (RNTK).
result Generalization error converges to kernel regression error with respect to RNTK.

Residual neural networks don't help overcome sampling complexity issues.

problem Learning invertible residual neural networks from samples is hard due to the curse of dimensionality.
method Investigated invertible residual neural networks and their sampling complexity.
result Invertible residual neural networks still suffer from the curse of dimensionality in sampling complexity.

Deep, wide ConvResNets can approximate functions and their smoothness.

problem Function approximation and smoothness in deep networks.
method Analyzing ConvResNets, proving their ability to approximate functions and their smoothness.
result Large ConvResNets can approximate functions and exhibit sufficient first-order smoothness.

Improved DNN calibration without sacrificing accuracy.

problem Poor calibration of over-parametrized DNNs in safety-critical applications.
method Decoupling feature extraction and classification layers, and applying Gaussian priors.
result Significant improvement in model calibration with minimal training cost.

Deep linear ResNets converge globally with certain transformations.

problem Global convergence of training deep linear ResNets.
method Gradient descent and stochastic gradient descent for training LL-hidden-layer linear ResNets.
result GD and SGD can converge to global minimum for deep linear ResNets with specific transformations.

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.

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 ↗

Normalization layers are a staple in state-of-the-art deep neural network architectures. They are widely believed to stabilize training, enable higher learning rate, accelerate convergence and improve generalization, though the reason for their effectiveness is still an active research topic. In this work, we challenge…

2019-01-27abs ↗pdf ↗

SMART-FAN-Lasso fine-tunes neural networks for high-dimensional nonparametric regression.

problem Fine-tuning neural networks for high-dimensional nonparametric regression with variable selection.
method Source-model-augmented residual tuning (SMART) framework for neural Lasso.
result SMART-FAN-Lasso achieves statistical acceleration over single-task learning under precise conditions.

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.

Convolutional Neural Networks (CNNs) filter the input data using spatial convolution operators with compact stencils. Commonly, the convolution operators couple features from all channels, which leads to immense computational cost in the training of and prediction with CNNs. To improve the efficiency of CNNs, we introd…

2019-04-15abs ↗pdf ↗

Wide Bayesian neural networks have a simpler weight posterior, leading to faster MCMC sampling.

problem Sampling from the posterior of wide Bayesian neural networks is challenging.
method Introducing repriorisation, a data-dependent reparameterisation that simplifies the posterior distribution.
result The repriorisation map accelerates MCMC sampling, achieving up to 50x higher effective sample size.

Unified learning-rate scale for CNNs and ResNets, avoiding depth imbalance.

problem Challenges in choosing an appropriate learning rate for deep networks, especially as depth increases.
method Introduces Arithmetic-Mean μμP (AM-μμP), constraining network-wide average pre-activation second moment to a constant scale, combined with residual-aware He fan-in initialization.
result Demonstrates a 3/2-3/2 scaling law for learning rates across depths, enabling zero-shot learning-rate transfer.

Wide hidden layer TCM nets capacity analyzed using RDT and fl RDT.

problem Capacity analysis of wide hidden layer TCM nets.
method Employed Fully Lifted Random Duality Theory (fl RDT) for capacity characterization.
result Explicit, closed form capacity characterizations for a generic class of hidden layer activations.

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.

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.

Analyzes dynamics of quantum neural networks, predicting exponential decay of training error.

problem Understanding convergence rate of quantum neural networks training.
method Analytic theory for gradient descent dynamics of wide quantum neural networks.
result Simple analytic formula predicts exponential decay of training error.

Wide neural networks learn features under μμP, identifying weights and decomposing support.

problem Feature learning in wide neural networks under μμP.
method Proving mean-field limit, characterizing identifiability, sparse-dictionary decomposition, and feature-learning-error decomposition.
result The triple (w,Dorb,S)(w^*, D^*_{\mathrm{orb}}, S^*) identifies the natural learning cell of the architecture-data pair (σ,ρ)(σ, ρ).

Time-aware deep learning methods improve spatial downscaling of atmospheric pollutants.

problem Transform coarse satellite data of atmospheric pollutants into high-resolution fields.
method Super-resolution deep residual networks and UNet architectures are extended with a temporal module encoding observation time.
result Temporal modules significantly improve downscaling performance and convergence speed.

Proposes a neural network method to correct residual distortions in coordinate transformations.

problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.

A new algorithm estimates output ranges for deep neural networks efficiently.

problem Estimating output ranges in deep neural networks with complex non-linearities.
method Integrates Simulated Annealing tailored for constrained domains and global optima.
result Guaranteed convergence and robust performance across various DNN architectures.

This paper studies deep learning methodologies for portfolio optimization in the US equities market. We present a novel residual switching network that can automatically sense changes in market regimes and switch between momentum and reversal predictors accordingly. The residual switching network architecture combines …

2019-10-16abs ↗pdf ↗

We conduct mathematical analysis on the effect of batch normalization (BN) on gradient backpropogation in residual network training, which is believed to play a critical role in addressing the gradient vanishing/explosion problem, in this work. By analyzing the mean and variance behavior of the input and the gradient i…

2018-12-02abs ↗pdf ↗

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.

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.

Residual networks with block width max(d_x, d_y) approximate all functions.

problem Achieving universal approximation with residual networks.
method Established bounds on block width for different activation functions.
result Minimum block width for universal approximation is max(d_x, d_y) with inner width 1.

Residual networks with depthwise hyperparameter scaling transfer optimal hyperparameters across width and depth.

problem The challenge of hyperparameter tuning in deep learning, especially for large models.
method Combining μμP parameterization with residual networks having a residual branch scale of 1/extdepth1/\sqrt{ ext{depth}}.
result Optimal hyperparameters transfer across width and depth in residual networks trained with this parameterization.

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.

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 ↗

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.

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.

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.

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.

While training error of most deep neural networks degrades as the depth of the network increases, residual networks appear to be an exception. We show that the main reason for this is the Lyapunov stability of the gradient descent algorithm: for an arbitrarily chosen step size, the equilibria of the gradient descent ar…

2018-03-22abs ↗pdf ↗