相关论文: Extremal Optimization for Sherrington-Kirkpatrick …
We focus on spherical spin glasses whose Parisi distribution has support of the form $[0,q]$. For such models we construct paths from the origin to the sphere which consistently remain close to the ground-state energy on the sphere of…
We employ a novel algorithm using a quasi-exact embedded-cluster matching technique as minimization method within a genetic algorithm to reliably obtain numerically exact ground states of the Edwards-Anderson XY spin glass model with…
Extremal Optimization, a recently introduced meta-heuristic for hard optimization problems, is analyzed on a simple model of jamming. The model is motivated first by the problem of finding lowest energy configurations for a disordered spin…
We study the probability distribution P(E) of the ground state energy E in various Ising spin glasses. In most models, P(E) seems to become Gaussian with a variance growing as the system's volume V. Exceptions include the…
We present a large-scale simulation of the ground state interface properties of the diluted Sherrington-Kirkpatrick spin glass of Gaussian disorder for a broad range of the bond occupation probability $p$ using the strong disorder…
The ground-state energy E_0 of a spin glass is an example of an extreme statistic. We consider the large deviations of this energy for a variety of models when the number of spins N goes to infinity. In most cases, the behavior can be…
Extensive computations of ground state energies of the Edwards-Anderson spin glass on bond-diluted, hypercubic lattices are conducted in dimensions d=3,..,7. Results are presented for bond-densities exactly at the percolation threshold,…
A recently introduced general-purpose heuristic for finding high-quality solutions for many hard optimization problems is reviewed. The method is inspired by recent progress in understanding far-from-equilibrium phenomena in terms of {\em…
We present a collection of simulations of the Edwards-Anderson lattice spin glass at $T=0$ to elucidate the nature of low-energy excitations over a range of dimensions that reach from physically realizable systems to the mean-field limit.…
It is a folklore belief in the theory of spin glasses and disordered systems that out-of-equilibrium dynamics fail to find stable local optima exhibiting e.g. local strict convexity on physical time-scales. In the context of the…
Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in…
We consider the problem of estimating the maximal energy of quantum $p$-local spin glass random Hamiltonians, the quantum analogues of widely studied classical spin glass models. Denoting by $E^*(p)$ the (appropriately normalized) maximal…
The Quantum Approximate Optimization Algorithm (QAOA) achieves monotonically improving performance with circuit depth $p$, yet the study of the high-depth regime has been obstructed by the exponential in $p$ cost of existing exact…
The Sherrington-Kirkpatrick spin glass model has been studied as a source of insight into the statistical mechanics of systems with highly diversified collections of competing low energy states. The goal of this summary is to present some…
We propose Orthogonalized Policy Optimization (OPO), a principled framework for large language model alignment derived from optimization in the Hilbert function space L2(pi_k). Lifting policy updates from the probability simplex into…
For the statistics of global observables in disordered systems, we discuss the matching between typical fluctuations and large deviations. We focus on the statistics of the ground state energy $E_0$ in two types of disordered models : (i)…
We study rigorously a lattice gas version of the Sherrington-Kirckpatrick spin glass model. In discrete optimization literature this problem is known as Unconstrained Binary Quadratic Programming (UBQP) and it belongs to the class NP-hard.…
The Quantum Approximate Optimization Algorithm (QAOA) is a general-purpose algorithm for combinatorial optimization problems whose performance can only improve with the number of layers $p$. While QAOA holds promise as an algorithm that can…
From the study of a functional equation of Gibbs measures we calculate the limiting free energy of the Sherrington-Kirkpatrick spin glass model at a particular value of (low) temperature. This implies the following lower bound for the…
Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on…