Optimal Learning Rates for Deep Networks Are Data-Dependent

Yedi Zhang, Peter E. Latham, Leena Chennuru Vankadara, Andrew Saxe· July 10, 2026 View original

Key takeaways

  • Optimal learning rate scaling in deep networks is fundamentally data-dependent.
  • Data-agnostic scaling rules may not generalize across different network depths.
  • Data-dependent scaling can lead to stable, depth-independent convergence rates.
  • This insight could inform the design of more effective optimization algorithms for deep learning.

Who benefits

AI DevelopmentMachine Learning ResearchAutonomous SystemsScientific Computing

Summary

This note demonstrates that in deep scalar linear networks, the optimal depth-wise learning rate scaling is dependent on the data, unlike data-agnostic rules. With data-dependent scaling, learning dynamics become data-independent and weakly depth-dependent, achieving a constant linear convergence rate across all depths.

This short paper examines the gradient descent dynamics within deep scalar linear networks, which are simplified models where exact time-course solutions can be found for any depth. The research reveals a critical insight: the optimal way to scale learning rates across different layers (depth-wise) is not universal but rather depends on the specific data being used. This finding contrasts with common data-agnostic scaling rules, which the paper shows fail to transfer effectively across varying network depths. When the optimal, data-dependent scaling is applied, the learning dynamics themselves become independent of the data and only weakly dependent on the network's depth. A significant outcome of this data-dependent scaling is the achievement of a constant linear convergence rate, which holds true across all network depths, including infinitely deep configurations. The paper further notes similar data-dependent effects even when residual connections are introduced into these deep scalar linear networks.

Why it matters

Understanding how optimal learning rates depend on data can lead to more effective and stable training of deep neural networks, potentially improving convergence speed and model performance, especially in complex real-world applications.

How to implement this in your domain

  1. 1Re-evaluate current learning rate scheduling strategies, considering data characteristics rather than purely architectural ones.
  2. 2Explore adaptive learning rate optimizers that can implicitly or explicitly account for data-dependent dynamics.
  3. 3Conduct experiments with simplified linear models to gain intuition about data-dependent learning rate effects before applying to complex networks.
  4. 4Investigate techniques for dynamically adjusting learning rates based on data statistics or properties during training.

Original post by Yedi Zhang, Peter E. Latham, Leena Chennuru Vankadara, Andrew Saxe

"arXiv:2607.07884v1 Announce Type: new Abstract: In this short note we consider the gradient descent dynamics of deep scalar linear networks, $f(x) = \prod_{l=1}^L w_l x$, which enjoy exact time-course solutions for any integer depth. We show that even in this minimal model, the o…"

View on X

Originally posted by Yedi Zhang, Peter E. Latham, Leena Chennuru Vankadara, Andrew Saxe on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses

More in AI Research