On the distance between two neural networks and the stability of learning

By Jeremy Bernstein, Arash Vahdat, Yisong Yue, Ming-Yu Liu. 2020

75 citations recorded by the source corpus.

This paper relates parameter distance to gradient breakdown for a broad class of nonlinear compositional functions. The analysis leads to a new distance function called deep relative trust and a descent lemma for neural networks. Since the resulting learning rule seems not to require learning rate grid search, it may unlock a simpler workflow for training deeper and more complex neural networks. Please find the Python code used in this paper here: this https URL.

Subfields: Scaling & Learning Theory, Statistical Learning Theory

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Scaling & Learning Theory

  1. J. Edward Hu
  2. Soham De
  3. Samuel L. Smith
  4. Andrew Brock
  5. Jianfeng Gao
  6. Karen Simonyan
  7. Greg Yang
  8. Sam Schoenholz

In Statistical Learning Theory

  1. J. Edward Hu
  2. Weizhu Chen
  3. Jianfeng Gao
  4. Xiaodong Liu
  5. David Farhi
  6. Igor Babuschkin
  7. Szymon Sidor
  8. Jakub W. Pachocki

Citations in the corpus