English
Related papers

Related papers: A CLuP algorithm to practically achieve $\sim 0.76…

200 papers

We study algorithmic aspects of finding $n$-dimensional \emph{positive} and \emph{negative} Hopfield ($\pm$Hop) model ground state free energies. This corresponds to classical maximization of random positive/negative semi-definite quadratic…

Disordered Systems and Neural Networks · Physics 2025-07-31 Mihailo Stojnic

We present a numerical study of ground states of the dilute versions of the Sherrington-Kirkpatrick (SK) mean-field spin glass. In contrast to so-called "sparse" mean-field spin glasses that have been studied widely on random networks of…

Disordered Systems and Neural Networks · Physics 2022-04-21 Stefan Boettcher

Based on our \bl{\textbf{Random Duality Theory (RDT)}}, in a sequence of our recent papers \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}, we introduced a powerful algorithmic mechanism (called \bl{\textbf{CLuP}}) that can be…

Information Theory · Computer Science 2020-11-24 Mihailo Stojnic

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…

Quantum Physics · Physics 2024-04-08 Eric R. Anschuetz , David Gamarnik , Bobak T. Kiani

We consider the problem of estimating the ground state energy of quantum $p$-local spin glass random Hamiltonians, the quantum analogues of widely studied classical spin glass models. Our main result shows that the maximum energy achievable…

Quantum Physics · Physics 2025-09-04 Eric R. Anschuetz , David Gamarnik , Bobak T. Kiani

We use heuristic optimization methods in extensive computations to determine with low systematic error ground state configurations of the mean-field $p$-spin glass model with $p=3$. Here, all possible triplets in a system of $N$ Ising spins…

Disordered Systems and Neural Networks · Physics 2025-08-27 Stefan Boettcher , Ginger E. Lau

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…

Statistical Mechanics · Physics 2020-09-25 Ahmed El Alaoui , Andrea Montanari

In \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19} we introduced CLuP, a \bl{\textbf{Random Duality Theory (RDT)}} based algorithmic mechanism that can be used for solving hard optimization problems. Due to their introductory…

Information Theory · Computer Science 2020-11-24 Mihailo Stojnic

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.…

Mathematical Physics · Physics 2018-04-04 Benedetto Scoppola , Alessio Troiani

This study focuses on the problem of finding ground states of random instances of the Sherrington-Kirkpatrick (SK) spin-glass model with Gaussian couplings. While the ground states of SK spin-glass instances can be obtained with branch and…

Disordered Systems and Neural Networks · Physics 2009-07-29 Martin Pelikan , Helmut G. Katzgraber , Sigismund Kobe

The free energy landscape of the Sherrington-Kirkpatrik (SK) Ising spin glass is simple in the framework of the Thouless-Anderson-Palmer (TAP) equations as each solution (which are minima of the free energy) has associated with it a nearby…

Disordered Systems and Neural Networks · Physics 2022-03-29 T. Aspelmeier , M. A. Moore

In this paper we revisit one of the classical statistical problems, the so-called sparse maximum-likelihood (ML) linear regression. As a way of attacking this type of regression, we present a novel CLuP mechanism that to a degree relies on…

Information Theory · Computer Science 2020-11-24 Mihailo Stojnic

We study the problem of testing and recovering $k$-clique Ferromagnetic mean shift in the planted Sherrington-Kirkpatrick model (i.e., a type of spin glass model) with $n$ spins. The planted SK model -- a stylized mixture of an uncountable…

Statistics Theory · Mathematics 2024-03-25 Yihan He , Han Liu , Jianqing Fan

In our companion paper \cite{Stojnicclupint19} we introduced a powerful mechanism that we referred to as the Controlled Loosening-up (CLuP) for handling MIMO ML-detection problems. It turned out that the algorithm has many remarkable…

Information Theory · Computer Science 2019-09-05 Mihailo Stojnic

We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…

Probability · Mathematics 2023-09-19 David Gamarnik , Eren Kizildag

Some interesting recent advances in the theoretical understanding of neural networks have been informed by results from the physics of disordered many-body systems. Motivated by these findings, this work uses the replica technique to study…

Disordered Systems and Neural Networks · Physics 2018-08-17 Gavin Hartnett , Edward Parker , Edward Geist

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 compute the probability of positive large deviations of the free energy per spin in mean-field Spin-Glass models. The probability vanishes in the thermodynamic limit as $P(\Delta f) \propto \exp[-N^2 L_2(\Delta f)]$. For the…

Disordered Systems and Neural Networks · Physics 2012-10-31 Giorgio Parisi , Tommaso Rizzo

The free energy of TAP-solutions for the SK-model of mean field spin glasses can be expressed as a nonlinear functional of local terms: we exploit this feature in order to contrive abstract REM-like models which we then solve by a classical…

Disordered Systems and Neural Networks · Physics 2023-07-19 Nicola Kistler , Marius Alexander Schmidt , Giulia Sebastiani

In this work we propose a single rounding algorithm for the fractional solutions of the standard LP relaxation for $k$-clustering. As a starting point, we obtain an iterative rounding $(\frac{3^p + 1}{2})$-Lagrangian Multiplier-Perserving…

Data Structures and Algorithms · Computer Science 2026-04-08 Jarosław Byrka , Yuhao Guo , Yang Hu , Shi Li , Chengzhang Wan , Zaixuan Wang
‹ Prev 1 2 3 10 Next ›