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

4428831,3251,766 · Jun 202019922001200920172026
48 results for large learning rate

Large learning rates enhance model robustness and compressibility.

problem Achieving robustness and resource-efficiency in machine learning models.
method Identifying and utilizing large learning rates as a facilitator for robustness and compressibility.
result Large learning rates produce desirable representation properties and compare favorably to other methods.

Large learning rates cause oscillations in NN weights that improve generalization.

problem Improving generalization of neural networks trained with large learning rates.
method Theoretical analysis and feature-noise data generation model.
result Oscillating SGD with large learning rates benefits NN generalization by effectively learning weak features.

Learning-rate schedules for large models match optimization theory closely, leading to better training.

problem Improving training of large models with optimal learning rates.
method Used a bound from non-smooth convex optimization theory to match learning-rate schedules with practical benefits.
result Extending the learning-rate schedule with optimal learning-rate and transferring it across schedules improves model training.

Study shows deep linear networks can converge to flatter minima at large learning rates.

problem Understanding the implicit bias of deep linear networks at large learning rates.
method Characterization of deep linear networks for binary classification using logistic loss in the large learning rate regime.
result Gradient descent iterates converge to a flatter minimum in the catapult phase for certain data separation conditions.

Large learning rates improve generalization, but optimal ranges are narrower than previously thought.

problem Optimizing learning rates for neural network training.
method Detailed exploration of learning rate ranges in a simplified setup, validating findings in a practical setting.
result Optimal learning rate ranges are significantly narrower than previously assumed.

Large learning rates work surprisingly well in standard parameterization, contrary to theory.

problem Theoretical limits of large learning rates do not match practical network behavior.
method Fine-grained analysis of learning rates and network behavior under cross-entropy loss.
result There are two distinct sub-regimes of unstable learning rates, with a controlled divergence regime where features continue to evolve.

Large learning rates improve neural network generalization, study shows.

problem Understanding why large learning rates lead to better neural network generalization.
method Visual analysis of training and testing loss landscapes, introduction of a nonlinear model.
result Extended phase with large learning rates leads to near-optimal generalization.

Large learning rates improve kernel method performance.

problem Improving generalization in kernel methods with large learning rates.
method Analyzing the spectral decomposition of the solution to a quadratic objective in a separable Hilbert space.
result Large learning rates influence the spectral decomposition of the solution, leading to better generalization.

AdaScale SGD adapts learning rates for large-batch training efficiently.

problem Adapting learning rates for large-batch training to balance speed-ups and model quality.
method Adaptive learning rate adaptation based on gradient variance.
result AdaScale achieves reliable speed-ups for a wide range of batch sizes without degrading model quality.

Large learning rates lead to various implicit biases in nonconvex optimization.

problem Understanding the conditions under which large learning rates yield edge of stability, balancing, and catapult phenomena.
method Developed a global convergence theory for nonconvex functions without globally Lipschitz continuous gradient, focusing on functions with good regularity.
result These implicit biases are more likely to occur in functions with good regularity, and large learning rates favor flatter regions.

Large learning rates prevent memorization in denoising score matching.

problem Memorization of training data in diffusion-based generative models.
method Investigating the role of large learning rates in the small-noise regime, proving that they prevent convergence to the empirical optimal score.
result Large learning rates prevent memorization by making it impossible for the learned score to be arbitrarily close to the empirical optimal score.

Training deep neural networks requires intricate initialization and careful selection of learning rates. The emergence of stochastic gradient optimization methods that use adaptive learning rates based on squared past gradients, e.g., AdaGrad, AdaDelta, and Adam, eases the job slightly. However, such methods have also …

2019-10-27abs ↗pdf ↗

ScheduleFree+ improves large language model training without schedules or learning rates.

problem Scaling up Schedule-Free Learning to large language models.
method Learning-rate-free and schedule-free method for training large language models.
result ScheduleFree+ outperforms SOTA schedules by 31% at 1000 tokens per parameter.

SGD with large learning rates can achieve better test accuracy than expected.

problem SGD with large learning rates often outperforms expected convergence bounds.
method Proved that SGD with small learning rates stays close to gradient flow path on modified loss.
result Explicitly adding an implicit regularizer to the loss improves test accuracy.

Training deep neural networks using a large batch size has shown promising results and benefits many real-world applications. However, the optimizer converges slowly at early epochs and there is a gap between large-batch deep learning optimization heuristics and theoretical underpinnings. In this paper, we propose a no…

2020-02-04abs ↗pdf ↗

