arXiv subjects

Federico Ricci-Tersenghi

Publications and source records attributed to Federico Ricci-Tersenghi.

At least 73 records · Page 4Linked to original sources

arXiv2020

Gradient descent dynamics in the mixed $p$-spin spherical model: finite size simulation and comparison with mean-field integration

We perform numerical simulations of a long-range spherical spin glass with two and three body interaction terms. We study the gradient descent dynamics and the inherent structures found after a quench from initial conditions, well thermalized at temperature $T_{in}$. In large systems, the dynamics strictly agrees with the integration of the mean-field dynamical equations. In particular, we confirm the existence of an onset initial temperature, within the liquid phase, below which the energy of the inherent structures undoubtedly depends on $T_{in}$. This behavior is in contrast with that of pure models, where there is a 'threshold energy' that attracts all the initial configurations in the liquid. Our results strengthen the analogy between mean-field spin glass models and supercooled liquids.

cond-mat.dis-nn↗

arXiv2020

How to iron out rough landscapes and get optimal performances: Averaged Gradient Descent and its application to tensor PCA

In many high-dimensional estimation problems the main task consists in minimizing a cost function, which is often strongly non-convex when scanned in the space of parameters to be estimated. A standard solution to flatten the corresponding rough landscape consists in summing the losses associated to different data points and obtain a smoother empirical risk. Here we propose a complementary method that works for a single data point. The main idea is that a large amount of the roughness is uncorrelated in different parts of the landscape. One can then substantially reduce the noise by evaluating an empirical average of the gradient obtained as a sum over many random independent positions in the space of parameters to be optimized. We present an algorithm, called Averaged Gradient Descent, based on this idea and we apply it to tensor PCA, which is a very hard estimation problem. We show that Averaged Gradient Descent over-performs physical algorithms such as gradient descent and approximate message passing and matches the best algorithmic thresholds known so far, obtained by tensor unfolding and methods based on sum-of-squares.

stat.ML↗

arXiv2020

Spin glasses in a field show a phase transition varying the distance among real replicas (and how to exploit it to find the critical line in a field)

We discuss a phase transition in spin glass models which have been rarely considered in the past, namely the phase transition that may take place when two real replicas are forced to be at a larger distance (i.e. at a smaller overlap) than the typical one. In the first part of the work, by solving analytically the Sherrington-Kirkpatrick model in a field close to its critical point, we show that even in a paramagnetic phase the forcing of two real replicas to an overlap small enough leads the model to a phase transition where the symmetry between replicas is spontaneously broken. More importantly, this phase transition is related to the de Almeida-Thouless (dAT) critical line. In the second part of the work, we exploit the phase transition in the overlap between two real replicas to identify the critical line in a field in finite-dimensional spin glasses. This is a notoriously difficult computational problem, because of huge finite-size corrections. We introduce a new method of analysis of Monte Carlo data for disordered systems, where the overlap between two real replicas is used as a conditioning variate. We apply this analysis to equilibrium measurements collected in the paramagnetic phase in a field, $h>0$ and $T_c(h)<T<T_c(h=0)$, of the $d=1$ spin glass model with long-range interactions decaying fast enough to be outside the regime of validity of the mean-field theory. We thus provide very reliable estimates for the thermodynamic critical temperature in a field.

cond-mat.dis-nn↗

arXiv2019

Rethinking mean-field glassy dynamics and its relation with the energy landscape: the awkward case of the spherical mixed p-spin model

The spherical p-spin model is not only a fundamental model in statistical mechanics of disordered system, but has recently gained popularity since many hard problems in machine learning can be mapped on it. Thus the study of the out of equilibrium dynamics in this model is interesting both for the glass physics and for its implications on algorithms solving NP-hard problems. We revisit the long-time limit of the out of equilibrium dynamics of mean-field spherical mixed p-spin models. We consider quenches (gradient descent dynamics) starting from initial conditions thermalized at some temperature in the ergodic phase. We perform numerical integration of the dynamical mean-field equations of the model and we find an unexpected dynamical phase transition. Below an onset temperature, higher than the dynamical transition temperature, the asymptotic energy goes below the "threshold energy" of the dominant marginal minima of the energy function and memory of the initial condition is kept. This behavior, not present in the pure spherical p-spin model, resembles closely the one observed in simulations of glass-forming liquids. We then investigate the nature of the asymptotic dynamics, finding an aging solution that relaxes towards deep marginal minima, evolving on a restricted marginal manifold. Careful analysis, however, rules out simple aging solutions. We compute the constrained complexity in the aim of connecting the asymptotic solution to the energy landscape.

cond-mat.dis-nn↗

arXiv2019

Comment on "Real-space renormalization-group methods for hierarchical spin glasses"

