Probability-Preserving Zonotopic Neural Uncertainty
Implementation & benchmark of arXiv:2608.17897 — The Zonotopic Mixture Filter
Source paper: The Zonotopic Mixture Filter arXiv:2608.17897 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Attach a finite mixture of zonotopes to each uncertain neural input or hidden state, and propagate every mixture component through affine layers and conservative nonlinear relaxations. When the number of components grows, merge components only with an enclosing zonotope and sum their probability masses, preserving a formal lower bound on the probability that the true activation lies in the represented set.
Formulas
Mathematical statement
A zonotope is \(\mathcal Z(c,E)=\{c+E\xi:\|\xi\|_\infty\le 1\}\), where \(c\in\mathbb R^d\) is the center and \(E\in\mathbb R^{d\times r}\) is the generator matrix. A mixture contains pairs \((\alpha_i,\mathcal Z(c_i,E_i))\), where \(\alpha_i\ge0\) and \(\sum_i\alpha_i=1\). For an affine neural layer \(z=W x+b\), exact zonotope propagation is \(c'_i=Wc_i+b\), \(E'_i=WE_i\). For a partition \(\{\mathcal I_j\}_{j=1}^m\) of the components, an admissible reduction requires \(\mathcal Z(\tilde c_j,\tilde E_j)\supseteq\bigcup_{i\in\mathcal I_j}\mathcal Z(c_i,E_i)\) and \(\tilde\alpha_j=\sum_{i\in\mathcal I_j}\alpha_i\). If each original component contains all realizations associated with its mode, the reduced mixture retains coverage probability at least the represented mixture mass. The neural adaptation uses interval-linear ReLU bounds: for each coordinate with preactivation bounds \([l,u]\), use the exact ReLU map when \(u\le0\) or \(l\ge0\), and otherwise the upper line \(y\le u(z-l)/(u-l)\) together with \(y\ge0\).
Implementation notes
1. Exact integration point: implement a parallel uncertainty wrapper around an MLP, small RNN, or state-space model. The nominal input is accompanied by a finite mixture of zonotopes representing sensor modes, quantization modes, bounded perturbation regimes, or multiple posterior hypotheses. Each mixture component is propagated layer by layer. For affine layers use center = W @ center + b and generators = W @ generators. For ReLU, compute coordinatewise lower and upper bounds from the current zonotope using center - sum(abs(generators), axis=1) and center + sum(abs(generators), axis=1). Apply the exact zero or identity transformation when the interval is one-sided; for crossing intervals, use a conservative affine relaxation and add a nonnegative generator for the relaxation gap. 2. Pseudocode: initialize components (alpha_i,c_i,E_i); for each layer, propagate every component; after propagation, rank pairs by center distance and zonotope volume; propose clusters; compute an enclosing zonotope for each cluster; accept a merge only if the enclosure contains every source zonotope, then replace the cluster by (sum(alpha_i), c_tilde, E_tilde). Keep the top K components only if discarded mass is reported rather than silently renormalized. 3. Computed from the paper: mixture-weight addition and the set-containment condition are exact. Estimated empirically: enclosure tightness, volume proxies, and ReLU relaxation error. A simple enclosure uses the box hull of all source zonotopes, with center equal to the midpoint of coordinatewise extrema and diagonal generators equal to half-widths; this is conservative and easy to verify. 4. First cheap experiment: use a two-layer ReLU MLP on MNIST or two-moons. Create two input-noise modes with weights 0.7 and 0.3, each a bounded box or zonotope, and compare one-box interval propagation with mixture propagation at budgets K=1,2,4,8. Measure certified class stability and empirical coverage over 10,000 sampled perturbations. The primary prediction is zero false-coverage violations whenever affine and ReLU relaxations are conservative; after admissible reduction, empirical coverage of the retained region must be at least the retained probability mass, up to numerical tolerance. A second prediction is that merging separated modes into one box sharply increases reachable-set volume, whereas keeping them separate preserves multimodal predictions. Plot certified volume versus component budget and identify the knee where coverage improves most per component.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.