T-6

Goal:

Key concepts: gradient descent, rugged landscapes, metastable states, Hessian matrices, random matrix theory, landscape’s complexity.

Problem

Consider the REM. Assume that the $2^N$ configurations are organised in an hypercube of connectivity $N$: each configuration has $N$ neighbours, that are obtained flipping one spin of the first configuration