In the paper [Angelini M C, Parisi G, and Ricci-Tersenghi F, Ensemble renormalization group for disordered systems, Phys. Rev. B 87 134201 (2013)] we introduced a real-space renormalization group called Ensemble Renormalization Group (ERG) and we applied it to the Edwards-Anderson model, obtaining estimates for the critical exponents in good agreement with those from Monte Carlo simulations. Recently the paper [Castellana M, Real-space renormalization-group methods for hierarchical spin glasses, J. Phys. A: Math. Theor. 52 445002 (2019)] re-examined the ERG method from a different perspective, concluding that the previous results were wrong, and claiming that the ERG method predicts trivially wrong critical exponents. In this comment we explain why the conclusions reached by Castellana are wrong, as they are based on a misinterpretation of finite-size effects. We conclude that the ERG method remains a good RG method to obtain critical exponents in strongly disordered models (if properly used).

cond-mat.dis-nn↗

arXiv2019

Strong ergodicity breaking in aging of mean field spin glasses

Out of equilibrium relaxation processes show aging if they become slower as time passes. Aging processes are ubiquitous and play a fundamental role in the physics of glasses and spin glasses and in other applications (e.g. in algorithms minimizing complex cost/loss functions). The theory of aging in the out of equilibrium dynamics of mean-field spin glass models has achieved a fundamental role, thanks to the asymptotic analytic solution found by Cugliandolo and Kurchan. However this solution is based on assumptions (e.g. the weak ergodicity breaking hypothesis) which have never been put under a strong test until now. In the present work we present the results of an extraordinary large set of numerical simulations of the prototypical mean-field spin glass models, namely the Sherrington-Kirkpatrick and the Viana-Bray models. Thanks to a very intensive use of GPUs, we have been able to run the latter model for more than $2^{64}$ spin updates and thus safely extrapolate the numerical data both in the thermodynamical limit and in the large times limit. The measurements of the two-times correlation functions in isothermal aging after a quench from a random initial configuration to a temperature $T<T_c$ provides clear evidence that, at large times, such correlations do not decay to zero as expected by assuming weak ergodicity breaking. We conclude that strong ergodicity breaking takes place in mean-field spin glasses aging dynamics which, asymptotically, takes place in a confined configurational space. Theoretical models for the aging dynamics need to be revised accordingly.

cond-mat.dis-nn↗

arXiv2019

New loop expansion for the Random Magnetic Field Ising Ferromagnets at zero temperature

We apply to the Random Field Ising Model at zero temperature (T= 0) the perturbative loop expansion around the Bethe solution. A comparison with the standard epsilon-expansion is made, highlighting the key differences that make the new expansion much more appropriate to correctly describe strongly disordered systems, especially those controlled by a T = 0 RG fixed point. This new loop expansion produces an effective theory with cubic vertices. We compute the one-loop corrections due to cubic vertices, finding new terms that are absent in the epsilon-expansion. However, these new terms are subdominant with respect to the standard, supersymmetric ones, therefore dimensional reduction is still valid at this order of the loop expansion.

cond-mat.dis-nn↗

