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

96192287383 · Jun 202019922001200920172026
48 results for initial scale

Study reveals how initialization scale affects training accuracy in linear networks.

problem Understanding implicit bias in linear classification models.
method Asymptotic analysis of gradient flow trajectories and training loss minimization.
result Implicit bias is more complex at reasonable initialization scales and training accuracies.

Two new scalable K-means initialization methods proposed for large-scale clustering.

problem Efficient initialization for large-scale clustering problems.
method Divide-and-conquer approach and random projection method for multiple lower-dimensional subspaces.
result The proposed methods outperform state-of-the-art in large-scale clustering tasks.

Changing initialization scale affects deep model generalization, leading to memorization or improved performance.

problem Understanding how initialization scale impacts deep model generalization and memorization.
method Experimental setup with varying initialization scales, analysis of activation and loss functions, and development of an alignment measure.
result Increasing initialization scale leads to memorization, and decreasing it improves generalization, depending on activation and loss functions.

One of the difficulties of training deep neural networks is caused by improper scaling between layers. Scaling issues introduce exploding / gradient problems, and have typically been addressed by careful scale-preserving initialization. We investigate the value of preserving scale, or isometry, beyond the initial weigh…

2016-04-26abs ↗pdf ↗

New method trains shallow neural networks with subquadratic width scaling.

problem Training shallow neural networks with optimal width scaling.
method Polyak-Lojasiewicz condition, smoothness, standard data assumptions, random matrix theory.
result Subquadratic scaling on network width with standard initialization strategies.

Constructs initial data leading to apparent horizons and tests Penrose Inequality.

problem Testing Penrose Inequality in dynamical spacetimes.
method Scale critical initial data for Einstein vacuum system, constructing Cauchy data.
result Penrose Inequality holds in an open region of the future of initial data.

This paper presents a phase diagram for two-layer neural networks under different initialization scales.

problem Understanding the behavior of neural networks under varying scales of initialization.
method Analysis of a phase diagram for two-layer neural networks.
result Condensation of weight vectors on isolated orientations during training.

We develop a gluing construction which adds scaled and truncated asymptotically Euclidean solutions of the Einstein constraint equations to compact solutions with potentially non-trivial cosmological constants. The result is a one-parameter family of initial data which has ordinary and scaled "point-particle" limits an…

2009-08-12abs ↗pdf ↗

Initializing the weights and the biases is a key part of the training process of a neural network. Unlike the subsequent optimization phase, however, the initialization phase has gained only limited attention in the literature. In this paper we discuss some consequences of commonly used initialization strategies for va…

2019-03-27abs ↗pdf ↗

Two-layer CNNs can overfit well if initialized correctly.

problem Understanding the conditions for benign overfitting in over-parameterized CNNs.
method Extending analysis to fully trainable two-layer CNNs, examining initialization scaling effects.
result Initialization scaling of the output layer is crucial; large scales lead to fixed output behavior, small scales to complex interactions.

The paper develops a theory linking pretraining and fine-tuning in neural networks.

problem Understanding how initialization choices impact feature learning and generalization in neural networks.
method Analytical theory of diagonal linear networks, deriving generalization error as a function of initialization parameters and task statistics.
result Different initialization choices place networks into four fine-tuning regimes with varying abilities to support feature learning and generalization.

Scale-free distributions and correlation functions found in financial data are reminiscent of the scale invariance of physical observables in the vicinity of a critical point. Here, we present empirical evidence for a transition phenomenon, accompanied by a symmetry breaking, in the investors' demand for stocks. We stu…

2001-11-19abs ↗pdf ↗

Model shows feature learning can improve neural scaling laws for hard tasks.

problem Understanding and improving neural network scaling laws for various task difficulties.
method Developed a solvable model of neural scaling laws, identified three scaling regimes, and demonstrated feature learning's impact on scaling exponents.
result Feature learning can improve scaling with training time and compute for hard tasks, nearly doubling the exponent.

Paper introduces scalable clustering for large datasets with outliers.

problem Lack of scalable algorithms for large datasets with outliers.
method Provable robust clustering algorithm based on loss minimization for Gaussian mixture models.
result Algorithm provides high accuracy with theoretical guarantees and outperforms existing methods.

LEMON uses pre-trained models to scale neural networks efficiently.

problem Efficiency in scaling deep neural networks, especially Transformers, which are resource-intensive to train from scratch.
method LEMON initializes scaled models using pre-trained weights and optimizes learning rates.
result Significant reduction in training time and computational costs for Vision Transformers and BERT.

