Related papers: Counting solutions for the CDMA multiuser MAP demo…
We consider whether it is possible to find ground states of frustrated spin systems by solving them locally. Using spin glass physics and Imry-Ma arguments in addition to numerical benchmarks we quantify the power of such local solution…
Consider communication over a binary-input memoryless output-symmetric channel with low density parity check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic…
Focusing on the optimization version of the random K-satisfiability problem, the MAX-K-SAT problem, we study the performance of the finite energy version of the Survey Propagation (SP) algorithm. We show that a simple (linear time)…
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…
C-dismantling (CD) problem aims at finding the minimum vertex set D of a graph G(V,E) after removing which the remaining graph will break into connected components with the size not larger than C. In this paper, we introduce a spin-glass…
We devise a deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems. We employ tensor networks to represent the Gibbs distribution of all possible…
We analyze the replica-symmetry-breaking construction in the Sherrington-Kirkpatrick model of a spin glass. We present a general scheme for deriving an exact asymptotic behavior near the critical temperature of the solution with an…
Microdisk or microring modulators (MDMs or MRMs) realize compact electro-optic modulation in active silicon photonics (SiP) foundry platforms. A key advantage of these resonant modulators is that they readily implement dense wavelength…
Motivated by several applications, we consider the problem of randomly rounding a fractional solution in a matroid (base) polytope to an integral one. We consider the pipage rounding technique and also present a new technique, randomized…
The concept of replica symmetry breaking found in the solution of the mean-field Sherrington-Kirkpatrick spin-glass model has been applied to a variety of problems in science ranging from biological to computational and even financial…
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…
As a multi-purpose Particle-In-Cell (PIC) code, Smilei gathers many different features in a single software. Combining some of them is challenging. In particular, spectral solvers and patch based load balancing have a priori non compatible…
We consider energy relaxation of the long-range spin glass model with sparse couplings, the so-called dilute Sherrington-Kirkpatrick (SK) model, starting from a random initial state. We consider the effect that modularity of the coupling…
The Sherrington-Kirkpatrick (SK) is a foundational model for understanding spin glass systems. It is based on the pairwise interaction between each two spins in a fully connected lattice with quenched disordered interactions. The nature of…
We describe a general approach for maximum a posteriori (MAP) inference in a class of discrete-continuous factor graphs commonly encountered in robotics applications. While there are openly available tools providing flexible and easy-to-use…
Following an original idea of F. Guerra, in this notes we analyze the Sherrington-Kirkpatrick model from different perspectives, all sharing the underlying approach which consists in linking the resolution of the statistical mechanics of…
In this paper, we consider the minimum submodular cost allocation (MSCA) problem. The input of MSCA is $k$ non-negative submodular functions $f_1,f_2,\ldots,f_k$ on the ground set $N$ given by evaluation oracles, and the goal is to…
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…
Many computer vision problems require optimization of binary non-submodular energies. We propose a general optimization framework based on local submodular approximations (LSA). Unlike standard LP relaxation methods that linearize the whole…
Wireless sensor networks are normally characterized by resource challenged nodes. Since communication costs the most in terms of energy in these networks, minimizing this overhead is important. We consider minimum length node scheduling in…