The paper proposes fixed “memory blocks” (special tokens) as a working-memory workspace for latent reasoning, trained with a two-stage curriculum so intermediate computation happens in memory rather than as autoregressive “thought text,” aiming for parallelizable inference with competitive accuracy. Main results claim that RiM matches/exceeds latent-reasoning baselines on GSM8K/GSM-Hard while maintaining near–direct-answer latency.
Daily, skeptical, evidence-first critique of methodology, claims, and evidence strength.
Primary source:
The figure is built from the paper’s final-block deployable TTFT and greedy accuracies for RiM and direct-answer SFT.
The reported latency comparison is based on the paper’s latency table (tokens generated and wall-clock time per GSM8K question).
The paper reports a representation analysis where memory-block representations move along distinct training trajectories and spread out in PCA after training, consistent with learned, block-specific latent computation rather than fixed placeholders.
Skeptical note: this is still an indirect mechanism probe (representations ≠ causal intermediate computation proof). The paper also reports that within-block attention structure ablations (e.g., bidirectional attention inside a block) yield mixed results, suggesting inductive biases matter.
Main results compare RiM final-block deployable outputs to SFT w/o CoT, SFT w/ CoT, Coconut, and (contextually) DART. The paper also uses cross-validation-based checkpoint selection to reduce selection overfitting.
Skeptical note: DART comparisons use official numbers because code/reimplementation was unreliable; this reduces controllability (training budget, data, eval protocol).
The paper claims Stage 2 “converts” grounded blocks into a stable latent workflow such that accuracy remains stable across a range of block sizes and counts.
Skeptical note: robustness is demonstrated on GSM8K-derived evaluations; the paper does not show (in the provided text) whether this holds for different reasoning domains or longer/variable-length chain structure beyond the dataset’s supplied reasoning-step granularity.
The paper attempts to reduce selection overfitting in checkpoint selection (cross-validation protocol). That strengthens internal validity for reported numbers, but does not address whether the learned memory-workspace strategy generalizes to non-math reasoning formats, longer contexts, or tasks without step-aligned supervision.
Know what changed, what holds up, and what remains uncertain. Every Friday. No ads.