acceptodds
Under review as a conference paper at ICLR 2027

RST: Routes for Certifying and Constructing Prescribed Information in Variational Autoencoders

Abstract

Posterior-collapse diagnostics can establish that a VAE uses its latent representation, but they do not determine whether a specified information view crosses a representation/readout interface fixed before training. Reconstruction-Student-Teacher (RST) makes that stronger requirement explicit: R denotes Reconstruction, S the fixed Student witness, and T the frozen Teacher specification. Let be a full-support categorical Teacher, , , and let an audited representation satisfy . With , , and , we prove and for every input-independent , with equality attained by the centered RST witness. Thus certifies transmission of the declared Teacher information through the specified interface. In the main experiments is the deterministic encoder mean, while reconstruction uses . A centered regular-simplex witness turns the certificate into an explicit construction: a minimum-dimensional closed-form Teacher code, its complete affine solution fiber, exact witness-visible/witness-null routing, a margin-energy path, strict function-space departure from the centered input-independent point, certified preservation cylinders, and orthogonal multi-view composition. Five-dataset experiments test boundary crossing, stronger KL pressure, Teacher counterfactuals, witness-null routing, escape, and preservation. On CIFAR-100, learned-head auxiliary (Aux) codes are probe-readable while their predeclared margins are negative. Cross-seed Aux-head reuse falls from native accuracy to , whereas one fixed RST witness directly reads all five Conv-RST encoders at . The same witness is also certificate-positive on five independently optimized ResVAE RST encoders, with coarse/fine margins and ; ConvRes learned-head reuse is near chance, while a ridge-affine adapter makes all transferred margins positive. These tests validate a functional consequence of prescribed alignment; they do not claim fixed simplex classifiers or compatible representations as new.

Then back it, or bet against it.

Related papers

Open the market on this paper to see 7 more related papers.