AI & ML
How Path Integral Diffusion Decides a Finite Spin Glass
arXiv stat.ML0 views
arXiv:2611.11826v2 Announce Type: replace-cross Abstract: When an AI diffusion-type generator samples a frustrated spin glass, which macroscopic alternatives does it decide first, and when? We study this for bridge-diffusion models of the Path Integral Diffusion (PID) type started from a point source. We show that every isotropic PID is a time-changed Gaussian stochastic localization, and conversely every signal-to-noise schedule is realized by a PID protocol. What a continuous-time generator decides therefore does not depend on the protocol, which only sets when and at what cost. We describe the generator's state by its partial commitments: the probabilities it assigns, at each moment, to nested classes of configurations fixed by the target. The partial commitments are martingales that move only along class contrasts. Their ensemble average gives the information about each level at an exact rate set by squared magnetization contrasts. In the balanced, effectively binary approximation, a split reaches half of its class information near \gamma=1.044/\lambda_P, where \lambda_P is the leading eigenvalue of the parent covariance. The theory is applied to Bethe-lattice and Sherrington--Kirkpatrick (SK) glasses with up to 24 spins. It is observed generically that a trajectory first shifts its weight to one of the two mirror halves of the zero-field measure and then to the glassy classes inside it. These classes appear near the glass transition, keep their identity on cooling and are absent in a ferromagnet on the same graphs. Sparse (Bethe) and dense (SK) glasses differ in how often and how strongly such classes exist, not in how trajectories commit to them. For a generator that takes finitely many steps, the protocol matters through the late, local stage rather than the macroscopic decisions. Sampled posteriors at N=32,64 and small trained denoisers show the same sequence.
Source:https://arxiv.org/abs/2611.11826PreviousPrescriptive Learning of Linear Policies with Feasibility Guarantees for Binary Decision-MakingNextA Matching Lower Bound for Online Smooth Calibration
Related posts
Re-Testing LLM-Based C-to-Rust Translations Against Their Original C
0arXiv cs.SE
Reliability is a user-specific property of large language models
0arXiv cs.SE
Safe Personal RSI: Evaluating and Repairing Personal-Agent Updates
0arXiv cs.SE
Option-GRPO: Hierarchical RL Against AI Slop in Code Generation for Unseen SDKs
0arXiv cs.SE
Systematic Mapping Protocol. Generative AI-Augmented Requirements Engineering: A Systematic Mapping Study of Practices, Specifications, and Reuse in Software Development
0arXiv cs.SE
RootSink: Reproducible C/C++ Crashes with Tested Repair Sites
0arXiv cs.SE