For random order-p tensors with large p, the largest average k×...×k subtensor concentrates around sqrt(2p log(N choose k)/k^p), a greedy algorithm achieves a 2√p/(p+1) fraction of it, and an overlap gap property blocks stable algorithms above any constant fraction.
Boolean SK Model
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
For over half a century, statistical mechanics of spin glasses played as a paradigm to model and interpret disparate phenomena, ranging from quantitative biology to computer science. However, despite the extensive body of research in this area, there is still a notable lack of studies addressing the replacement of Ising spins with Boolean spins: as the latter play as bits in Machine Learning, this gap to fill is now mandatory. Purpose of this paper is to address this study by focusing on the mean field assumption, providing a comprehensive description of the results pertaining to these networks, referred to as the Boolean SK model due to their close relationship with the SK one. We provide a comprehensive framework for this model by employing Guerra interpolation: the thermodynamic limit, the replica symmetric and the broken replica free energy expressions are derived. Further, we inspect the onset of the replica symmetry breaking -- i.e., the de Almeida-Thouless line -- and derive Ghirlanda-Guerra fluctuations. All theoretical findings are corroborated by numerical inspections and both highlight crucial differences in the network's behavior if compared with the Ising SK model: as the temperature is lowered, no phase transitions are evidenced and the model continuously moves from a random (ergodic) behavior to a disordered (glassy) phase.
fields
math.ST 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
For random order-p tensors with large p, the largest average k×...×k subtensor concentrates around sqrt(2p log(N choose k)/k^p), a greedy algorithm achieves a 2√p/(p+1) fraction of it, and an overlap gap property blocks stable algorithms above any constant fraction.