Unverified 2026

Criticality-Gated Resolution Switching

Implementation & benchmark of arXiv:2607.11661 — Thermal phase transitions in a mixed-spin Ising model on the Lieb lattice: Exact results beyond zero magnetic field

Usefulness5/10

Difficulty6/10

Novelty8/10

Dynamics Stability Accuracy Speedup Graph nn Cnn Transformer Inference speedup Statistical mechanics Renormalization Bifurcations Dynamical systems

Source paper: Thermal phase transitions in a mixed-spin Ising model on the Lieb lattice: Exact results beyond zero magnetic field arXiv:2607.11661 ⓘ · analyzed Aug 30, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Use effective coupling and field values from a local coarse-grained motif to decide whether a neural network should operate at fine or coarse resolution. Near the continuous critical boundary, retain fine-scale features because correlations become long-ranged; away from criticality, aggregate aggressively. Near discontinuous or reentrant boundaries, hysteresis prevents rapid switching between resolutions.

Formulas

$$K_c=\frac{1}{2}\log(1+\sqrt{2}),\qquad r=|K_{\mathrm{eff}}-K_c|,\qquad q=|h_{\mathrm{eff}}|$$

$$\xi\propto |K_{\mathrm{eff}}-K_c|^{-\nu},\qquad \nu=1$$

$$g_{t+1}=\begin{cases}1,&r_t<\delta_{\mathrm{on}}\ \text{or}\ q_t<\delta_h\\0,&r_t>\delta_{\mathrm{off}}\ \text{and}\ q_t\geq\delta_h\end{cases}$$

Mathematical statement

For the effective zero-field square-lattice Ising model, the continuous transition occurs at the dimensionless coupling $K_c=\frac12\log(1+\sqrt2)$, where $K_{\mathrm{eff}}=\beta J_{\mathrm{eff}}$. Define the criticality score $r=|K_{\mathrm{eff}}-K_c|$ and symmetry score $q=|h_{\mathrm{eff}}|$. The two-dimensional Ising correlation length scales as $\xi\sim |K_{\mathrm{eff}}-K_c|^{-\nu}$, with critical exponent $\nu=1$. A resolution controller selects fine processing when $r$ is below an activation threshold or when the effective field is sufficiently small. Hysteresis uses an activation threshold $\delta_{\mathrm{on}}$ smaller than a deactivation threshold $\delta_{\mathrm{off}}$, preventing chattering.

Implementation notes

1. Integration point: add a controller to a hierarchical GNN, multiscale CNN, or token-merging transformer. Each local patch or graph motif produces $K_{\mathrm{eff}}$ and $h_{\mathrm{eff}}$; these values control whether its fine tokens or nodes are retained or merged into one coarse token. 2. Pseudocode: for each patch compute the three local weights by summing over the auxiliary state; calculate Keff and heff; set fine=True if abs(Keff-Kc)<delta_on or abs(heff)<delta_h; if the previous state was fine, retain it until abs(Keff-Kc)>delta_off; route fine patches through the expensive block and coarse patches through pooling plus a cheap block. 3. The paper supplies the effective-parameter construction and the critical coupling; $\delta_K$, $\delta_h$, the pooling operator, and residual neural blocks are estimated by validation. 4. First cheap experiment: use CIFAR-10 with synthetic decorated image patches, comparing fixed-resolution hierarchical processing against the controller at matched accuracy and FLOPs. Estimate feature correlation length from spatial autocorrelation. The predicted signature is $\xi$ increasing approximately as $|K_{\mathrm{eff}}-K_c|^{-1}$, with the controller retaining the most tokens in a band around $K_c$. Under a sweep of the synthetic coupling, the mean token count should switch near the prescribed hysteresis thresholds rather than at an arbitrary training-dependent point.

Verification

This idea has not been verified yet.

Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.

Artifacts

Artifacts unavailable.