arXiv subjects

Federico Ricci-Tersenghi

Publications and source records attributed to Federico Ricci-Tersenghi.

At least 37 records · Page 2Linked to original sources

arXiv2025

Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers

Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet whether they can deliver an advantage for practical real-world problems remains an open question. Here, we show that probabilistic computers (p-computers), when co-designed with hardware to implement powerful Monte Carlo algorithms, provide a compelling and scalable classical pathway for solving hard optimization problems. We focus on two key algorithms applied to 3D spin glasses: discrete-time simulated quantum annealing (DT-SQA) and adaptive parallel tempering (APT). We benchmark these methods against the performance of a leading quantum annealer on the same problem instances. For DT-SQA, we find that increasing the number of replicas improves residual energy scaling, in line with expectations from extreme value theory. We then show that APT, when supported by non-local isoenergetic cluster moves, exhibits a more favorable scaling and ultimately outperforms DT-SQA. We demonstrate these algorithms are readily implementable in modern hardware, projecting that custom Field Programmable Gate Arrays (FPGA) or specialized chips can leverage massive parallelism to accelerate these algorithms by orders of magnitude while drastically improving energy efficiency. Our results establish a new, rigorous classical baseline, clarifying the landscape for assessing a practical quantum advantage and presenting p-computers as a scalable platform for real-world optimization challenges.

quant-ph↗

arXiv2025

Supervised and Unsupervised protocols for hetero-associative neural networks

This paper introduces a learning framework for Three-Directional Associative Memory (TAM) models, extending the classical Hebbian paradigm to both supervised and unsupervised protocols within an hetero-associative setting. These neural networks consist of three interconnected layers of binary neurons interacting via generalized Hebbian synaptic couplings that allow learning, storage and retrieval of structured triplets of patterns. By relying upon glassy statistical mechanical techniques (mainly replica theory and Guerra interpolation), we analyze the emergent computational properties of these networks, at work with random (Rademacher) datasets and at the replica-symmetric level of description: we obtain a set of self-consistency equations for the order parameters that quantify the critical dataset sizes (i.e. their thresholds for learning) and describe the retrieval performance of these networks, highlighting the differences between supervised and unsupervised protocols. Numerical simulations validate our theoretical findings and demonstrate the robustness of the captured picture about TAMs also at work with structured datasets. In particular, this study provides insights into the cooperative interplay of layers, beyond that of the neurons within the layers, with potential implications for optimal design of artificial neural network architectures.

cond-mat.dis-nn↗

arXiv2025

Nearest-Neighbours Neural Network architecture for efficient sampling of statistical physics models

The task of sampling efficiently the Gibbs-Boltzmann distribution of disordered systems is important both for the theoretical understanding of these models and for the solution of practical optimization problems. Unfortunately, this task is known to be hard, especially for spin glasses at low temperatures. Recently, many attempts have been made to tackle the problem by mixing classical Monte Carlo schemes with newly devised Neural Networks that learn to propose smart moves. In this article we introduce the Nearest-Neighbours Neural Network (4N) architecture, a physically-interpretable deep architecture whose number of parameters scales linearly with the size of the system and that can be applied to a large variety of topologies. We show that the 4N architecture can accurately learn the Gibbs-Boltzmann distribution for the two-dimensional Edwards-Anderson model, and specifically for some of its most difficult instances. In particular, it captures properties such as the energy, the correlation function and the overlap probability distribution. Finally, we show that the 4N performance increases with the number of layers, in a way that clearly connects to the correlation length of the system, thus providing a simple and interpretable criterion to choose the optimal depth.

cond-mat.dis-nn↗

arXiv2025

Interacting Copies of Random Constraint Satisfaction Problems

