相关论文: Improved extremal optimization for the Ising spin …

We compare the performance of extremal optimization (EO), flat-histogram and equal-hit algorithms for finding spin-glass ground states. The first-passage-times to a ground state are computed. At optimal parameter of tau=1.15, EO outperforms…

Extremal Optimization (EO), a new local search heuristic, is used to approximate ground states of the mean-field spin glass model introduced by Sherrington and Kirkpatrick. The implementation extends the applicability of EO to systems with…

We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two extremal cases are considered: (1) the +/- J spin glass, and…

The recently proposed Hysteretic Optimization (HO) procedure is applied to the 1D Ising spin chain with long range interactions. To study its effectiveness, the quality of ground state energies found as a function of the distance dependence…

We analyze the transformation of QUBO from its conventional Boolean presentation into an equivalent spin glass problem with coupled $\pm1$ spin variables exposed to a site-dependent external field. We find that in a widely used testbed for…

We propose a general learning algorithm for solving optimization problems, based on a simple strategy of trial and adaptation. The algorithm maintains a probability distribution of possible solutions (configurations), which is updated…

A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…

The scaling of fluctuations in the distribution of ground-state energies or costs with the system size N for Ising spin glasses is considered using an extensive set of simulations with the Extremal Optimization heuristic across a range of…

Due to an extremely rugged structure of the free energy landscape, the determination of spin-glass ground states is among the hardest known optimization problems, found to be NP-hard in the most general case. Owing to the specific structure…

We analyze the zero-temperature behavior of the XY Edwards-Anderson spin glass model on a square lattice. A newly developed algorithm combining exact ground-state computations for Ising variables embedded into the planar spins with a…

We establish that in the large degree limit, the value of certain optimization problems on sparse random hypergraphs is determined by an appropriate Gaussian optimization problem. This approach was initiated in Dembo et. al.(2016) for…

We present the results obtained with an end-to-end simulator of an Extreme Adaptive Optics (XAO) system control loop. It is used to predict its on-sky performances and to optimise the AO loop algorithms. It was first used to validate a…

Ising machines are purported to be better at solving large-scale combinatorial optimisation problems better than conventional von Neumann computers. However, these Ising machines are widely believed to be heuristics, whose promise is…

We present an algorithm for the optimization and thermal equilibration of spin glasses - or more generally, cost functions of the Ising form $H=\sum_{\langle i j\rangle} J_{ij} s_i s_j + \sum_i h_i s_i$, defined on graphs with arbitrary…

The minimax excess risk optimization (MERO) problem is a new variation of the traditional distributionally robust optimization (DRO) problem, which achieves uniformly low regret across all test distributions under suitable conditions. In…

We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems, including Quadratic Unconstrained Binary Optimization (QUBO), Ising spin glasses ($p$-spin model), and $k$-local…

We explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent…

It is commonly believed that Bayesian optimization (BO) algorithms are highly efficient for optimizing numerically costly functions. However, BO is not often compared to widely different alternatives, and is mostly tested on narrow sets of…

We use a non-equilibrium simulation method to study the spin glass transition in three-dimensional Ising spin glasses. The transition point is repeatedly approached at finite velocity $v$ (temperature change versus time) in Monte Carlo…

The central object of this PhD thesis is known under different names in the fields of computer science and statistical mechanics. In computer science, it is called the Maximum Cut problem, one of the famous twenty-one Karp's original…