T-5
Goal:
So far we have discussed the equilibrium properties of disordered systems, that are encoded in their partition function and free energy. In this set of problems, we characterize the energy landscape of the spherical -spin, by determining the number of its stationary points.
Key concepts: gradient descent, out-of-equilibrium dynamics, metastable states, Hessian matrices, random matrix theory, Langevin dynamics,?
Dynamics, optimization, trapping local minima
- Energy landscapes. Consider the spherical -spin model discussed in the Problems 2 and 3; The function is an energy landscape: it is a random function defined on configuration space, which is the space all configurations belong to. This landscape has its global minimum(a) at the ground state configuration(s): the energy density of the ground state(s) can be obtained studying the partition function in the limit . Besides the ground state(s), the energy landscape can have other local minima; the fully-connected models of glasses are characterized by the fact that there are plenty of these local minima, see SKETCH.
- Gradient descent and stationary points. Suppose that we are interested in finding the configurations of minimal energy of some model with energy landscape , starting from an arbitrary initial configuration : we can think about a dynamics in which we progressively update the configuration of the system moving towards lower and lower values of the energy, hoping to eventually converge to the ground state(s). The simplest dynamics of this sort is gradient descent,
where the configuration changes in time moving in the direction of the gradient of the energy landscape restricted to the sphere, . The dynamics stops when it reaches a stationary point , i.e. a configuration where . If the landscape has a simple, convex structure, this will be the ground state one is seeking for; if the energy landscape is very non-convex like in glasses, the end point of this algorithm will be a local minimum at energies much higher than the ground state. SKETCH
- The landscape’s complexity. To understand the structure of the energy landscape and to guess where gradient descent dynamics (or its variation) are expected to converge, it is useful to characterize the distribution of the stationary points, i.e. the number of such configuration having a given energy density . In fully-connected models of glasses, this quantity has an exponential scaling, , where is the complexity of the landscape. [1]
Problem 5.1: the Kac-Rice method and the complexity
In this Problem, we set up the computation of the annealed complexity of the spherical -spin model, which is defined by
- The Kac-Rice formula. Consider first a random function of one variable defined on an interval , and let be the number of points such that . Justify why
where is the probability density that is a zero of the function. In particular, why is the derivative of the function appearing in this formula? Consider now the number of stationary points of the -spin energy landscape, which satisfy . Justify why the generalization of the formula above gives
where is the probability density that is a stationary point of energy density , and is the Hessian matrix of the function restricted to the sphere.[2]
- Statistical rotational invariance. Recall the expression of the correlations of the energy landscape of the -spin computed in Problem 2.1: in which sense the correlation function is rotationally invariant? Justify why rotational invariance implies that
where is one fixed vector belonging to the surface of the sphere. Where does the prefactor arise from?
- Gaussianity and correlations. Determine the distribution of the quantity . Show that the components of the vector are Gaussian random variables with zero mean and covariances
The quantity can be shown to be uncorrelated to . The entries of the matrix are also Gaussian variables. Computing their correlation, one finds that the matrix conditioned to the fact that can be written as
where the matrix has random entries with zero average and correlations
Combining everything, show that this implies
Problem 5.2: the Hessian and random matrix theory
To get the complexity, it remains to compute the expectation value of the determinant of the Hessian matrix: this is the goal of this problem. We will do this exploiting results from random matrix theory.
- Gaussian Random matrices. Show that the matrix is a GOE matrix, i.e. a matrix taken from the Gaussian Orthogonal Ensemble, meaning that it is a symmetric matrix with distribution What is the value of ? How can these matrices be generated numerically?
- Eigenvalue density and concentration. Let be the eigenvalues of the matrix . Show that the following identity holds:
where is the empirical eigenvalue density. It can be shown that if is a GOE matrix, the distribution of the empirical density has a large deviation form (recall TD1) with speed , meaning that where now is a functional (a function of a function). Using a saddle point argument, show that this implies
where is the typical value of the eigenvalue density, which satisfies .
- The semicircle, the threshold and the ground state. The eigenvalue density of GOE matrices is self-averaging, and it equals to
- Check this numerically: generate matrices for various values of , plot their empirical eigenvalue density and compare with the asymptotic curve. Is the convergence faster in the bulk, or in the extreme of the support of the density?
- Combining all the results of the previous problems, show that the annealed complexity is
- Show that is a critical value where a transition occurs for the complexity. What happens to the eigenvalue density in when this value of energy is attained? Recalling that this is the eigenvalue density is that of the Hessian matrix of the landscape, explain why the stationary points at energy are marginally stable .
- The integral can be computed explicitly, and one finds:
Plot the annealed complexity, and determine numerically where it vanishes: why is the corresponding energy density equal to the ground state energy density?
Notes
- [1] - This quantity looks similar to the entropy we computed for the REM in Problem 1.1. However, while the entropy counts all configurations at a given energy density, the complexity accounts only for the stationary points.
- [2] - We define with the projector on the tangent plane to the sphere at : this is the plane orthogonal to the vector . The gradient is a -dimensional vector that is obtained projecting the gradient on the tangent plane, . The Hessian is a -dimensional matrix that is obtained from the Hessian as where is the identity matrix.