We study a system of $y=2$ coupled copies of a well-known constraint satisfaction problem (random hypergraph bicoloring) to examine how the ferromagnetic coupling between the copies affects the properties of the solution space. We solve the replicated model by applying the cavity method to the supervariables taking $2^y$ values. Our results show that a coupling of strength $γ$ between the copies decreases the clustering threshold $α_d(γ)$, at which typical solutions shatters into disconnected components, therefore preventing numerical methods such as Monte Carlo Markov Chains from reaching equilibrium in polynomial time. This result needs to be reconciled with the observation that, in models with coupled copies, denser regions of the solution space should be more accessible. Additionally, we observe a change in the nature of the clustering phase transition, from discontinuous to continuous, in a wide $γ$ range. We investigate how the coupling affects the behavior of the Belief Propagation (BP) algorithm on finite-size instances and find that BP convergence is significantly impacted by the continuous transition. These results highlight the importance of better understanding algorithmic performance at the clustering transition, and call for a further exploration into the optimal use of re-weighting strategies designed to enhance algorithmic performances.

cond-mat.dis-nn↗

arXiv2025

Low-power multi-mode fiber projector overcomes shallow neural networks classifiers

In the domain of disordered photonics, the characterization of optically opaque materials for light manipulation and imaging is a primary aim. Among various complex devices, multi-mode optical fibers stand out as cost-effective and easy-to-handle tools, making them attractive for several tasks. In this context, we cast these fibers into random hardware projectors, transforming an input dataset into a higher dimensional speckled image set. The goal of our study is to demonstrate that using such randomized data for classification by training a single logistic regression layer improves accuracy compared to training on direct raw images. Interestingly, we found that the classification accuracy achieved is higher than that obtained with the standard transmission matrix model, a widely accepted tool for describing light transmission through disordered devices. We conjecture that the reason for such improved performance could be due to the fact that the hardware classifier operates in a flatter region of the loss landscape when trained on fiber data, which aligns with the current theory of deep neural networks. These findings suggest that the class of random projections operated by multi-mode fibers generalize better to previously unseen data, positioning them as promising tools for optically-assisted neural networks. With this study, in fact, we want to contribute to advancing the knowledge and practical utilization of these versatile instruments, which may play a significant role in shaping the future of neuromorphic machine learning.

physics.optics↗

arXiv2025

Beyond Disorder: Unveiling Cooperativeness in Multidirectional Associative Memories

