- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes a training-time principle called "local predictive sufficiency" for recursive state compression across four domains: temporal graphs, language memory, vision-language-action (VLA) control, and recursive self-improvement (SRI). Starting from conditional mutual information on a rooted tree, the authors approximate the local predictive loss via finite random sketches and ridge-profiled covariance statistics (essentially a regularized CCA / linear readout gap), and then constrain the host optimizer's parameter update using half-space gradient projection (similar to GEM/A-GEM in continual learning). While regularizing intermediate state compression exclusively at training time without adding test-time overhead is a neat idea, the paper fails to clearly communicate its core mechanism. Instead, it buries a relatively standard continual-learning-style gradient constraint + local linear probe beneath 64 pages of heavy measure-theoretic packaging and a sprawling, superficial 4-domain evaluation. Overall, the presentation creates an unnecessary reading burden without going deep into the actual bottlenecks of any single domain. I lean toward Weak Reject.
Critical strengths
1.Training-time intervention without inference overhead: Focusing on constraining parameter updates during training so that the recursive compressor retains predictive features—while keeping the inference pass and memory budget identical to the host model—is a practical and clean design choice.
2.Conceptual motivation: Recognizing that endpoint (root) supervision attenuates over deep recursive paths and attempting to regularize intermediate compression interfaces locally is well-motivated.
Critical weaknesses
1.Excessive Mathematical Packaging Over a Standard Mechanism (Lack of Conceptual Clarity): Stripping away the heavy formalism (standard Borel spaces, kernel disintegrations, and variational KL characterizations in Section 2 and Appendix F), the actual algorithm in Section 3 is quite simple: it measures the drop in ridge-regression / CCA linear predictability of sketched future features () before and after compression (), and applies a GEM/A-GEM-style half-space projection () to prevent the task gradient from increasing this local loss. This is essentially a continual-learning-style gradient constraint (or auxiliary KL/prediction regularization) applied to intermediate representations. Rather than clarifying why a linear sketch readout in a 32- or 64-dimensional random subspace suffices to preserve complex recursive semantics, the paper spends puluhan pages on measure-theoretic derivations that are disconnected from the heavily approximated empirical estimator. This over-packaging obscures the essence of the method and severely hurts readability.
2.Inconsistent Instantiations Across Domains ("Unified Principle" vs. Ad-hoc Fine-tuning): Although the paper claims to validate a single unified optimization principle (Proposition 2, half-space projection) and uses Table 2 to argue that constrained projection is vastly superior to an Additive Predictive-Gradient Update, the actual implementations in Appendix E tell a different story:
In Language Memory (CCM) (Appendix E.2, p. 38 & Table 21, p. 44), the authors omit the projection mechanism altogether and fall back to "direct aggregate specialization" with —which is simply adding the auxiliary gradient with a scalar weight, directly contradicting the ablation claim in Table 2. In SRI (Meta$^n$) (Appendix E.4), the method turns into offline training of a tiny 4-slot attention gating module on frozen archives using CCA scores. In VLA, the host backbone is completely frozen and only a small module is fine-tuned for a few thousand steps. stitching four very different ad-hoc fine-tuning recipes together under one theoretical umbrella makes the paper prioritize breadth over unified depth rather than a solid, unified algorithmic contribution. Superficial Domain Coverage that Misses Domain-Specific Bottlenecks: In rushing to show cross-domain generality across four disparate tasks, the paper fails to engage with the fundamental challenges of each domain:
Temporal Graphs: The core bottleneck in deeper temporal GNNs (like TGN) is not merely 1D state compression loss, but the loss of high-order structural and topological expressiveness (e.g., structural neighborhood identity, joint spatio-temporal correlation). Simply constraining a node's 1D state vector to linearly predict an adjacent event pair does nothing to resolve structural expressiveness limits. This is evident in Table 1(a): on UCI Depth 3, adding this constraint onto TGN still trails DyGFormer (which explicitly models structural/patch interactions), and on Depth 4 the gain over vanilla TGN (94.07 94.89 AP) is marginal and matches DyGFormer within noise.
Sequence / Memory Modeling: In recurrent or linear-attention-style state compression, the fundamental challenge is managing fixed-capacity memory collisions (i.e., selective forgetting/erasure of obsolete keys, as addressed by Delta-rule / TTT mechanisms) and capturing long-range dependencies where information remains silent for many steps before being recalled. The paper's Markov tree assumption (M1) and adjacent-pair target are inherently myopic: if an early piece of information is not useful for the immediate next step but is critical 10 steps later, local sufficiency with respect to provides no protection against discarding it.
3.Weak and Outdated Baselines / Limited Experimental Depth: Because the paper spreads itself thin across four areas, the evaluation in each area is narrow. In Language Memory, the method is only tested as a tiny residual adapter on top of a single host (CCM-merge) with minimal perplexity differences on MSC (e.g., 7.96 vs. 7.96 / 8.16 vs. 8.14 on Gemma), without comparing against stronger modern context-compression or linear/recurrent memory architectures. In VLA, the evaluation is restricted to 20 rollouts on a single setting (LIBERO-Mem T3), where completing just 1 or 2 more repetitions out of 20 rollouts swings the strict SR from 1.7% to 11.7%.
Questions for authors
1.Why does Table 2 on UCI claim that Additive Predictive-Gradient Update fails to improve over task-only training (92.64 vs. 92.62 AP), yet in the Language Memory experiments (Appendix E.2 & Table 21) you drop the feasibility projection and use an additive predictive gradient () anyway?
2.How does the adjacent predictive pair preserve information that has a "silent period" (i.e., conditionally independent of the immediate parent event , violating assumption M1, but required at the root )?
3.In temporal graphs, how can a local predictive constraint on TGN's aggregated vector address the structural bottleneck (e.g., failure to distinguish non-isomorphic temporal neighborhoods), which is the primary reason message-passing TGNs underperform structural models like DyGFormer?
2 comments
Responses to the Three Questions
Q1. Additive Predictive-Gradient Update.
Please refer to our response to Reviewer 7WAH, W5 (1/2), where we have already clarified this implementation choice and provided the corresponding projection analysis.
Q2. Silent Periods and Predictive Sufficiency.
The key distinction is between information being temporarily unexpressed in an intermediate observation and information being absent from the predictive boundary.
Under M1, the predictive boundaries satisfy . By the data-processing inequality,
Consequently, if an earlier predictive event carries no information about its parent boundary, it cannot suddenly become informative about the root through the same Markov chain. Conversely, information relevant to the root must retain a predictive dependence through the intervening boundaries, even when it is not expressed in an intermediate observation.
A construction in which this information disappears from the parent boundary yet reappears at the root necessarily introduces a dependency outside M1. The adjacent-pair sufficiency principle preserves information along the stipulated predictive dependencies; it does not assume that information can disappear and subsequently reappear without an information-carrying path.
Q3. Temporal Graph Structural Expressivity.
Our method addresses predictive information loss during recursive compression, rather than the structural expressivity of the underlying graph architecture. We do not claim to resolve TGN's inability to distinguish certain non-isomorphic temporal neighborhoods. Instead, our results demonstrate that preserving predictive information improves performance within the same TGN architecture, without modifying its structural modeling capacity. This mechanism is complementary to the architectural improvements introduced by models such as DyGFormer.
This concludes our rebuttal to your review. We have no further points to address.
Response Regarding the Review
We thank the reviewer for identifying two useful issues: finite-sketch justification and the distinction between our predictive-preservation principle and host-specific optimizers. We acknowledge that our presentation could improve.
1. Finite sketches and the theory–estimator connection.
For a properly normalized isotropic random sketch R satisfying E[RRT]=I, we obtain
E[(RTe)T(RTe)]=eTE[RRT]e=eTe.
This concerns squared predictive error in expectation, not exact recovery of conditional mutual information by the ridge/covariance estimator. Appendix F.3 therefore derives an additional conditional approximation bound: Corollary F.1 separates finite-test coverage, linear-readout, and sampling residuals, while F.3.5 derives the gradient of the implemented empirical objective. The theory–estimator connection is explicitly analyzed, not absent. Our responses to other reviewers provide quantitative toy-model comparisons with analytically accessible information-theoretic quantities and finite-step update audits. Please consult those results.
2. Factual discrepancies and selective interpretation.
The CCM silent-period objection presumes exclusively adjacent-event prediction. Yet CCM recursively updates and reuses compressed memory, and Appendix E.2 explicitly includes both nearby future observations and the eventual response target in intermediate supervision. A counterexample against next-event-only prediction does not describe our implementation. The CCM aggregate predictive-gradient update is also disclosed in Appendix E.2 and Table 21. We could have explained this specialization more clearly; describing a documented choice as something we "quietly abandon" insinuates concealment without evidence. A UCI-specific projection ablation does not establish that all hosts require the same optimizer.
The characterization of our baselines as "weak and outdated" overlooks CTAN (ICML 2024), CCM (ICLR 2024), Metaⁿ (2026; CO-Bench, AAAI 2026), and MemoryVLA (ICLR 2026; LIBERO-Mem, AAAI 2026). These are relevant, contemporary host architectures and benchmarks, not an outdated evaluation.More comparisons may be useful; the existing evaluation is not therefore obsolete. The review highlights DyGFormer's UCI Depth-3 advantage without adequately acknowledging our higher reported UCI Depth-4 AUC and stronger Wikipedia results. Likewise, it foregrounds minimal MSC PPL differences while underrepresenting the depth-dependent DailyDialog findings. Selecting unfavorable comparisons while leaving out relevant countervailing results can mislead readers, regardless of intent.
3. Research scope, professional standards, and Confidence 4.
Our work formulates and analyzes a general information-theoretic principle for predictive preservation under recursive compression, then studies its realization in heterogeneous hosts. It does not claim to solve the central architectural bottleneck of each domain or to win four SOTA competitions. DyGFormer is a purpose-built structural architecture; cross-architecture rankings provide context but cannot replace matched-host tests of predictive preservation. Nor does identifying familiar CCA, ridge, and projection components establish that the preceding theoretical propositions lack novelty. Calling the mathematical analysis "packaging" is not a substitute for identifying a redundant theorem or incorrect proof; detailed derivations are placed in the appendix.
We accept that the manuscript can be difficult to follow, and we respect the right to recommend rejection, including a rating of 2. But terms such as "vibe-engineered," "rushing to show cross-domain generality," and "quietly abandon" do not establish technical flaws. They insinuate questionable motives or research practices without substantiating them. If a theorem is incorrect, identify the mathematical flaw; if experiments are insufficient, specify the missing evidence; if exposition is difficult, say so. None justifies replacing careful verification with disparaging speculation about the authors' research.
We therefore question how these categorical characterizations can be reconciled with Confidence 4, which indicates substantial direct expertise. The CCM architecture, predictive target, derivations, and protocols were available to check. Why should unverified assumptions be presented with such certainty? A reviewer need not know every host beforehand; that makes checking the original references more important, not optional. We acknowledge our presentation issues and expect comparable care in representing our research.
OpenReview is a lasting public record; selective characterizations affect future readers, not just this decision. We do not ask for a score change; we ask that the assessment be grounded in the paper actually written. Scientific criticism demands evidence, professional reviewing demands fairness, and Confidence 4 demands responsibility.