Public debt is one of the important economic variables that quantitatively describes a nation's economy. Because bankruptcy is a risk faced even by institutions as large as governments (e.g. Iceland), national debt should be strictly controlled with respect to national wealth. Also, the problem of eliminating extreme p…

2010-02-12abs ↗pdf ↗

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.

FibeRed reduces complex data dimensions while preserving topology.

problem Hard embedding of topologically complex datasets in low-dimensional Euclidean space.
method Modeling datasets with vector bundles, reducing fibers while preserving topology.
result FibeRed learns topologically faithful embeddings in lower dimensions than existing methods.

Deep linear networks minimize sharpness, avoiding large eigenvalues.

problem Understanding optimization dynamics in deep linear networks for regression.
method Analyzing sharpness (largest eigenvalue of Hessian) of minimizers and gradient flow solutions.
result Gradient flow implicitly regularizes towards flat minima, with sharpness bounded by a constant.

Scaling ResNets requires careful consideration of the layer depth and output scaling factors.

problem Avoiding vanishing or exploding gradients in deep ResNets as depth increases.
method Probabilistic analysis and continuous-time limit interpretation of ResNets.
result The optimal scaling factor is αL=1Lα_L = \frac{1}{\sqrt{L}} for standard i.i.d. initializations.

Proves long-time Ricci flow existence and topological rigidity for pinched integral curvature manifolds.

problem Proving long-time existence and topological rigidity for manifolds with pinched scale-invariant integral curvature.
method Proves long-time existence of Ricci flow for manifolds with bounded curvature and pinched scale-invariant integral curvature, converging to a flat metric.
result Flow converges to a flat metric, implying topological rigidity of the manifold.

New framework for understanding infinite-width neural networks.

problem Understanding the infinite-width limit behavior of neural networks.
method General framework to study limit behavior of neural models based on hyperparameter scaling.
result Derives scaling for existing mean-field and neural tangent kernel limits and introduces new dynamically stable limits.

Huisken and Sinestrari have recently defined a surgery process for mean curvature flow when the initial data is a two-convex hypersurface. The process depends on a parameter H. Its role is to initiate a surgery when the maximum of the mean curvature of the evolving hypersurface becomes H, and to control the scale at wh…

2010-02-19abs ↗pdf ↗

Study on adversarial robustness in neural networks across initialization and training phases.

problem Understanding adversarial robustness in neural networks during different learning stages.
method Analyzes adversarial robustness in various scenarios of over-parameterized networks with quadratic targets and infinite samples.
result Robustness can worsen when test error improves, and vice versa, revealing new tradeoffs.

Constructs initial data for Einstein vacuum equations involving multiple localized gravitational sources.

problem Modeling the interaction of distant gravitational systems in general relativity.
method Time-symmetric initial data construction using gluing schemes and localized sources.
result Produces initial data sets with finite ADM mass and multiple Einstein-Rosen bridges.

SGD transitions between maxima and minima with varying time scales.

problem Understanding SGD's behavior near critical points in noisy landscapes.
method Analyzing SGD convergence and escape dynamics in 1D landscapes with infinite- and finite-variance noise.
result SGD reliably moves to the basin's minimum unless close to a local maximum, where it can linger.

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.

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.

Single neural network predicts ImageNet model parameters for faster training.

problem Training diverse ImageNet models requires significant resources and time.
method Trained a neural network to predict ImageNet model parameters and used them for initialization.
result Models initialized with predicted parameters converge faster and achieve competitive performance.

Training very deep networks is an important open problem in machine learning. One of many difficulties is that the norm of the back-propagated error gradient can grow or decay exponentially. Here we show that training very deep feed-forward networks (FFNs) is not as difficult as previously thought. Unlike when back-pro…

2014-12-19abs ↗pdf ↗

Neural IVP solves IVPs with neural networks, overcoming scaling and conditioning issues.

problem Solving initial value PDEs with neural networks is challenging due to numerical errors and limited scalability.
method Developed an ODE-based approach to solve IVPs with neural networks, preventing ill-conditioning and scaling issues.
result Neural IVP solves challenging PDEs with neural networks efficiently and accurately.

The paper confirms a conjecture about optimal expected utility in markets with insider information.

problem Optimal expected utility in markets with insider information.
method An extension of the Black-Scholes-Merton model with a sequence of discrete-time economies.
result Optimal expected utility converges to the classic model when conditions are met.