Search arXivSearch

arXiv · 2602.11219

Structurally Separated Uncertainty in Supervised Latent Variable Models

Abstract

Predictive uncertainty is commonly decomposed into epistemic and aleatoric components, but standard decompositions often produce strongly correlated estimates because both quantities are derived from the same predictive distribution. We study an alternative design principle, \emph{structural separation}, which assigns epistemic and aleatoric uncertainty to disjoint parameter paths trained with distinct supervision targets: reducible prediction error for epistemic uncertainty and persistent label ambiguity for aleatoric uncertainty. We instantiate this principle in two supervised latent-variable models, a Credal Concept Bottleneck Model and a credal Self-Explaining Neural Network, and prove a gradient-isolation result showing that the two uncertainty heads are not coupled through shared training gradients under the proposed parameterization. Across five ambiguity-aware benchmarks, structural separation substantially reduces epistemic-aleatoric correlation while preserving predictive performance. Further analyses show that aleatoric estimates track annotator- or corpus-derived ambiguity, while epistemic estimates are more sensitive to prediction error and data availability. These results suggest that supervised latent-variable architectures provide a practical route toward uncertainty estimates that are not merely decorrelated, but operationally distinguishable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tanmoy Mukherjee, Marius Kloft, Pierre Marquis, Zied Bouraoui. 2026-07-29. Structurally Separated Uncertainty in Supervised Latent Variable Models. https://arxiv.org/abs/2602.11219

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG