Serialization Tax in Shared-Latent Exchangeable Decisions

arXiv:2611.26029v1 Announce Type: new
Abstract: Accurate item probabilities can produce inaccurate group-level decisions. A system may score each item separately, yet act on whether enough hidden items succeed: show a slate, defer a panel decision, or inspect a batch. When items share an uncertain latent state, independent marginalization preserves means but removes dependence from the aggregate posterior. We call this error the serialization tax. For binary items sharing one success rate, classical convex-order comparisons give a more dispersed exact count law than any independent completion with the same total mean. We quantify variance and total-variation gaps, derive threshold separation under margin conditions, and connect posterior approximation to decision regret. Separate results cover non-binary outcomes, heterogeneous items, and sufficient posterior resolution. TaxScore identifies large hidden blocks with unresolved uncertainty near a decision boundary for routing to richer posterior heads. On pre-specified, hidden-target-free MovieLens 1M/10M audits, existing shared-latent heads improve high-score negative log-likelihood (NLL)/utility from 0.673/0.696 to 0.629/0.723 and from 0.670/0.691 to 0.639/0.715. Routing gives 0.006–0.012 full-population utility gains, with matched controls identifying their sources. Our code is available at https://github.com/SiminChang/Serialization-Tax-in-Shared-Latent-Exchangeable-Decisions.
This article has been indexed from cs.AI updates on arXiv.org

Read the original article:

Serialization Tax in Shared-Latent Exchangeable Decisions