arXiv paper· machine learning theory (sequential state-space models and Bayesian filtering)· theory paper with numerical illustrations

How Wrong Can a Good Predictor Be? Diverging Updates with Vanishing Predictive KL

Qifu Wen, Shuaijun Liu, Zihan Zhou, Xi Zeng, Ningxin Su

cs.LG · stat.ML

Quick verdict

Proves fixed-K diverging Bayesian vs radial updates can coexist with vanishing predictive KL in Gaussian HMMs; rigorous proofs, honestly bounded scope.

Summary

The paper proves that in a stationary symmetric Gaussian hidden Markov model with a fixed finite number K ≥ 2 of latent states, exact Bayesian mixing and an explicit deterministic 'radial' (tanh-bounded) filter can diverge linearly in centered logits at an explicit moving witness — with separation growing like Ω(L_K(q)), the natural confidence scale, as switch probability q → 0 — while their decoded categorical KL at that same input vanishes (Theorem 3). A second theorem strengthens this from a single input to the path law: along stationary HMM trajectories, the expected terminal KL between the two filters' posteriors converges to zero at the logarithmic horizon H(q) = ⌈−log q/c⌉ + 1 (Theorem 4). The mechanism is softmax curvature inside a shared confidence cone, plus a single Gaussian maximal event controlling adaptive noise. Numerical sweeps (K ∈ {2,4,8}, 4,096 paired paths per cell) illustrate the opposing trends, and binary controls show saturating recurrences (tanh, hard clip) remain stable at long horizons while nonsaturating ones degrade to 5.53 and 14.54 nats (Table 7). Learned models (Mamba, GRU) did not establish transfer: Mamba blocks fail at long horizons. Main limitations: constants are not uniform in K, the witness moves with q, and no converse criterion is given.

Review complete

Assessment at a glance

machine learning theory (sequential state-space models and Bayesian filtering)

4

risk flags identified

● high 0

● medium 2

● low 2

Reproducibility readinesshigh
Code & data availableyes
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viableCode-reproducible

5 strengths · 4 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • For every fixed finite K ≥ 2, exact Bayesian mixing and an explicit radial filter separate as Ω(L_K(q)) in centered logits at an explicit moving witness while their categorical KL at that same input vanishes (Theorem 3).
  • Along stationary symmetric Gaussian HMM trajectories, the expected terminal KL between the two filters' posteriors converges to zero at the logarithmic horizon H(q) = ⌈−log q/c⌉ + 1 (Theorem 4).
  • Binary exact mixing is saturating, (1−2q)-contracting and provably not affine, with obstruction Δ_q = (3/4)q + O(q²) that cannot yield an asymptotic predictive lower bound (Proposition 5, Remark 6).
  • Empirically, saturating scalar recurrences stay stable at the long endpoint ⌈8/q⌉ while nonsaturating controls degrade to 5.53 and 14.54 nats (Table 7), and learned Mamba blocks fail to acquire the mechanism at long horizons.

Strengths

  • Two-level theorem structure with explicit quantifier discipline

    Theorem 3 (pointwise maps at witness z_q = L(1/4, −1/4, 0, …, 0), gap/L → c⋆ = 1/2 − tanh(1/2)) is logically separated from Theorem 4 (stationary path law at H(q)); Appendix D.1 freezes K, means, σ, c before q → 0⁺, and Table 1 cleanly separates proved rows from the measured K ∈ {2,4,8} illustration and explicit exclusions.

  • Complete, checkable proofs

    Appendix E proves both theorems: two-scalar radial dynamics (Lemma 7), a pathwise Abel bound plus one Gaussian maximal inequality with tail ≤ L⁻³ (Lemmas 8–9), L^(2/3) radial barriers (Lemmas 11–13), path-mixture Bayes-factor recovery (Lemmas 14–16), curvature and 2L envelope lemmas (Lemmas 17–19), and a separate binary branch (Lemma 20).

  • Honest negative and null results

  • Careful metrics disclosure

  • Transparent display-selection disclosure

Weaknesses

  • Protocol deviations in the empirical section

  • No quantitative sensitivity for the key constants

  • The long-horizon lower-bound narrative remains analytically open

  • Architectural relevance is motivational only

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

This is a theory paper with a supporting empirical section, addressing when a strict internal update mismatch forces worse prediction. Theorem 3 proves that for every fixed finite K ≥ 2, exact Bayesian transition mixing Φ_q and a deterministic radial filter R_q(z) = [L_K(q)·tanh(α_K(q)r(z)/L_K(q))/r(z)]·Cz separate at the explicit witness z_q = L(1/4, −1/4, 0, …, 0): the centered pairwise gap over L converges to c⋆ = 1/2 − tanh(1/2), while DKL(softmax Φ_q(z_q) ∥ softmax R_q(z_q)) → 0 at the same input (bounded by 4K(K−1)L²e^(−L/5)). Theorem 4 upgrades this from one hand-picked input to the path law: along stationary symmetric Gaussian HMM trajectories with switch probability q → 0, the expected terminal posterior KL at the logarithmic horizon H(q) = ⌈−log q/c⌉ + 1 tends to zero. Quantifier discipline is explicit (Appendix D.1): K, means, σ and c are frozen before q → 0⁺, and Table 1 separates proved rows from the measured K ∈ {2,4,8} illustration and from exclusions (no growing-K rate, no architecture-class impossibility, no learnability claim). Claims and scope match; the abstract itself concedes the construction is fixed-K and yields no universal criterion.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 5 strengths & 4 weaknesses, analyzed in detail
  • 4 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What does the paper prove, in plain terms?

It constructs two recurrent filters for a hidden Markov model — exact Bayesian updating and a deliberately different 'radial' (tanh-bounded) update — whose internal logit states drift further and further apart as state switches become rare, yet the probability vectors they output after the softmax decoder become indistinguishable: their KL divergence tends to zero, both at a specific adversarial input (Theorem 3) and on average along typical model trajectories at a logarithmic horizon (Theorem 4). The lesson is that unbounded internal divergence alone does not certify predictive failure.

Does this show that Mamba or other state space models are safe to compress?

No. The theorems concern an explicit radial filter and exact Bayes in a fixed-size Gaussian HMM, not any named architecture, and the paper explicitly proves no impossibility result for an architecture class. Its own learned-model experiments failed to establish transfer: Mamba blocks were unstable at long horizons (worst long-horizon closure −32.65 at q=2⁻³ end-to-end). The paper is a counterexample isolating decoder sensitivity and loss-weighted state contribution, not a criterion for harmless compression.

Is code or data available for this paper?

Yes, per the reproducibility statement and Appendix F: an anonymous supplementary package contains the simulation code and numerical results, including the data generator, seed construction (ten public seeds 1080–1089), model configurations, and the bootstrap aggregation procedure. All experiments are synthetic Gaussian HMM simulations at CPU scale.

Why doesn't the diverging internal gap cause prediction errors?

Two reasons identified by the paper: decoder insensitivity — deep inside a shared confidence cone, softmax curvature exponentially suppresses large logit discrepancies (the KL at the witness is bounded by 4K(K−1)L²e^(−L/5)); and distribution weighting — typical blocks contain no latent switch, where a single Gaussian maximal event controls all adaptive noise, while switch paths carry vanishing probability and are absorbed by a deterministic 2L envelope.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Figures 1–3 are present only through their captions in the extracted text, so plotted curves could not be visually verified. The text itself is otherwise complete from the abstract through Appendix G (Tables 1–8 and all proofs included) with no truncation at the end.

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
How Wrong Can a Good Predictor Be? Diverging Updates with Vanishing Predictive KL | Evolve.Pub