We lifted 3 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| hugokoubbi/2024-transformers-dotm | canonical | 3 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| energy | Ran | hugokoubbi/2024-transformers-dotm/staircase.py pointer only (licence: NONE) · get_code("2ef92153bd42f6f1") |
| g | Ran | hugokoubbi/2024-transformers-dotm/staircase.py pointer only (licence: NONE) · get_code("cca4fbc0607f1254") |
| h | Ran | hugokoubbi/2024-transformers-dotm/staircase.py pointer only (licence: NONE) · get_code("cd47e59104aa489e") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We consider the self-attention model - an interacting particle system on the unit sphere, which serves as a toy model for Transformers, the deep neural network architecture behind the recent successes of large language models. We prove the appearance of dynamic metastability conjectured in [GLPR23] - although particles collapse to a single cluster in infinite time, they remain trapped near a configuration of several clusters for an exponentially long period of time. By leveraging a gradient flow interpretation of the system, we also connect our result to an overarching framework of slow motion of gradient flows proposed by Otto and Reznikoff [OR07] in the context of coarsening and the Allen-Cahn equation. We finally probe the dynamics beyond the exponentially long period of metastability, and illustrate that, under an appropriate time-rescaling, the energy reaches its global maximum in finite time and has a staircase profile, with trajectories manifesting saddle-to-saddle-like behavior, reminiscent of recent works in the analysis of training dynamics via gradient descent for two-layer neural networks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.06833")
get_code_for_paper("2410.06833")
have("2410.06833")
Connect an agent — have() is free.