Excited to share our recent work introducing ๐ก๐ฒ๐๐ฟ๐ผ๐ป ๐ฃ๐๐ฟ๐๐๐ถ๐ (๐ก๐ฃ) - a greedy algorithm for training neural networks.
https://t.co/tqSivwVq8J
Had a great time visiting @TTIC_Connect last year -- the ideas I presented have progressed quite a bit since then:
- https://t.co/QqZC9EgxgW
- https://t.co/uqvXVOSdfT
ii) Although NP is inspired by the GF dynamics in the small init regime, it is NOT equivalent to GF (the reasons are technical โ see Sec. 5.3). Nonetheless, it could offer valuable insights into how neural networks build features during training. 13/n
Excited to share our recent work introducing ๐ก๐ฒ๐๐ฟ๐ผ๐ป ๐ฃ๐๐ฟ๐๐๐ถ๐ (๐ก๐ฃ) - a greedy algorithm for training neural networks.
https://t.co/tqSivwVq8J
A few important caveats - i) NP currently applies to homogeneous activations, which includes (Leaky) ReLU and its higher powers (max(x,0)^p). It also does not yet cover ResNets or Transformers, but we plan to extend NP to more general architectures. 12/n
In a series of works, we study the dynamics of gradient flow arising from minimizing the training loss in supervised learning.
We focus on homogeneous neural networks trained with small initialization.
This (long) thread summarizes our key findings. ๐งต
Extending the theory rigorously to ReLU is an important future direction. Another important direction is to study training dynamics of non-homogeneous architectures such as ResNets and Transformers.