Learning rate decay (lrDecay) is a \emph{de facto} technique for training modern neural networks. It starts with a large learning rate and then decays it multiple times. It is empirically observed to help both optimization and generalization. Common beliefs in how lrDecay works come from the optimization analysis of (S…

2019-08-05abs ↗pdf ↗

New insights into how large learning rates affect transformer training dynamics.

problem Understanding how large learning rates impact the training of transformer models.
method Analyzing a simplified linear transformer model with a two-factor product map.
result Large learning rates can lead to various training outcomes including cycles, chaos, or divergence.

The study introduces anytime learning schedules for large language models without fixed horizons.

problem Training large language models without knowing the total training horizon.
method Theoretical analysis and weight averaging to create anytime learning schedules.
result Theoretical and empirical evidence shows that weight averaging with simple step sizes can achieve comparable final loss to well-tuned cosine schedules.

Maximal initial learning rate for deep ReLU networks identified.

problem Finding the optimal initial learning rate for deep neural networks.
method Simple approach to estimate maximal initial learning rate ηη^{\ast}, analyzing its behavior in constant-width fully-connected ReLU networks.
result Maximal initial learning rate ηη^{\ast} is well predicted as a power of depth × width, with specific conditions for network width and input layer training.

WSqD extends learning rate schedules for large model training without fixed horizons.

problem Fixed learning rate schedules limit training horizon extension.
method WSqD replaces constant stable phase with a shifted inverse-square-root base, retaining linear cooldown.
result WSqD achieves minimax-optimal convergence rate and horizon-independence.

Large learning rates lead to optimal generalization if chosen carefully.

problem Understanding the optimal range of large learning rates for neural network training.
method Empirical study focusing on two questions: optimal initial LR range and differences between models trained with different LRs.
result Optimal initial learning rates slightly above the convergence threshold lead to optimal results after fine-tuning with a small LR or weight averaging.

The paper presents a multi-power law for predicting loss curves across different learning rate schedules.

problem Understanding and optimizing the relationship between model performance and hyperparameters, especially learning rates.
method Proposes a multi-power law that combines power laws based on the sum of learning rates and additional laws for loss reduction due to decay.
result The multi-power law accurately predicts loss curves for unseen learning rate schedules and finds a schedule that outperforms cosine learning rate.

SGDM accelerates faster than SGD with large batch sizes and permits broader learning rates.

problem Understanding the role of momentum in SGDM and its convergence rates.
method Analysis of SGDM convergence rates under strongly convex settings, including finite-sample rates and asymptotic normality of the averaged estimator.
result SGDM converges faster than SGD with large batch sizes and permits broader learning rates.

D-Adaptation automatically sets optimal learning rates without manual tuning.

problem Optimizing learning rates for efficient convergence in machine learning.
method D-Adaptation, which asymptotically achieves optimal learning rates without back-tracking or additional evaluations.
result D-Adaptation automatically matches hand-tuned learning rates across diverse problems.

IUS framework predicts EUR/USD exchange rate with improved accuracy.

problem Accurate forecasting of EUR/USD exchange rate.
method Combines large language models for sentiment analysis, deep learning for forecasting, and feature selection.
result Optuna-optimized Bi-LSTM model reduces MAE and RMSE by 10.69% and 9.56% respectively.

New learning rate approach reveals phase transitions in SGD performance.

problem Understanding feature learning dynamics in neural networks.
method Characterizing the relationship between learning rate(s) and sample complexity for gradient-based algorithms.
result Phase transition from information exponent to generative exponent regime with different learning rates.

A new method reduces computational cost for gene expression inference in large microarray data sets.

problem Efficiently predicting gene expression in large datasets with limited resources.
method Adaptive Lipschitz constant inspired learning rate, random sub-sampling, and A-ReLU activation function.
result Remarkable improvement in saving computational cost while maintaining prediction accuracy.

Learning rate annealing helps even in convex problems, improving generalization.

problem Improving generalization in neural networks, especially convex problems.
method Learning rate annealing schedule (large initial, then small learning rate).
result Gradient descent can reach minima with better generalization using learning rate annealing.

This paper quantifies hyperparameter transfer and finds embedding layer learning rate is key.

problem Quantifying optimal hyperparameters for large language models across scales.
method Developed three metrics to quantify hyperparameter transfer and investigated the importance of embedding layer learning rate.
result Maximal Update (μP) parameterization offers high-quality learning rate transfer compared to standard parameterization (SP).

The QLBS model is enhanced with a large trader's impact, leading to optimal hedging strategies.

problem Finding an optimal hedging strategy with low transaction costs and fair price convergence.
method Extending the QLBS model, defining a hypothetical limit order book, and using batch-mode reinforcement learning.
result Optimal hedging strategy with lower transaction costs and fair price convergence.

GALA adapts learning rates online by aligning gradients, improving deep learning model performance.

problem Fine-tuning learning rates for deep learning models requires extensive grid search.
method GALA dynamically adjusts learning rates by tracking gradient alignment and local curvature.
result GALA produces a flexible, adaptive learning rate schedule that increases when gradients align.

Paper studies Gaussian approximation in linear regression with rates derived.

problem Gaussian approximation in online linear regression.
method Derives rates for constant learning rate settings, analyzes dependence on dd and design matrix.
result Rate of normal approximation is logn/n\sqrt{\log{n}/n} for large nn.

Optimization of neural networks scales with γ, revealing unique loss curves and optimal learning rates.

problem Understanding the impact of feature learning strength on neural network optimization.
method Empirical investigation of neural networks with varying γ, analyzing the γγ-ηη plane, and examining loss curves.
result Optimal learning rate scales non-trivially with γ, with ηγ2η^* \propto γ^2 for small γ and ηγ2/Lη^* \propto γ^{2/L} for large γ.

New theory shows large learning rates prevent overfitting in neural networks.

problem Generalization of two-layer ReLU neural networks in noisy regression problems.
method Gradient descent with constant learning rate converges to stable minima.
result Gradient descent with large learning rates finds smooth, sparse fits.

The study analyzes how machine learning classifiers' error rates decrease exponentially based on large deviations theory.

problem Understanding the convergence rate of machine learning classifiers' error probabilities.
method Large deviations theory applied to machine learning classification techniques.
result The error probability of ML classifiers converges to zero exponentially, with a rate dependent on the training set size.

New algorithm reduces adaptation lag in online model selection.

problem Adaptation lag in online model selection for non-stationary environments.
method Optimistic online mirror descent with safeguarded large learning rates.
result Reduces adaptation lag from hundreds of rounds to a few rounds.