Skip to content

Persistent Tri-State Message Passing

Jan 2026 · 0 citations · 33 references
Computer Science Mathematics

TL;DR

Permuting complete weight vectors between samples quantifies the same role-state dependence while preserving their empirical distribution in Persistent Tri-State Message Passing, which combines persistent additive, subtractive, and inactive roles with weights computed from each sample's endpoint states.

Abstract

In stochastic message passing, an edge's sampled role changes the node states used to compute adaptive weights at later layers. Weight averaging therefore depends on whether edge roles persist across layers or are resampled at each layer. We study this dependence in Persistent Tri-State Message Passing (P3MP), which combines persistent additive, subtractive, and inactive roles with weights computed from each sample's endpoint states. For two layers, we separate target-state feedback from weight-source covariance and derive the condition under which local and shared weights reverse their preactivation ordering. Shared weights retain a $1/K$ fraction of the feedback for $K$ samples. The interaction is zero for a source-only scorer. Permuting complete weight vectors between samples quantifies the same role-state dependence while preserving their empirical distribution. Exact enumeration and feature-only checkpoint measurements agree with the analytical predictions. Across independently trained feature-only models, local weights yield higher accuracy and lower negative log-likelihood under persistence, while shared weights yield higher accuracy and lower loss under layerwise resampling. The same accuracy ordering holds on deduplicated Chameleon and Squirrel.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

From Truncation to Commitment: Persistent Context in Uniform Discrete Diffusion

Uniform-state discrete diffusion models update all tokens in parallel while keeping every position revisable. Even when the commonly used top-$p$ rule leaves only one candidate at a position, that choice affects only the current reverse step and can be revised at the next sampling step. We ask what changes when selecte...

Satoshi Hayakawa · 1 citation
#machine learning Preprint Sep 2026

LARC: Low-Rank Adaptive Residual Connections for Learning in Frozen Models

Low-Rank Adaptive Residual Connections (LARC) give a frozen model a compact numerical state that can learn from feedback. The map $h+BAh$ adds a low-rank correction to a hidden representation. A slow state $\rho$ learns starting factors across tasks; a private fast state $\Phi$ copies them, changes with feedback, and r...

Jun-Yi Zou, Avrova Donz · 1 citation
#machine learning Preprint Oct 2026

Error Correction in Trained TTT Layers

Test-time-training (TTT) layers update fast-weight memory while processing an input sequence. A gradient-based update, however, does not by itself establish how the memory revises an existing association. We study the structure and empirical role of prediction-derived updates in released TTT implementations. For dot-pr...

Yu-He Hu · 0 citations
#machine learning Preprint Sep 2026

Beyond the Previous Layer: Residual Predictive Structure in Sparse MoE Routing

Using frozen OLMoE and JetMoE models, residual predictive structure in expert-selection trajectories beyond adjacent-layer persistence is identified, identifying residual predictive structure in expert-selection trajectories beyond adjacent-layer persistence.

Hao Li, Yasuyuki Tahara, Y. Sei · 0 citations
#artificial intelligence Preprint Oct 2026

Evaluating Trajectory Features for Routing Final-Layer Attention

Attention routing requires a signal that predicts the value of attention on the current prefix. We evaluate whether hidden-state extrapolation error, curvature and error change improve this prediction beyond uncertainty, one-step displacement, position and state projections. Paired executions of the final attention lay...

Yuan Yao · 0 citations

When Recursive Models Finish Computing

The results distinguish nominal-budget failure from completed computation and identify a common dynamical signature of completion across two recurrent architectures.

Hare Krishna, Shubham Singh, Stephen Ebert et al. · 1 citation

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.