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.

169,181 papers · 148 categories

Trend · papers per month

69137206274 · Jun 202019922001200920182026
48 results for Decay rate

Optimal learning rates decay to zero in easy tasks and maintain a warmup phase in hard tasks.

problem Optimizing learning rates under functional scaling laws for model training.
method Deriving optimal learning-rate schedules based on exponents ss and ββ.
result Sharp phase transition between easy and hard tasks, with different decay behaviors.

Study on massless Vlasov equation on Reissner-Nordström spacetimes, showing decay rates and non-decay phenomena.

problem Analyzing decay and non-decay rates of solutions to the massless Vlasov equation on Reissner-Nordström spacetimes.
method Quantitative analysis of geodesic flow and comparison to wave equation instability results.
result Exponential decay rates in subextremal cases and polynomial rates in extremal cases, with non-decay of transversal derivatives in extremal cases.

Learning rate decay helps modern neural networks by suppressing memorization and improving complex pattern learning.

problem Understanding the effectiveness of learning rate decay in training modern neural networks.
method Proposes a new explanation for lrDecay effectiveness based on network behavior and pattern complexity.
result Learning rate decay improves complex pattern learning and suppresses memorization of noisy data.

Improved learning rate schedule for least squares regression.

problem Achieving optimal convergence rates for least squares regression.
method Step Decay schedule with geometrically decaying learning rates.
result Final iterate behavior with Step Decay schedules is off the minimax rate by only log factors.

WSD schedule improves model training efficiency by adapting learning rates dynamically.

problem Fixed compute budgets limit training efficiency of language models.
method Introduces a WSD schedule that uses a constant learning rate followed by a rapid decay phase.
result WSD schedule generates a non-traditional loss curve with stable and decay phases.

Step decay schedules improve convergence in non-convex optimization.

problem Improving convergence in non-convex optimization problems.
method Analyzing convergence rates of step decay schedules in non-convex, convex, and strongly convex problems.
result Step decay schedules achieve O(lnT/T)\mathcal{O}(\ln T/\sqrt{T}) convergence rates in various optimization scenarios.

Demon improves neural network training with a decaying momentum approach.

problem Improving neural network training efficiency and robustness.
method Proposes a decaying momentum ( extsc{Demon}) rule for neural network optimization.
result Demon achieves the highest number of Top-1 and Top-3 finishes across various settings and architectures.

The paper studies harmonic map heat flow stability and decay rates.

problem Analyzing stability and decay rates of harmonic map heat flow solutions.
method Use of homogeneous Besov space B˙p,dp(Rd)\dot{B}^{\frac{d}{p}}_{p,\infty}(\mathbb{R}^d) for small initial data and self-similar decay assumption.
result Decay rates for solutions of the harmonic map flow of the form ablau(t)L(Rd)Ct12\| abla u(t) \|_{L^\infty(\mathbb{R}^d)}\leq Ct^{-\frac12} and self-similar decay under stronger initial conditions.

Active data collection improves convergence rates in operator learning.

problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.

Extends decay estimates for Yang-Mills-Higgs fields on Minkowski and de Sitter spacetimes.

problem Decay rates of Yang-Mills-Higgs fields on Minkowski and de Sitter spacetimes.
method First worked on Minkowski space, localized estimates, then used conformal transformations to extend to Einstein cylinder and de Sitter space.
result Extended exponential decay rates for Yang-Mills-Higgs fields on de Sitter space and inverse polynomial decay rates on Minkowski space.

Maxwell equations decay to Coulomb solutions on black hole spacetimes.

problem Decay of Maxwell solutions in Schwarzschild-de Sitter spacetimes.
method Differential transformation of Maxwell tensor components, Fackerell-Ipser equation, vector field method.
result Super-polynomial decay rate of Maxwell solutions to Coulomb solutions.

Model proposes neural network for continuous time dynamics with inductive biases.

problem Training neural networks for small datasets with nonlinear dynamics.
method Inductive biases on decay rates and frequencies using Koopman operator theory.
result Higher forecasting performance with single short training sequence.

Adaptive weights improve physics-informed neural networks and deep operator networks.

problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Geometric step decay schedules improve stochastic algorithms' convergence on sharp nonconvex problems.

problem Convergence of stochastic algorithms on sharp nonconvex problems.
method Geometric step decay schedule applied to stochastic algorithms.
result Geometric step decay schedules lead to local linear convergence rates for sharp nonconvex problems.

Riemannian stochastic gradient descent converges faster with increasing batch size.

problem Improving convergence rate of Riemannian stochastic gradient descent.
method Theoretical analysis and numerical investigation of increasing batch size effects.
result Riemannian stochastic gradient descent converges faster with increasing batch size.

