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

Trend · papers per month

168335503670 · Jun 202019922001200920172026
48 results for dynamic feature 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.

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.

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.

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.

Researchers quantify the relationship between feature depth and performance in deep neural networks.

problem Understanding how depth affects feature extraction and generalization in deep neural networks.
method Adaptive analysis of feature-depth trade-offs in deep nets, proving optimal generalization performance.
result Optimal generalization performance achieved through empirical risk minimization on deep nets.

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.

Study links neural network inductive bias, feature learning, and generalization on Boolean functions.

problem Understanding how neural networks learn and generalize on Boolean data.
method End-to-end analysis of depth-2 discrete fully connected networks and DNF formulas, using Monte Carlo learning.
result Predictable training dynamics and interpretable features emerge, linking inductive bias and generalization.

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.

This paper improves neural network generalization by dynamically learning kernel parameters.

problem Improving neural network generalization and adaptability.
method Diagonal adaptive kernel model that learns kernel eigenvalues and output coefficients during training.
result The diagonal adaptive kernel model significantly improves generalization over fixed-kernel methods.

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.

Aux-Net model handles dynamic systems with inconsistent inputs.

problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.

DFR models dynamic distributional data with weighted Fréchet means.

problem Regression of distribution-valued responses over time.
method Dynamic Fréchet Regression (DFR) with index-aware weighting and feature selection.
result Improved predictive accuracy and feature recovery over existing methods.

Unified spectral framework for μP under joint width-depth scaling.

problem Challenges in stable feature learning and HP transfer for width-depth scaled models.
method Developed a simple and unified spectral framework for μP under joint width-depth scaling.
result Unified and generalized μP formulation for practical architectures with multi-transformation branches.

Neural network models have a reputation for being black boxes. We propose to monitor the features at every layer of a model and measure how suitable they are for classification. We use linear classifiers, which we refer to as "probes", trained entirely independently of the model itself. This helps us better understand …

2016-10-05abs ↗pdf ↗

A new data-level recombination strategy improves RGB-D salient object detection.

problem RGB-D salient object detection struggles with depth information.
method Proposes a novel data-level recombination strategy to fuse RGB and depth data before feature extraction.
result Achieves a new state-of-the-art performance in RGB-D salient object detection.

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 of urban lifestyles from mobility data of 1.2M people in 11 U.S. cities.

problem Lack of interpretability in digital mobility data for understanding urban lifestyles.
method Privacy-enhanced dataset of mobility visitation patterns, latent activity behavior decomposition.
result Detected 12 latent activity behaviors that describe urban lifestyles, not single lifestyles.

Defines complexity measure for neural networks and feature representations, revealing scaling patterns.

problem Understanding the nonlinearity and dimensionality of neural network computations and feature representations.
method Introduces complexity and effective dimension measures, investigates their dynamics during training, and analyzes their scaling properties.
result Power law scaling of complexity and effective dimension during training, revealing hidden structure of datasets.

Continuous deep learning architectures have recently re-emerged as Neural Ordinary Differential Equations (Neural ODEs). This infinite-depth approach theoretically bridges the gap between deep learning and dynamical systems, offering a novel perspective. However, deciphering the inner working of these models is still a…

2020-02-19abs ↗pdf ↗

Neural networks' feature geometry evolves like discrete Ricci flow.

problem Understanding neural feature representations and their geometric transformations.
method Approximating input manifold with geometric graphs and analyzing their evolution during training.
result Neural feature geometry evolves like discrete Ricci flow, with nonlinear activations playing a crucial role.

Analysis of deep neural networks under various learning rules reveals dynamics of feature and prediction learning.

problem Understanding how different learning rules affect feature and prediction dynamics in deep neural networks.
method Analysis of infinite-width deep networks trained with gradient descent and various learning rules.
result The evolution of the output function is governed by an effective neural tangent kernel (eNTK), which varies depending on the learning rule and training regime.

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.

We investigated the feature map inside deep neural networks (DNNs) by tracking the transport map. We are interested in the role of depth (why do DNNs perform better than shallow models?) and the interpretation of DNNs (what do intermediate layers do?) Despite the rapid development in their application, DNNs remain anal…

2016-05-10abs ↗pdf ↗

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.

We prove the precise scaling, at finite depth and width, for the mean and variance of the neural tangent kernel (NTK) in a randomly initialized ReLU network. The standard deviation is exponential in the ratio of network depth to width. Thus, even in the limit of infinite overparameterization, the NTK is not determinist…

2019-09-13abs ↗pdf ↗

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.

Large neural networks learn low-dimensional representations that balance complexity and regularity.

problem Understanding the tradeoff between low-dimensional representations and complexity in deep neural networks.
method Computed finite depth corrections to reveal a measure of regularity that bounds the pseudo-determinant of the Jacobian.
result Proved the conjectured bottleneck structure in learned features as network depth increases, showing almost all hidden representations are approximately low-dimensional and weight matrices have singular values close to 1.

New approach to abstract neural network representations using renormalization group.

problem Developing truly abstract representations in neural networks.
method Renormalization group approach to expand representations to encompass broader data sets.
result Representations in neural networks become more abstract as data breadth increases and depth increases.

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.