aiqbench analysis
This research introduces a novel hierarchy of entropy-based Shapley games to attribute predictive uncertainty in multivariate machine learning models, addressing the limitations of existing scalar or component-wise methods. By explicitly isolating cross-component attribution terms through conditional total correlation, the framework enables more precise risk-aware decisions and model diagnostics for complex outputs like time-series forecasts.
A Hierarchy of Entropy-Shapley Games for Multivariate Predictive Uncertainty
arXiv:2609.35217v1 Announce Type: cross Abstract: Modern probabilistic machine learning models increasingly produce multivariate outputs with complex dependence structure, from multi-step time-series forecasts to sample path predictions. Understanding which input features drive the predictive uncertainty is important for risk-aware decisions, model diagnostics, and deciding whether the uncertainty should be mitigated or hedged against. This attribution problem requires a choice of how dependencies between output components are treated. Existing approaches reduce the output to a scalar through aggregation or projection before attribution, thereby obscuring whether features affect marginal uncertainty, dependence structure, or both, while component-wise analyses can miss dependence effects entirely. We close this gap by introducing a hierarchy of three entropy-based Shapley games that make this output-side choice explicit for any ordered multivariate outcome, ranging from per-component marginal entropy to fully joint entropy. The hierarchy isolates a cross-component attribution term that captures how each feature shifts the dependence between output components, a quantity invisible to component-wise methods. We establish a chain-rule decomposition of the joint attribution and characterize the cross-component term through conditional total correlation, providing both closed-form and sample-based estimators. Finally, we demonstrate how the framework captures differences in learned joint structure across probabilistic models from distributional regression to a zero-shot time series foundation model.
Abstract:Modern probabilistic machine learning models increasingly produce multivariate outputs with complex dependence structure, from multi-step time-series forecasts to sample path predictions. Understanding which input features drive the predictive uncertainty is important for risk-aware decisions, model diagnostics, and deciding whether the uncertainty should be mitigated or hedged against. This attribution problem requires a choice of how dependencies between output components are treated. Existing approaches reduce the output to a scalar through aggregation or projection before attribution, thereby obscuring whether features affect marginal uncertainty, dependence structure, or both, while component-wise analyses can miss dependence effects entirely. We close this gap by introducing a hierarchy of three entropy-based Shapley games that make this output-side choice explicit for any ordered multivariate outcome, ranging from per-component marginal entropy to fully joint entropy. The hierarchy isolates a cross-component attribution term that captures how each feature shifts the dependence between output components, a quantity invisible to component-wise methods. We establish a chain-rule decomposition of the joint attribution and characterize the cross-component term through conditional total correlation, providing both closed-form and sample-based estimators. Finally, we demonstrate how the framework captures differences in learned joint structure across probabilistic models from distributional regression to a zero-shot time series foundation model.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2609.35217 [stat.ML]
(or arXiv:2609.35217v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2609.35217 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 297 words
Related coverage
ProteoKnight: Convolution-based Phage Virion Protein Classification and Uncertainty Analysis
arXiv · Aug 19, 2026

Thermodynamics and Objects
LessWrong · Sep 23, 2026
GroupSegment-SHAP: Shapley Value Explanations with Group-Segment Players for Multivariate Time Series
arXiv · Aug 24, 2026

Humanity’s Last Invention — Richard Socher of Recursive
Latent Space · Sep 14, 2026