acceptodds
Under review as a conference paper at ICLR 2027

Structural Diagnosis and Finite-Sample Replacement Certification for Factorized Priors in RSSMs

Abstract

Observation-wise product posteriors can become dependent after observations are marginalized out. Under an access model in which full posterior probabilities are available, the representation is frozen, and scoring is independent, we cer-tify whether a given mixture-of-products candidate outperforms the entire product family in normalized Hamming Wasserstein distance. Under an exact fractional cover, the approximation loss of the local compression lower bound is at most twice the compression distortion plus a structural remainder, without requiring in-dependence across groups. On the candidate side, we use direct component trans-port as a baseline, combine preffx aggregation and state lifting into a TV hierarchy with nonincreasing costs, and enlarge the set of valid couplings through a stopping tree that retains parent nodes. Once the reference, candidate, and metric are ffxed, a common empirical event converts valid coupling costs into ffnite-sample upper endpoints, yielding the structural replacement criterion U < L. Validity holds for any ffxed ffnite number of components. In synthetic experiments, 60 of 80 audits using codebooks frozen after learning pass numerically; a further 180 perturba-tion comparisons and 400 reference-structure comparisons verify reductions in coupling costs and upper endpoints. The additional certiffcation gains from com-bining the new couplings with the codebook lower bound, applicability to trained RSSMs, and certiffcation with rigorous rounding remain unveriffed.

Primary area:
learning on time series and dynamical systems
Keywords:
Recurrent state-space models, factorized priors, finite-sample certification, Wasserstein distance, local posterior compression, auxiliary variables, aggregate KL divergence

Reviews

Among:
Shape:
1234this paper, Bottom 9%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.50 over 2 reviews, above 9% of the others.
Reviewer_tgnMOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
1
Soundness
2
Read review
Paper summary

This paper proposes a procedure to certify whether a given mixture-of-products distribution approximates a reference distribution better than every product distribution, using Wasserstein distance based on normalised Hamming distance. The reference distribution is the average of observation-dependent posteriors. Although each posterior treats the variables as independent, dependencies can arise when the posteriors are averaged. The method compares a lower bound on the smallest error achievable by any product distribution with an upper bound on the proposed mixture’s error. Improvement is certified if the upper bound falls below the lower bound.

Critical strengths
  • The paper develops lower and upper bounds that support certification against the entire family of product distributions, rather than comparison with one fitted baseline. The lower bound includes an approximation guarantee, while the transport hierarchy provides progressively tighter upper bounds.
  • The authors account for the availability of only finite data. Separate fitting and independent scoring, together with statistical corrections, turn the mathematical bounds into a certification procedure with a stated confidence guarantee.
Critical weaknesses
  • The manuscript does not appear fully finished. The title presents two title-like statements which are both different to the one on OpenReview. Moreover, the appendices repeatedly refer to earlier versions: “v10” and “V0” in Appendix C, withdrawn quantities and an old bias bound in Appendix I.2, and an incompletely reproduced historical summary in Appendix J.4. I’m concerned that this submission has not been fully finished, or an incorrect version has been submitted.
  • The paper is not sufficiently accessible. It is technically very dense and requires significant reconstruction using the appendix. The main paper should be self-sufficient, even if detailed proofs remain in the appendices. It would benefit from clearer motivation, definitions explained in words, connections between the constructions, and explanations of the main proof ideas.
  • The motivating application is underexplored. While the authors acknowledge that the method has not been tried on RSSMs, it is unclear how it would be applied in practice. Access to categorical posterior probabilities appears plausible, but obtaining independent future observations conditional on a fixed recurrent state, stochastic state and action seems less straightforward. This leaves a substantial gap between the mathematical assumptions and practical applicability.
  • The experiments leave an important gap between improvements in bounds and improvements in certification. They demonstrate that the new constructions, including prefix coupling and stopping trees, can tighten upper bounds. However, they do not establish whether these constructions produce successful certificates where the baseline fails. Computational costs also need further evaluation.
  • The experiments are insufficiently explained in the main text. Table 1 uses “Strong,” “Soft” and “Independent” conditions whose definitions are deferred to the appendix. The basic definitions needed to interpret the results should accompany them.
  • I was left unsure of the broader implications of the work. The RSSM motivation is given, but the practical benefit of the guarantee is not adequately explored. Other potential applications also receive little discussion. In addition, a more direct comparison with related proof constructions would help clarify the methodological advances over prior work.
Questions for authors
  • How would the required independent scoring data be collected for the RSSM application?
  • Do the new coupling constructions provide additional successful certifications that the baseline does not?
  • What are the runtime and memory costs of the certification methods, particularly the new coupling constructions?
  • Which proof constructions constitute the main advances over the closest prior work?
  • What practical benefits are expected in the RSSM setting, and are there other applications where the framework would be useful?
3 comments

Thank you for your constructive comments. We acknowledge the presentation and version-history issues and aim to upload a clearer revision as soon as possible. Below we briefly address the main questions. The new experimental results have not yet been incorporated into the current manuscript.

Q1. How are independent scoring observations obtained for the RSSM application?

The required conditional samples are not supplied automatically by standard RSSM training. In our controlled experiments, the known environmental transition and observation laws allow us to compute a predictive observation distribution conditional on a fixed public history, action, and declared availability information. We draw independent scoring observations from this distribution and evaluate their posterior probabilities using the frozen RSSM. Thus, the environment supplies the conditional observations, while the RSSM supplies the posterior probabilities. We will explicitly state this additional sampling-access assumption and the refined conditioning used in the experiments.

Q2. Do the new couplings provide additional successes?

Yes. For G = 16 and n = 65,536, the strong baseline passes 0/20 independent scoring replicates, while short-prefix and stopping-tree couplings each pass 20/20. The comparisons use the same reference distribution, candidate, lower-bound witnesses, scoring data, and statistical budget. We also obtained additional numerical passes in trained-RSSM development experiments.

Q3. What are the runtime and memory costs?

For the G = 16 synthetic setting, the median computation times for prefix and stopping-tree couplings are 0.00976 and 0.01951 seconds, respectively. Their peak process memory usage is 72.3 and 73.1 MiB, respectively, including Python and library overhead. These measurements concern coupling computation on compressed finite-support inputs and exclude training and posterior extraction. We will provide the full cost tables and clarify their scope.

Q4. Which proof constructions constitute the main advances?

Our contributions include four components: the 2e + tau approximation guarantee for the local-compression lower bound; a coupling hierarchy combining prefix aggregation and state lifting, which preserves the full marginal distributions, guarantees monotonic tightening of the upper bound, and reaches the exact transport distance at full expansion; a stopping-tree construction that retains parent nodes and jointly optimizes transport and stopping masses, together with its integration into the hierarchy; and a common statistical event permitting selection among valid couplings for a fixed audit problem. We will explain these constructions more explicitly in the revision.

Q5. What are the practical benefits and other potential applications?

Where suitable conditional sampling access is available, a potential use during training is to screen prior structures at frozen checkpoints. When U < L, even the best product distribution cannot match the specified mixture candidate's approximation quality under the audited representation, reference distribution, and condition. The certificate therefore identifies an approximation limitation that further parameter optimization within the product family cannot eliminate. This can inform when to explore a richer prior and potentially avoid additional training effort within a family that cannot attain the target approximation quality under those fixed conditions.

The additional numerical passes show that tighter couplings make this structural diagnosis possible in cases where the original strong baseline remains inconclusive. Beyond RSSMs, the same comparison could support choices between factorized and mixture approximations in other discrete latent-variable models satisfying the same probability-access and independent-scoring assumptions.

Thanks for your response.

I’m afraid it doesn’t resolve my main concerns. For example, your Q1 answer still leaves me unsure how you’d apply this to real RSSMs. And on readability, the response leaves it ambiguous how you’d actually change the current manuscript.

Thank you for clarifying what remained unclear. We have uploaded the revised manuscript. Applying the audit to a trained RSSM requires a way to draw independent next observations under the condition being audited. Section 8.2 (p. 9) now explains how we do this in our four-device simulator. We fix the observed history, the announced device availability, and the next inspection action. Using the known environment dynamics, we average over the hidden physical states consistent with that information to obtain the distribution of the next sensor reading. We draw 65,536 independent readings from this distribution and use the frozen RSSM to compute their posterior probabilities at the same predictive state. Appendix L.2.2 (p. 76) gives the full protocol. For a practitioner with only a trained model and ordinary replay data, this conditional sampling access remains an additional requirement. We have also revised the opening of Section 1 (p. 1) to explain how blocks that are independent for each individual observation can become dependent when we average over observations. Before introducing the formal constructions, we now explain in words what L and U bound and why U < L establishes that the specified candidate improves on every product distribution.