By leveraging tools from the statistical mechanics of complex systems, in these short notes we extend the architecture of a neural network for hetero-associative memory (called three-directional associative memories, TAM) to explore supervised and unsupervised learning protocols. In particular, by providing entropic-heterogeneous datasets to its various layers, we predict and quantify a new emergent phenomenon -- that we term {\em layer's cooperativeness} -- where the interplay of dataset entropies across network's layers enhances their retrieval capabilities Beyond those they would have without reciprocal influence. Naively we would expect layers trained with less informative datasets to develop smaller retrieval regions compared to those pertaining to layers that experienced more information: this does not happen and all the retrieval regions settle to the same amplitude, allowing for optimal retrieval performance globally. This cooperative dynamics marks a significant advancement in understanding emergent computational capabilities within disordered systems.

cond-mat.dis-nn↗

arXiv2025

Evidence of Replica Symmetry Breaking under the Nishimori conditions in epidemic inference on graphs

In Bayesian inference, computing the posterior distribution from the data is typically a non-trivial problem, which usually requires approximations such as mean-field approaches or numerical methods, like the Monte Carlo Markov Chain. Being a high-dimensional distribution over a set of correlated variables, the posterior distribution can undergo the notorious replica symmetry breaking transition. When it happens, several mean-field methods and virtually every Monte Carlo scheme can not provide a reasonable approximation to the posterior and its marginals. Replica symmetry is believed to be guaranteed whenever the data is generated with known prior and likelihood distributions, namely under the so-called Nishimori conditions. In this paper, we break this belief, by providing a counter-example showing that, under the Nishimori conditions, replica symmetry breaking arises. Introducing a simple, geometrical model that can be thought of as a patient zero retrieval problem in a highly infectious regime of the epidemic Susceptible-Infectious model, we show that under the Nishimori conditions, there is evidence of replica symmetry breaking. We achieve this result by computing the instability of the replica symmetric cavity method toward the one step replica symmetry broken phase. The origin of this phenomenon -- replica symmetry breaking under the Nishimori conditions -- is likely due to the correlated disorder appearing in the epidemic models.

cond-mat.dis-nn↗

arXiv2025

A Very Effective and Simple Diffusion Reconstruction for the Diluted Ising Model

Diffusion-based generative models are machine learning models that use diffusion processes to learn the probability distribution of high-dimensional data. In recent years, they have become extremely successful in generating multimedia content. However, it is still unknown if such models can be used to generate high-quality datasets of physical models. In this work, we use a Landau-Ginzburg-like diffusion model to infer the distribution of a $2D$ bond-diluted Ising model. Our approach is simple and effective, and we show that the generated samples reproduce correctly the statistical and critical properties of the physical model.

cond-mat.dis-nn↗

arXiv2024

Analytical solution to Heisenberg spin glass models on sparse random graphs and their de Almeida-Thouless line

Results regarding spin glass models are, to this day, mainly confined to models with Ising spins. Spin glass models with continuous spins exhibit interesting new physical behaviors related to the additional degrees of freedom, but have been primarily studied on fully connected topologies. Only recently some advancements have been made in the study of continuous models on sparse graphs. In this work we partially fill this void by introducing a method to solve numerically the Belief Propagation equations for systems of Heisenberg spins on sparse random graphs via a discretization of the sphere. We introduce techniques to study the finite-temperature, finite-connectivity case as well as novel algorithms to deal with the zero-temperature and large connectivity limits. As an application, we locate the de Almeida-Thouless line for this class of models and the critical field at zero temperature, showing the full consistency of the methods presented. Beyond the specific results reported for Heisenberg models, the approaches presented in this paper have a much broader scope of application and pave the way to the solution of strongly disordered models with continuous variables.

cond-mat.dis-nn↗

arXiv2024

Generalized hetero-associative neural networks

Auto-associative neural networks (e.g., the Hopfield model implementing the standard Hebbian prescription) serve as a foundational framework for pattern recognition and associative memory in statistical mechanics. However, their hetero-associative counterparts, though less explored, exhibit even richer computational capabilities. In this work, we examine a straightforward extension of Kosko's Bidirectional Associative Memory (BAM), introducing a Three-directional Associative Memory (TAM), that is a tripartite neural network equipped with generalized Hebbian weights. Through both analytical approaches (using replica-symmetric statistical mechanics) and computational methods (via Monte Carlo simulations), we derive phase diagrams within the space of control parameters, revealing a region where the network can successfully perform pattern recognition as well as other tasks tasks. In particular, it can achieve pattern disentanglement, namely, when presented with a mixture of patterns, the network can recover the original patterns. Furthermore, the system is capable of retrieving Markovian sequences of patterns and performing generalized frequency modulation.

cond-mat.dis-nn↗

arXiv2024

Small field chaos in spin glasses: universal predictions from the ultrametric tree and comparison with numerical simulations

We study the chaotic behavior of the Gibbs state of spin-glasses under the application of an external magnetic field, in the crossover region where the field intensity scales proportional to $1/\sqrt{N}$, being $N$ the system size. We show that Replica Symmetry Breaking (RSB) theory provides universal predictions for chaotic behavior: they depend only on the zero-field overlap probability function $P(q)$ and are independent of other features of the system. Using solely $P(q)$ as input we can analytically predict quantitatively the statistics of the states in a small field. In the infinite volume limit, each spin-glass sample is characterized by an infinite number of states that have a tree-like structure. We generate the corresponding probability distribution through efficient sampling using a representation based on the Bolthausen-Sznitman coalescent. In this way, we can compute quantitatively properties in the presence of a magnetic field in the crossover region, the overlap probability distribution in the presence of a small field and the degree of decorrelation as the field is increased. To test our computations, we have simulated the Bethe lattice spin glass and the 4D Edwards-Anderson model, finding in both cases excellent agreement with the universal predictions.

cond-mat.dis-nn↗

arXiv2024

Soft modes in vector spin glass models on sparse random graphs

We study numerically the Hessian of low-lying minima of vector spin glass models defined on random regular graphs. We consider the two-component (XY) and three-component (Heisenberg) spin glasses at zero temperature, subjected to the action of a randomly oriented external field. Varying the intensity of the external field, these models undergo a zero temperature phase transition from a paramagnet at high field to a spin glass at low field. We study how the spectral properties of the Hessian depend on the magnetic field. In particular, we study the shape of the spectrum at low frequency and the localization properties of low energy eigenvectors across the transition. We find that in both phases the edge of the spectral density behaves as $λ^{3/2}$: such a behavior rules out the presence of a diverging spin-glass susceptibility $χ_{SG}=\langle 1/λ^2 \rangle$. As to low energy eigenvectors, we find that the softest eigenmodes are always localized in both phases of the two models. However, by studying in detail the geometry of low energy eigenmodes across different energy scales close to the lower edge of the spectrum, we find a different behavior for the two models at the transition: in the XY case, low energy modes are typically localized; at variance, in the Heisenberg case low-energy eigenmodes with a multi-modal structure (sort of ``delocalization'') appear at an energy scale that vanishes in the infinite size limit. These geometrically non-trivial excitations, which we call Concentrated and Delocalised Low Energy Modes (CDLEM), coexist with trivially localised excitations: we interpret their existence as a sign of critical behavior related to the onset of the spin glass phase.

cond-mat.dis-nn↗

arXiv2024

The most uniform distribution of points on the sphere

How to distribute a set of points uniformly on a spherical surface is a very old problem that still lacks a definite answer. In this work, we introduce a physical measure of uniformity based on the distribution of distances between points, as an alternative to commonly adopted measures based on interaction potentials. We then use this new measure of uniformity to characterize several algorithms available in the literature. We also study the effect of optimizing the position of the points through the minimization of different interaction potentials via a gradient descent procedure. In this way, we can classify different algorithms and interaction potentials to find the one that generates the most uniform distribution of points on the sphere.

cond-mat.stat-mech↗

arXiv2024

Stochastic Gradient Descent-like relaxation is equivalent to Metropolis dynamics in discrete optimization and inference problems

Is Stochastic Gradient Descent (SGD) substantially different from Metropolis Monte Carlo dynamics? This is a fundamental question at the time of understanding the most used training algorithm in the field of Machine Learning, but it received no answer until now. Here we show that in discrete optimization and inference problems, the dynamics of an SGD-like algorithm resemble very closely that of Metropolis Monte Carlo with a properly chosen temperature, which depends on the mini-batch size. This quantitative matching holds both at equilibrium and in the out-of-equilibrium regime, despite the two algorithms having fundamental differences (e.g.\ SGD does not satisfy detailed balance). Such equivalence allows us to use results about performances and limits of Monte Carlo algorithms to optimize the mini-batch size in the SGD-like algorithm and make it efficient at recovering the signal in hard inference problems.

cond-mat.dis-nn↗

arXiv2024

Daydreaming Hopfield Networks and their surprising effectiveness on correlated data

To improve the storage capacity of the Hopfield model, we develop a version of the dreaming algorithm that perpetually reinforces the patterns to be stored (as in the Hebb rule), and erases the spurious memories (as in dreaming algorithms). For this reason, we called it Daydreaming. Daydreaming is not destructive and it converges asymptotically to stationary retrieval maps. When trained on random uncorrelated examples, the model shows optimal performance in terms of the size of the basins of attraction of stored examples and the quality of reconstruction. We also train the Daydreaming algorithm on correlated data obtained via the random-features model and argue that it spontaneously exploits the correlations thus increasing even further the storage capacity and the size of the basins of attraction. Moreover, the Daydreaming algorithm is also able to stabilize the features hidden in the data. Finally, we test Daydreaming on the MNIST dataset and show that it still works surprisingly well, producing attractors that are close to unseen examples and class prototypes.

cond-mat.dis-nn↗

arXiv2024

Phase transitions in the mini-batch size for sparse and dense two-layer neural networks

The use of mini-batches of data in training artificial neural networks is nowadays very common. Despite its broad usage, theories explaining quantitatively how large or small the optimal mini-batch size should be are missing. This work presents a systematic attempt at understanding the role of the mini-batch size in training two-layer neural networks. Working in the teacher-student scenario, with a sparse teacher, and focusing on tasks of different complexity, we quantify the effects of changing the mini-batch size $m$. We find that often the generalization performances of the student strongly depend on $m$ and may undergo sharp phase transitions at a critical value $m_c$, such that for $m m_c$ the student learns perfectly or generalizes very well the teacher. Phase transitions are induced by collective phenomena firstly discovered in statistical mechanics and later observed in many fields of science. Observing a phase transition by varying the mini-batch size across different architectures raises several questions about the role of this hyperparameter in the neural network learning process.

cond-mat.dis-nn↗

arXiv2023

Improved mean-field dynamical equations are able to detect the two-steps relaxation in glassy dynamics at low temperatures

We study the stochastic relaxation dynamics of the Ising p-spin model on a random graph, a well-known model with glassy dynamics at low temperatures. We introduce and discuss a new closure scheme for the master equation governing the continuous-time relaxation of the system, that translates into a set of differential equations for the evolution of local probabilities. The solution to these dynamical mean-field equations describes very well the out-of-equilibrium dynamics at high temperatures, notwithstanding the key observation that the off-equilibrium probability measure contains higher-order interaction terms, not present in the equilibrium measure. In the low-temperature regime, the solution to the dynamical mean-field equations shows the correct two-step relaxation (a typical feature of the glassy dynamics), but with a relaxation timescale too short. We propose a solution to this problem by identifying the range of energies where entropic barriers play a key role and defining a renormalized microscopic timescale for the dynamical mean-field solution. The final result perfectly matches the complex out-of-equilibrium dynamics computed through extensive Monte Carlo simulations.

cond-mat.stat-mech↗

arXiv2023

Loop expansion around the Bethe approximation through the $M$-layer construction

For every physical model defined on a generic graph or factor graph, the Bethe $M$-layer construction allows building a different model for which the Bethe approximation is exact in the large $M$ limit and it coincides with the original model for $M=1$. The $1/M$ perturbative series is then expressed by a diagrammatic loop expansion in terms of so-called fat-diagrams. Our motivation is to study some important second-order phase transitions that do exist on the Bethe lattice but are either qualitatively different or absent in the corresponding fully connected case. In this case the standard approach based on a perturbative expansion around the naive mean field theory (essentially a fully connected model) fails. On physical grounds, we expect that when the construction is applied to a lattice in finite dimension there is a small region of the external parameters close to the Bethe critical point where strong deviations from mean-field behavior will be observed. In this region, the $1/M$ expansion for the corrections diverges and it can be the starting point for determining the correct non-mean-field critical exponents using renormalization group arguments. In the end, we will show that the critical series for the generic observable can be expressed as a sum of Feynman diagrams with the same numerical prefactors of field theories. However, the contribution of a given diagram is not evaluated associating Gaussian propagators to its lines as in field theories: one has to consider the graph as a portion of the original lattice, replacing the internal lines with appropriate one-dimensional chains, and attaching to the internal points the appropriate number of infinite-size Bethe trees to restore the correct local connectivity of the original model.

cond-mat.dis-nn↗