- Rating
- 3
- Confidence
- 1
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper extends temporal predictive coding (tPC) from deterministic point estimation to Langevin-based posterior sampling using local prediction-error updates. It proves that the corresponding SDE has the per-step conditional posterior as its stationary distribution, analyzes finite-step behavior and step-size/preconditioning choices, and studies posterior mass recovery in multimodal settings. Experiments on synthetic targets, UCI-style inverse problems, temporal mixture systems, and video benchmarks show improved posterior approximation over deterministic ensembles in multimodal cases, while roughly matching standard tPC on unimodal video tasks.
Critical strengths
- Careful theoretical and empirical analysis. The paper does more than introduce a noisy variant of tPC: it analyzes stationary behavior, finite-step effects, anisotropy, mode mass, mixing limits, and failure regimes. The use of exact posteriors in several experiments makes the probabilistic claims easier to evaluate directly.
- Clear diagnosis of posterior mass versus deterministic basin occupancy. A useful conceptual contribution is the distinction between deterministic multi-start tPC, which reflects initialization-basin frequencies, and Langevin chains, which can recover posterior mass when mixing is feasible. This gives a clear explanation for why deterministic ensembles can discover multiple modes yet still represent their probabilities incorrectly.
Critical weaknesses
- The probabilistic inference claim is narrower than the overall framing may suggest. The method samples a frozen-parent per-step conditional rather than the filtering posterior required for full sequential Bayesian inference. The authors acknowledge this distinction and justify it through locality, but it still limits how broadly the method can be interpreted as a temporal posterior inference method.
- The methodological novelty appears somewhat incremental relative to existing Monte Carlo predictive coding. The paper itself notes that FDT stationarity is classical and that the per-position Langevin update is closely related to the MCPC E-step. The temporal extension, finite-step analysis, and posterior-mass study are useful, but the contribution would be more convincing with a clearer separation from existing sampling-based predictive-coding methods and stronger matched-setting comparisons.
Questions for authors
- Clarification: Could the authors more clearly characterize the probabilistic object represented by the chain population after multiple sequence steps? In particular, under what conditions, if any, does it approximate the filtering posterior rather than only the frozen-parent per-step conditional?
- Clarification / comparison: Given the acknowledged connection to MCPC and related sampling-based predictive-coding methods, what should be regarded as the main methodological novelty of Langevin tPC? Would the main conclusions remain under a direct matched-budget comparison with these existing samplers?
Thank you for being open about the issues, for correcting Prop 5, and for adding the time-series tests, which strengthen the uncertainty results. However, the UCI tests remain static, the pachinko branching gain comes from the transition model, and the step size rule offers no consistent benefit after accounting for the extra computation. It seems that an existing sampler with the same temporal model can give similar results at the largest tested budget. So I still have some reservations about how much the method actually adds in the end. Nonetheless, I am raising my score to 3 in light of the corrections and the added temporal evidence, with the expectation that the revised paper states the limitations more clearly.