T-6: Difference between revisions
Jump to navigation
Jump to search
(Created page with "<strong>Goal: </strong> <br> <strong>Key concepts: </strong> gradient descent, rugged landscapes, metastable states, Hessian matrices, random matrix theory, landscape’s complexity. === Langevin, Activation ===") |
No edit summary |
||
| Line 8: | Line 8: | ||
=== Langevin, Activation === | === Langevin, Activation === | ||
=== Problem === | |||
Consider the REM. Assume that the <math> 2^N </math> configurations are organised in an hypercube of connectivity <math> N </math>: each configuration has <math> N </math> neighbours, that are obtained flipping one spin of the first configuration | |||
Revision as of 23:11, 10 January 2024
Goal:
Key concepts: gradient descent, rugged landscapes, metastable states, Hessian matrices, random matrix theory, landscape’s complexity.
Langevin, Activation
Problem
Consider the REM. Assume that the configurations are organised in an hypercube of connectivity : each configuration has neighbours, that are obtained flipping one spin of the first configuration
