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

Trend · papers per month

81162242323 · Jun 202019922001200920172026
48 results for Dynamic Depth

Study on feature learning dynamics in infinite-depth neural networks, focusing on ResNets.

problem Understanding how features evolve during training in deep neural networks, especially in the large-depth limit.
method Conditional Gaussian representations and SDE system with decoupled backward weights.
result Depth-induced suppression of forward-backward coupling in infinite-depth networks, leading to a decoupled forward-backward SDE system.

Improved neural network depth-width trade-offs via dynamical systems.

problem Expressivity of neural networks in terms of depth and width.
method Connection with dynamical systems, focusing on periodic points and Lipschitz constants.
result Sharper width lower bounds for neural networks, yielding exponential depth-width separations.

Transformers can learn noisy linear systems with depth and IID data.

problem Learning noisy linear dynamical systems with transformers.
method Theoretical analysis of multi-layer and single-layer transformers with respect to L2L^2-testing loss.
result Single-layer transformers have a non-diminishing lower bound on approximation error, suggesting depth separation.

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.

Study reveals how Fisher information changes with network depth, finding it grows linearly.

problem Understanding the trainability of deep neural networks (DNNs).
method Investigates the spectral distribution of the conditional Fisher information matrix (FIM) for fully-connected networks achieving dynamical isometry.
result The conditional FIM's spectrum concentrates around the maximum and grows linearly with depth.

New connection between DNNs and Sharkovsky's Theorem for depth-width trade-offs.

problem Understanding why some functions are hard to represent by shallow ReLU networks.
method Connection to Sharkovsky's Theorem and analysis of dynamical systems.
result Lower bounds for width needed to represent periodic functions as a function of depth.

The study analyzes deep linear networks from random initialization, capturing dynamics and hyperparameter effects.

problem Understanding training dynamics in deep linear networks from random initialization.
method Theoretical analysis of gradient descent dynamics in deep linear networks with random initialization and large data.
result Captures the 'wider is better' effect and hyperparameter transfer effects, contrasting with neural-tangent parameterization.

Attention-only transformers learn from context via two stages of inference.

problem Learning from corrupted token sequences in minimal transformers.
method Two-stage empirical Bayes interpretation: kernel-weighted posterior mean and particle dynamics.
result Effective denoising without explicit noise schedules, showing posterior-mean recovery under asymptotic conditions.

This note explores the consequences of nonlinear price impact functions on price dynamics within the chartist-fundamentalist framework. Price impact functions may be nonlinear with respect to trading volume. As indicated by recent empirical studies, a given transaction may cause a large (small) price change if market d…

2004-03-30abs ↗pdf ↗

Study examines infinite limits of transformer dynamics, identifying key parameterizations.

problem Understanding the training dynamics of transformer models in the feature learning regime.
method Analysis of infinite scaling limits using dynamical mean field theory.
result Identified parameterizations that admit well-defined infinite width and depth limits.

Neural GDEs improve graph prediction by blending discrete structures and differential equations.

problem Dynamic graph prediction challenges in irregularly sampled data.
method Continuous-depth graph neural networks (GNNs) with Neural GDEs.
result Neural GDEs enhance performance across various applications.

ADMP-GNN dynamically adjusts message-passing layers for better graph learning performance.

problem Fixed message-passing steps in GNNs do not account for nodes' varying computational needs.
method Proposes ADMP-GNN, which dynamically adjusts the number of message-passing layers for each node.
result Improves performance on node classification tasks compared to baseline GNN models.

Study explores how dataset breadth and depth affect Siamese Neural Network performance.

problem Impact of dataset breadth and depth on Siamese Neural Network performance.
method Experiments with three keystroke datasets varying breadth and depth factors.
result Increasing dataset breadth improves model performance, while depth's impact varies by dataset type.

AdaEnsemble learns adaptive feature interactions for CTR prediction.

problem Learning feature interactions for CTR prediction in recommender systems and Ads ranking.
method AdaEnsemble is a Sparsely-Gated Mixture-of-Experts (SparseMoE) architecture that dynamically selects feature interaction depth.
result AdaEnsemble achieves better prediction accuracy and inference efficiency compared to state-of-the-art models.

Hypersolvers enable fast continuous-depth models for practical applications.