arXiv2019

Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation

Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to as `decimation,' with reference to analogous procedures in statistical physics. The behavior of decimation procedures is poorly understood. Here we consider a simple randomized decimation algorithm based on belief propagation (BP), and analyze its behavior on random k-satisfiability formulae. In particular, we propose a tree model for its analysis and we conjecture that it provides asymptotically exact predictions in the limit of large instances. This conjecture is confirmed by numerical simulations.

cs.AI↗

arXiv2019

Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs

The effectiveness of stochastic algorithms based on Monte Carlo dynamics in solving hard optimization problems is mostly unknown. Beyond the basic statement that at a dynamical phase transition the ergodicity breaks and a Monte Carlo dynamics cannot sample correctly the probability distribution in times linear in the system size, there are almost no predictions nor intuitions on the behavior of this class of stochastic dynamics. The situation is particularly intricate because, when using a Monte Carlo based algorithm as an optimization algorithm, one is usually interested in the out of equilibrium behavior which is very hard to analyse. Here we focus on the use of Parallel Tempering in the search for the largest independent set in a sparse random graph, showing that it can find solutions well beyond the dynamical threshold. Comparison with state-of-the-art message passing algorithms reveals that parallel tempering is definitely the algorithm performing best, although a theory explaining its behavior is still lacking.

cond-mat.dis-nn↗

arXiv2019

Typology of phase transitions in Bayesian inference problems

Many inference problems, notably the stochastic block model (SBM) that generates a random graph with a hidden community structure, undergo phase transitions as a function of the signal-to-noise ratio, and can exhibit hard phases in which optimal inference is information-theoretically possible but computationally challenging. In this paper we refine this description by emphasizing the existence of more generic phase diagrams with a hybrid-hard phase in which it is computationally easy to reach a non-trivial inference accuracy, but computationally hard to match the information theoretically optimal one. We support this discussion by quantitative expansions of the functional cavity equations that describe inference problems on sparse graphs. These expansions shed light on the existence of hybrid-hard phases, for a large class of planted constraint satisfaction problems, and on the question of the tightness of the Kesten-Stigum (KS) bound for the associated tree reconstruction problem. Our results show that the instability of the trivial fixed point is not a generic evidence for the Bayes-optimality of the message passing algorithms. We clarify in particular the status of the symmetric SBM with 4 communities and of the tree reconstruction of the associated Potts model: in the assortative (ferromagnetic) case the KS bound is always tight, whereas in the disassortative (antiferromagnetic) case we exhibit an explicit criterion involving the degree distribution that separates a large degree regime where the KS bound is tight and a low degree regime where it is not. We also investigate the SBM with 2 communities of different sizes, a.k.a. the asymmetric Ising model, and describe quantitatively its computational gap as a function of its asymmetry, and a version of the SBM with 2 groups of communities. We complement this study with numerical simulations of the Belief Propagation algorithm.

cond-mat.dis-nn↗

arXiv2019

Biased landscapes for random Constraint Satisfaction Problems

The typical complexity of Constraint Satisfaction Problems (CSPs) can be investigated by means of random ensembles of instances. The latter exhibit many threshold phenomena besides their satisfiability phase transition, in particular a clustering or dynamic phase transition (related to the tree reconstruction problem) at which their typical solutions shatter into disconnected components. In this paper we study the evolution of this phenomenon under a bias that breaks the uniformity among solutions of one CSP instance, concentrating on the bicoloring of k-uniform random hypergraphs. We show that for small k the clustering transition can be delayed in this way to higher density of constraints, and that this strategy has a positive impact on the performances of Simulated Annealing algorithms. We characterize the modest gain that can be expected in the large k limit from the simple implementation of the biasing idea studied here. This paper contains also a contribution of a more methodological nature, made of a review and extension of the methods to determine numerically the discontinuous dynamic transition threshold.

cond-mat.dis-nn↗

arXiv2019

A fast and accurate algorithm for inferring sparse Ising models via parameters activation to maximize the pseudo-likelihood

We propose a new algorithm to learn the network of the interactions of pairwise Ising models. The algorithm is based on the pseudo-likelihood method (PLM), that has already been proven to efficiently solve the problem in a large variety of cases. Our present implementation is particularly suitable to address the case of sparse underlying topologies and it is based on a careful search of the most important parameters in their high dimensional space. We call this algorithm Parameters Activation to Maximize Pseudo-Likelihood (PAMPL). Numerical tests have been performed on a wide class of models such as random graphs and finite dimensional lattices with different type of couplings, both ferromagnetic and spin glasses. These tests show that PAMPL improves the performances of the fastest existing algorithms.

cond-mat.dis-nn↗

arXiv2018

SpaRTA - Tracking across occlusions via global partitioning of 3D clouds of points

Any 3D tracking algorithm has to deal with occlusions: multiple targets get so close to each other that the loss of their identities becomes likely. In the best case scenario, trajectories are interrupted, thus curbing the completeness of the data-set; in the worse case scenario, identity switches arise, potentially affecting in severe ways the very quality of the data. Here, we present a novel tracking method that addresses the problem of occlusions within large groups of featureless objects by means of three steps: i) it represents each target as a cloud of points in 3D; ii) once a 3D cluster corresponding to an occlusion occurs, it defines a partitioning problem by introducing a cost function that uses both attractive and repulsive spatio-temporal proximity links; iii) it minimizes the cost function through a semi-definite optimization technique specifically designed to cope with link frustration. The algorithm is independent of the specific experimental method used to collect the data. By performing tests on public data-sets, we show that the new algorithm produces a significant improvement over the state-of-the-art tracking methods, both by reducing the number of identity switches and by increasing the accuracy of the actual positions of the targets in real space.

cs.CV↗

arXiv2018

One-loop topological expansion for spin glasses in the large connectivity limit

We apply for the first time a new one-loop topological expansion around the Bethe solution to the spin-glass model with field in the high connectivity limit, following the methodological scheme proposed in a recent work. The results are completely equivalent to the well known ones, found by standard field theoretical expansion around the fully connected model (Bray and Roberts 1980, and following works). However this method has the advantage that the starting point is the original Hamiltonian of the model, with no need to define an associated field theory, nor to know the initial values of the couplings, and the computations have a clear and simple physical meaning. Moreover this new method can also be applied in the case of zero temperature, when the Bethe model has a transition in field, contrary to the fully connected model that is always in the spin glass phase. Sharing with finite dimensional model the finite connectivity properties, the Bethe lattice is clearly a better starting point for an expansion with respect to the fully connected model. The present work is a first step towards the generalization of this new expansion to more difficult and interesting cases as the zero-temperature limit, where the expansion could lead to different results with respect to the standard one.

cond-mat.dis-nn↗

arXiv2018

An improved Belief Propagation algorithm finds many Bethe states in the random field Ising model on random graphs

We first present an empirical study of the Belief Propagation (BP) algorithm, when run on the random field Ising model defined on random regular graphs in the zero temperature limit. We introduce the notion of maximal solutions for the BP equations and we use them to fix a fraction of spins in their ground state configuration. At the phase transition point the fraction of unconstrained spins percolates and their number diverges with the system size. This in turn makes the associated optimization problem highly non trivial in the critical region. Using the bounds on the BP messages provided by the maximal solutions we design a new and very easy to implement BP scheme which is able to output a large number of stable fixed points. On one side this new algorithm is able to provide the minimum energy configuration with high probability in a competitive time. On the other side we found that the number of fixed points of the BP algorithm grows with the system size in the critical region. This unexpected feature poses new relevant questions on the physics of this class of models.

cond-mat.dis-nn↗

arXiv2017

Comparison of Gabay-Toulouse and de Almeida-Thouless instabilities for the spin glass XY model in a field on sparse random graphs

Vector spin glasses are known to show two different kinds of phase transitions in presence of an external field: the so-called de Almeida-Thouless and Gabay-Toulouse lines. While the former has been studied to some extent on several topologies (fully connected, random graphs, finite-dimensional lattices, chains with long-range interactions), the latter has been studied only in fully connected models, which however are known to show some unphysical behaviors (e.g. the divergence of these critical lines in the zero-temperature limit). Here we compute analytically both these critical lines for XY spin glasses on random regular graphs. We discuss the different nature of these phase transitions and the dependence of the critical behavior on the field distribution. We also study the crossover between the two different critical behaviors, by suitably tuning the field distribution.

cond-mat.dis-nn↗

arXiv2017

Approximating the XY model on a random graph with a $q$-state clock model

Numerical simulations of spin glass models with continuous variables set the problem of a reliable but efficient discretization of such variables. In particular, the main question is how fast physical observables computed in the discretized model converge toward the ones of the continuous model when the number of states of the discretized model increases. We answer this question for the XY model and its discretization, the $q$-state clock model, in the mean-field setting provided by random graphs. It is found that the convergence of physical observables is exponentially fast in the number $q$ of states of the clock model, so allowing a very reliable approximation of the XY model by using a rather small number of states. Furthermore, such an exponential convergence is found to be independent from the disorder distribution used. Only at $T=0$ the convergence is slightly slower (stretched exponential). Thanks to the analytical solution to the $q$-state clock model, we compute accurate phase diagrams in the temperature versus disorder strength plane. We find that, at zero temperature, spontaneous replica symmetry breaking takes place for any amount of disorder, even an infinitesimal one. We also study the one step of replica symmetry breaking (1RSB) solution in the low-temperature spin glass phase.

cond-mat.dis-nn↗

arXiv2016

A simple analytical description of the non-stationary dynamics in Ising spin systems

The analytical description of the dynamics in models with discrete variables (e.g. Ising spins) is a notoriously difficult problem, that can be tackled only under some approximation. Recently a novel variational approach to solve the stationary dynamical regime has been introduced by Pelizzola [Eur. Phys. J. B, 86 (2013) 120], where simple closed equations are derived under mean-field approximations based on the cluster variational method. Here we propose to use the same approximation based on the cluster variational method also for the non-stationary regime, which has not been considered up to now within this framework. We check the validity of this approximation in describing the non-stationary dynamical regime of several Ising models defined on Erdos-Rényi random graphs: we study ferromagnetic models with symmetric and partially asymmetric couplings, models with random fields and also spin glass models. A comparison with the actual Glauber dynamics, solved numerically, shows that one of the two studied approximations (the so-called 'diamond' approximation) provides very accurate results in all the systems studied. Only for the spin glass models we find some small discrepancies in the very low temperature phase, probably due to the existence of a large number of metastable states. Given the simplicity of the equations to be solved, we believe the diamond approximation should be considered as the 'minimal standard' in the description of the non-stationary regime of Ising-like models: any new method pretending to provide a better approximate description to the dynamics of Ising-like models should perform at least as good as the diamond approximation.

cond-mat.dis-nn↗