On the coalitional decomposition of parameters of interest

01/06/2023
by   Marouane Il Idrissi, et al.
0

Understanding the behavior of a black-box model with probabilistic inputs can be based on the decomposition of a parameter of interest (e.g., its variance) into contributions attributed to each coalition of inputs (i.e., subsets of inputs). In this paper, we produce conditions for obtaining unambiguous and interpretable decompositions of very general parameters of interest. This allows to recover known decompositions, holding under weaker assumptions than stated in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2018

Faster Algorithms via Waring Decompositions

We show that decompositions of certain polynomials as sums of powers of ...
research
01/30/2023

Are Random Decompositions all we need in High Dimensional Bayesian Optimisation?

Learning decompositions of expensive-to-evaluate black-box functions pro...
research
06/13/2022

A comparison of partial information decompositions using data from real and simulated layer 5b pyramidal cells

Partial information decomposition allows the joint mutual information be...
research
09/15/2022

Sparsity Inducing Representations for Policy Decompositions

Policy Decomposition (PoDec) is a framework that lessens the curse of di...
research
10/23/2018

On orthogonal symmetric chain decompositions

The n-cube is the poset obtained by ordering all subsets of {1,...,n} by...
research
01/28/2020

An operational information decomposition via synergistic disclosure

Multivariate information decompositions hold promise to yield insight in...
research
02/16/2022

A Polyhedral Study of Lifted Multicuts

Fundamental to many applications in data analysis are the decompositions...

Please sign up or login with your details

Forgot password? Click here to reset