The study examines Kernel Ridge Regression error rates across noiseless and noisy conditions.

problem Characterizing Kernel Ridge Regression error rates in different noise levels.
method Unified analysis of Kernel Ridge Regression under various noise and regularization conditions.
result A crossover from noiseless to noisy error rates is observed as sample complexity increases.

In this paper, we give a new sharp generalization bound of lp-MKL which is a generalized framework of multiple kernel learning (MKL) and imposes lp-mixed-norm regularization instead of l1-mixed-norm regularization. We utilize localization techniques to obtain the sharp learning rate. The bound is characterized by the d…

2011-03-27abs ↗pdf ↗

Paper calculates eigenvalue decay rates for neural network kernels on general domains.

problem Determining eigenvalue decay rates for neural network kernels on arbitrary domains.
method Proved dynamics of wide neural networks approximates NTK on general domains, used minimax optimality and interpolation spaces.
result Provided strategy to calculate eigenvalue decay rates for neural network kernels.

AdamNX improves Adam's stability by adjusting its learning rate.

problem Adam's tendency to converge to non-flat minima in large-scale models.
method Proposes a novel exponential decay mechanism for Adam's second-order moment estimate.
result AdamNX outperforms Adam and its variants in stability and performance.

We introduce a new weight-decay scaling rule to maintain sublayer gains across different widths in modern scale-invariant architectures.

problem In modern scale-invariant architectures, training quickly enters a steady state where normalization layers create backward scale sensitivity, degrading learning-rate transfer.
method We introduce a weight-decay scaling rule for AdamW that preserves sublayer gain across widths by equalizing the effective learning rate.
result Our empirical weight-decay scaling rule λ2dλ_2\propto \sqrt{d} approximately keeps sublayer gains width invariant, enabling zero-shot transfer of learning rate and weight decay.

Study reveals dynamics of neural networks with normalization, weight decay, and SGD.

problem Understanding the equilibrium condition in Spherical Motion Dynamics (SMD).
method Investigates SMD by exploring the cause of equilibrium condition, introducing assumptions, proposing angular update, and verifying theoretical results.
result Proves weight norm and angular update can converge at linear rate under given assumptions.

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.

Paper tackles dynamic pricing in a geometrically decaying environment, achieving better occupancy with lower rates.

problem Minimizing expected loss in a dynamically changing environment with decisions dependent on the data distribution.
method Introduces algorithms for information and loss function settings, using repeated decision deployment to allow mixing of the environment.
result Iteration complexity matches first and zero order stochastic gradient methods up to logarithmic factors.

SignSGD outperforms SGD in linear regression with optimal scaling laws under PLRF model.

problem Improving linear regression performance with signSGD under power-law random features.
method Analysis of signSGD risk under PLRF model, comparison with SGD, identification of unique effects.
result SignSGD can have a steeper compute-optimal slope than SGD in noisy regimes, especially with WSD schedule.

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.

We discover scaling laws for kernel regression loss under various learning rate schedules.

problem Understanding loss dynamics and learning rate schedules in kernel regression.
method Theoretical analysis of stochastic gradient descent on a power-law kernel regression model.
result Established a Functional Scaling Law (FSL) capturing the full loss trajectory under arbitrary learning rate schedules.

Upper bounds for Bergman kernels from smooth Kähler potentials.

problem Bounding Bergman kernels from smooth Kähler potentials.
method Using Taylor coefficients of the Kähler potential, we give upper bounds for Bergman kernels of tensor powers of a smooth positive line bundle.
result Improved off-diagonal rate of decay for analytic, quasi-analytic, and Gevrey potentials.

One knows that the large time heat decay exponent on a nilpotent group is given by half the growing rate of the volume of its large balls. This work deals with the similar problem of trying to interpret geometrically the heat decay on (one) forms. We will show how it is (partially) related to the depth of the relations…

2001-12-06abs ↗pdf ↗

Study precise rates of horizontal gap shrinkage on generic translation surfaces.

problem Understanding precise decay rates of horizontal gaps in translation surfaces.
method Analyzing saddle connections and their angles on translation surfaces.
result Obtained precise decay rates for the difference in angle between almost horizontal saddle connections.

Paper develops an online learning algorithm for functional data models.

problem Recovering slope functions or predictors in functional data models.
method Online regularized learning algorithm in reproducing kernel Hilbert spaces with polynomially decaying step-size.
result Established fast convergence rates for estimation error without capacity assumption.

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.

Approximations to utility indifference prices are provided for a contingent claim in the large position size limit. Results are valid for general utility functions on the real line and semi-martingale models. It is shown that as the position size approaches infinity, the utility function's decay rate for large negative…

2012-02-17abs ↗pdf ↗