Related papers: Tight Lipschitz Hardness for Optimizing Mean Field…
Constraint Satisfaction Problems are ubiquitous in fields ranging from the physics of solids to artificial intelligence. In many cases, such systems undergo a transition when the ratio of constraints to variables reaches some value…
Spin glasses are models of statistical mechanics in which a large number of simple elements interact with one another in a disordered fashion. One of the fundamental results of the theory is the Parisi formula, which identifies the limit of…
The recent proof by F. Guerra that the Parisi ansatz provides a lower bound on the free energy of the SK spin-glass model could have been taken as offering some support to the validity of the purported solution. In this work we present a…
We have studied the Parisi overlap distribution for the three dimensional Ising spin glass in the Migdal-Kadanoff approximation. For temperatures T around 0.7Tc and system sizes upto L=32, we found a P(q) as expected for the full Parisi…
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…
We study the fluctuation problems at high temperature in the general mixed $p$-spin glass models under the weak external field assumption: $h= \rho N^{-\alpha}, \rho>0, \alpha \in [1/4,\infty]$. By extending the cluster expansion approach…
We study a class of optimization problems on Riemannian manifolds, where the objective function consists of a smooth term and quasi-norm type penalties with exponent $p \in (0, 1]$. The essential difficulty lies in the fact that the…
The problem of optimizing over random structures emerges in many areas of science and engineering, ranging from statistical physics to machine learning and artificial intelligence. For many such structures finding optimal solutions by means…
In the present paper we have analysed a fermionic infinite-ranged quantum Heisenberg spin glass (s=1/2) with a BCS coupling in real space in the presence of an applied magnetic field. This model has been obtained by tracing out the…
We study the phenomenon of the locking of the order parameter (or synchronization) in spin glasses at low temperatures. When two systems with independent disorders are coupled, their overlaps become similar. A crucial question is how this…
Replica symmetry breaking postulates that near optima of spin glass Hamiltonians have an ultrametric structure. Namely, near optima can be associated to leaves of a tree, and the Euclidean distance between them corresponds to the distance…
Universality, namely distributional invariance, is a well-known property for many random structures. For example, it is known to hold for a broad range of variational problems with random input. Much less is known about the algorithmic…
Given a graph $G$ of degree $k$ over $n$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth $2L$, we develop a local message passing algorithm whose…
We study the convergence problem for mean field control, also known as optimal control of McKean-Vlasov dynamics. We assume that the data is smooth but not convex, and thus the limiting value function $\mathcal{U} :[0,T] \times…
The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number…
Spin glass models involving multiple replicas with constrained overlaps have been studied in [FPV92; PT07; Pan18a]. For the spherical versions of these models [Ko19; Ko20] showed that the limiting free energy is given by a Parisi type…
The goal of Sparse Convex Optimization is to optimize a convex function $f$ under a sparsity constraint $s\leq s^*\gamma$, where $s^*$ is the target number of non-zero entries in a feasible solution (sparsity) and $\gamma\geq 1$ is an…
In this paper, we study the low temperature limit of the spherical Crisanti-Sommers variational problem. We identify the $\Gamma$-limit of the Crisanti-Sommers functionals, thereby establishing a rigorous variational problem for the ground…
We report progress in understanding the fermionic Ising spin glass with arbitrary filling. A crossover from a magnetically disordered single band phase via two intermediate bands just below the freezing temperature to a 3-band structure at…
We consider the algorithmic problem of finding a near-optimal solution for the number partitioning problem (NPP). The NPP appears in many applications, including the design of randomized controlled trials, multiprocessor scheduling, and…