Related papers: Solving Spin Glasses with Optimized Trees of Clust…
A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order…
Number partitioning is a classical problem from combinatorial optimisation. In physical terms it corresponds to a long range anti-ferromagnetic Ising spin glass. It has been rigorously proven that the low lying energies of number…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
Optimization plays a significant role in many areas of science and technology. Most of the industrial optimization problems have inordinately complex structures that render finding their global minima a daunting task. Therefore, designing…
Optimization problems pose challenges across various fields. In recent years, quantum annealers have emerged as a promising platform for tackling such challenges. To provide a new perspective, we develop a heuristic tensor network (TN)…
In a recent paper we found strong evidence from simulations that the Isingantiferromagnet on ``thin'' random graphs - Feynman diagrams - displayed amean-field spin glass transition. The intrinsic interest of considering such random graphs…
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…
Spin-glasses are Gibbs distributions that have been studied in CS for many decades. Recently, they have gained renewed attention as they emerge naturally in learning, inference, optimisation etc. We consider the Edwards-Anderson (EA)…
We develop a theory to investigate how geometrically frustrated clusters that become decorated affect the Cluster Spin Glass phase. The cluster structure is assumed to be a tetrahedron composed of Ising spins with z-anisotropy placed at its…
Spin glasses are notoriously difficult to study both analytically and numerically due to the presence of frustration and metastability. Their highly non-convex landscapes require collective updates to explore efficiently. Currently, most…
We discuss a dynamical systems perspective on discrete optimization. Departing from the fact that many combinatorial optimization problems can be reformulated as finding low energy spin configurations in corresponding Ising models, we…
We study the four dimensional (4D) $\pm J$ Ising spin glass in a magnetic field by using the simulated tempering method recently introduced by Marinari and Parisi. We compute numerically the first four moments of the order parameter…
We consider the problem of learning the underlying graph of an unknown Ising model on p spins from a collection of i.i.d. samples generated from the model. We suggest a new estimator that is computationally efficient and requires a number…
Let ${\boldsymbol A}\in{\mathbb R}^{n\times n}$ be a symmetric random matrix with independent and identically distributed Gaussian entries above the diagonal. We consider the problem of maximizing $\langle{\boldsymbol \sigma},{\boldsymbol…
We introduce a new family of energy-based probabilistic graphical models for efficient unsupervised learning. Its definition is motivated by the control of the spin-glass properties of the Ising model described by the weights of Boltzmann…
Recent numerical simulations indicate that several different equilibrium glass transitions may be characterized by diverging correlation lengths, and that these divergences are described by a non-mean-field, Ising-like, critical exponent. I…
Treemaps have been widely applied to the visualization of hierarchical data. A treemap takes a weighted tree and visualizes its leaves in a nested planar geometric shape, with sub-regions partitioned such that each sub-region has an area…
Optimal transport is a foundational problem in optimization, that allows to compare probability distributions while taking into account geometric aspects. Its optimal objective value, the Wasserstein distance, provides an important loss…
The race to heuristically solve non-deterministic polynomial-time (NP) problems through efficient methods is ongoing. Recently, optics was demonstrated as a promising tool to find the ground state of a spin-glass Ising Hamiltonian, which…
We compute the complexity (logarithm of the number of TAP states) associated with minima and index-one saddle points of the TAP free energy. Higher-index saddles have smaller complexities. The two leading complexities are equal, consistent…