Reviewer_wXtHOpenReview ↗
Rating
1
Confidence
2
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

The paper proposes a mathematical framework for certifying that a fixed mixture-of-products distribution is closer to a discrete posterior than any fully factorized distribution, using optimal transport with normalized Hamming distance. It combines a lower bound on how far the posterior is from the product family with an upper bound on the candidate’s distance; if the upper bound is smaller, the candidate is certified to be better.

Critical strengths

None

Critical weaknesses
  1. Its very hard to follow the content, the authors relied heavily on AI usage.
  2. The proposed theorems and lemma's are also very hard to read through due to inconsistencies.
Questions for authors
  1. I hope it is not an Auto Research run
  2. I request the authors to spend some time to write and present the paper better.
1 comment

Thank you for raising the readability concern. In the revised manuscript, the opening of Section 1 (p. 1) now explains what the lower bound L and the upper bound U each measure, and why U < L certifies improvement over every product distribution. We also clarify the approximation guarantee in Theorem 1 by explaining what the compression distortion term e measures and which features of the cover and codebooks determine the remainder term.

Comments on the paper

3 comments

Thank you very much for your constructive comments. We briefly address the main questions below and aim to provide detailed experimental tables and protocol descriptions as soon as possible. These new results have not yet been incorporated into the manuscript.

Q1. Are there additional successes that the baseline cannot achieve?

Yes. For G=16G = 16 and n=65,536n = 65{,}536, the strong baseline passes 0/20 independent scoring replicates, while short-prefix and stopping-tree couplings each pass 20/20. The comparisons use the same reference distribution, candidate, lower-bound witnesses, scoring data, and statistical budget, while retaining the same auxiliary statistical bounds. These results satisfy Unew<LU_{new} < L, while UbaseU_{base} is at least LL, and therefore constitute additional numerical passes.

Q2. What are the computational costs and sources of looseness?

We evaluated G=4,8,16,32G = 4, 8, 16, 32, with prefix and tree depths of at most four. At G=16G = 16, the median computation times for prefix and stopping-tree couplings are 0.00976 and 0.01951 seconds, respectively. These timings measure coupling computation on compressed inputs containing at most 32 distinct posterior rows. We will provide the full cost measurements and clarify their scope. Our analysis also highlights the need to distinguish looseness caused by restricted couplings from empirical–population discrepancies. We further find that increasing the sample size alone cannot resolve a negative population gap.

Q3. Is rigorous numerical verification available?

For one explicitly defined rational synthetic instance, exact arithmetic and conservative bounds on the statistical corrections yield a lower endpoint LsafeL_{safe} of approximately 0.04397113 and an upper endpoint UsafeU_{safe} of approximately 0.03354705, with a strictly positive gap of approximately 0.01042408. The displayed decimals are rounded.

We have also conducted experiments with RSSMs trained in controlled simulated environments. In these experiments, we found cases where the new coupling methods, including an actual joint configuration, achieve numerical passes while the strong baseline does not. A follow-up response will provide the complete results and explain the precise conditioning information and independent-scoring procedure.

Thank you so much for addressing my concerns. I am keeping my score.

Thank you for your follow-up. We have uploaded the revised manuscript and appreciate your suggestion to test whether tighter couplings change the certification decision. Table 1 (p. 9) reports a matched comparison using the same reference, candidate, lower-bound witnesses, scoring observations, auxiliary bounds, and statistical budgets. At G = 16, ε = 0.10, and n = 65,536, the strong baseline passed none of the 20 independent scoring runs, while the short-prefix and stopping-tree methods each passed all 20. In the trained RSSM experiments, joint configurations passed 23 of 75 shared-driver conditions. In three of these, the baseline and every prespecified standalone hierarchy and tree configuration failed (Table 2, p. 10). Section 8.3 reports the measured computational costs. Table L2 distinguishes the effect of restricting the coupling from sampling error, and Appendix L.1.4 verifies a positive gap of approximately 0.01042408 for one synthetic instance using exact rational transport and conservative statistical corrections.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.