problem Infinite-depth models like Neural ODEs are computationally infeasible for large problems.
method Introducing hypersolvers, neural networks that solve ODEs efficiently with theoretical guarantees.
result Hypersolvers achieve comparable inference time to traditional discrete networks, making continuous-depth models practical.

New insights into GNN optimization reveal skip connections and depth accelerate training.

problem Understanding and optimizing the training of Graph Neural Networks (GNNs).
method Analysis of gradient dynamics in linearized GNNs and empirical validation.
result GNNs are implicitly accelerated by skip connections, more depth, and good label distribution during training.

Graph neural networks are extended to continuous-depth models using differential equations.

problem Improving graph neural networks for static and dynamic graph data.
method Formalizing GNNs as GDEs, blending discrete structures with differential equations.
result GDEs offer computational advantages in static settings and improved performance in dynamic settings.

Study of infinitely deep but narrow neural networks using NTK theory.

problem Analyzing the role of depth in deep learning with overparameterized networks.
method Infinite-depth limit analysis of MLP and CNN using Neural Tangent Kernel (NTK) theory.
result Established trainability guarantee for infinitely deep but narrow neural networks.

New architectures improve KANs, making them more interpretable and accurate.

problem Improving Kolmogorov-Arnold networks while maintaining interpretability.
method Overprovisioned architectures combined with sparsification, deep supervision, and depth selection, optimized with a minimum description length objective.
result Combining sparsification with depth selection achieves competitive or superior accuracy while discovering smaller models.

Study on deep multi-head self-attention dynamics, proving homogenized limits under specific scalings.

problem Understanding the behavior of deep multi-head self-attention models as depth increases.
method Random model of deep multi-head self-attention, viewing depth as time, and analyzing the residual stream as a particle system.
result Homogenized limit of the dynamics, leading to deterministic or stochastic behavior depending on scaling, with implications for representation collapse.

New method uses higher-order Langevin dynamics for efficient parallel sampling.

problem Efficient parallel sampling from high-dimensional log-concave distributions.
method Combines higher-order Langevin dynamics with blockwise Lagrange polynomial interpolation.
result Reduces the number of parallel points required for a target accuracy.

New scaling framework for MoE architectures ensures stability and optimal performance at scale.

problem Lack of principled understanding of how hyperparameters should scale in MoE architectures.
method Developed a novel Dynamical Mean Field Theory (DMFT) for three scaling regimes of MoE architectures.
result Derived Maximally Scale-Stable Parameterization (MSSP) for SGD and Adam, providing robust learning rate transfer and monotonic improvement with scale.

Uniform scaling limits in AdamW-trained transformers converge to ODEs.

problem Understanding the dynamics of large-depth transformers trained with AdamW.
method Modeling transformer dynamics as an interacting particle system coupled through attention, proving convergence to ODEs.
result The joint dynamics of hidden states and backpropagated variables converge uniformly to an ODE system.

Investigates the relationship between ResNets and Neural ODEs, quantifying their closeness and providing training methods.

problem Quantifying the distance between ResNet dynamics and Neural ODE solutions.
method Bounding the distance between hidden state trajectories and Neural ODE solutions, using gradient descent and Heun's method.
result Gradient descent and Heun's method can implicitly regularize ResNets towards Neural ODEs, especially for smooth residual functions.

Global convergence of multilayer neural networks proven for any depth.

problem Global convergence of multilayer neural networks in the mean field regime.
method Mean field limit framework, neuronal embedding, bidirectional diversity condition.
result Global convergence for multilayer networks of any depths, including correlated initializations.

We refine toxicity bounds for dynamic liquidation incentives in CP-AMM systems.

problem Ensuring stability in dynamic liquidation incentives in automated market makers.
method Derived state-dependent toxicity bounds for dynamic liquidation incentives, reconciling them with CP-AMM price dynamics.
result State-dependent bounds and liquidity-depth-only condition for dynamic liquidation incentives.

The paper studies randomized approximations of Tukey's depth for log-concave isotropic data.

problem The challenge of approximating Tukey's depth in high dimensions.
method The study examines randomized algorithms for approximating Tukey's depth for log-concave isotropic data.
result Randomized algorithms correctly approximate maximal depth and close to zero depths but not intermediate depths.