New foundation for Shapley value immune to coalitional manipulations.
problem Coalitional manipulations in game theory.
method Revised Shapley value criteria for coalitional games.
result Shapley value is immune to coalitional manipulations under new criteria.
Improved Shapley Value method for better model interpretation.
problem Misunderstanding and incorrect interpretation of Shapley Values in machine learning models.
method Identification of null and active coalitions, coalitional Shapley Value computation.
result Correct computation and inference of important variables using Shapley Values.
Bayesian approach improves Shapley value estimation efficiency.
problem Efficiently estimating Shapley values in machine learning models.
method Bayesian experimental design using Gaussian process surrogate and adaptive coalition selection.
result Consistently improves sample efficiency in low-budget settings.
NDDV estimates data point value from a single stochastic trajectory.
problem Estimating marginal contributions of data points over stochastic training paths.
method Introduces Neural Dynamic Data Valuation (NDDV) using stochastic state and adjoint equations.
result NDDV provides a one-run, trajectory-conditioned estimator of data point value.
This paper analyzes voter coalitions in MakerDAO's decentralized governance.
problem Understanding the governance structure and influence of voter coalitions in DAOs.
method Applied clustering algorithm to voting history of MakerDAO to identify voter coalitions.
result The emergence of a dominant voter coalition signals governance centralization in DAOs.
New research on Shapley values for feature attribution in machine learning, considering model vs. data fidelity.
problem Controversy in connecting machine learning models to coalitional games, differing approaches.
method Investigates two approaches: interventional vs. observational conditional expectation Shapley values for linear models.
result The choice between model and data fidelity depends on the specific application.
The paper uses Black-Scholes model to analyze political support and coalition agreements.
problem Determining the minimum support level for a minor party in a pre-electoral coalition.
method Modeling political support as a stochastic process with a deterministic growth rate and applying Black-Scholes option pricing theory.
result The minimum support level for a minor party to gain a representative in a pre-electoral coalition.
Distributed learning across a coalition of organizations allows the members of the coalition to train and share a model without sharing the data used to optimize this model. In this paper, we propose new secure architectures that guarantee preservation of data privacy, trustworthy sequence of iterative learning and equ…
A new sampling scheme based on DOE improves Shapley value estimation accuracy and speed.
problem Heavy computational burden of calculating Shapley values in large coalition games.
method Design of Experiments (DOE) order-of-addition experimental designs for sampling.
result DOE-based sampling scheme yields more accurate and sometimes deterministic estimates of Shapley values.
Paper proposes Coalitional BAE to improve explainability of unsupervised deep learning models.
problem Improving explainability of Autoencoder's predictions.
method Introduces Coalitional BAE, inspired by agent-based system theory, to reduce correlation in explanations.
result Improved quality of explanations using Coalitional BAE on publicly available datasets.
RKHS-SHAP uses Shapley values for kernel methods to provide feature attributions.
problem Feature attribution for kernel methods is often heuristic and not individualised.
method RKHS-SHAP uses Shapley values from coalition game theory to compute feature attributions for kernel machines efficiently.
result RKHS-SHAP can compute both Interventional and Observational Shapley values.
Federated learning models are analyzed through game theory to determine optimal model sharing.
problem Agents with different data distributions face a choice between local or global models in federated learning.
method The problem is analyzed using coalitional game theory and hedonic game theory, considering different degrees of customization in model sharing.
result Exact expected MSE values are derived for linear regression and mean estimation problems, and stable partitions of players into coalitions are analyzed.
The paper introduces Absolute Shapley Value to handle negative contributions in machine learning model training.
problem Negative marginal contributions in machine learning model training.
method Investigates three philosophies: Original Shapley Value, Zero Shapley Value, and Absolute Shapley Value.
result Absolute Shapley Value significantly outperforms other definitions in evaluating data importance.
MRC improves credit assignment in multi-agent LLM systems, achieving high returns and transparency.
problem Lack of principled credit assignment in multi-agent LLM decision systems, vulnerability to regime shifts, and limited transparency.
method Market Regime Council (MRC) computes exact Shapley credits, uses exponentially weighted performance histories, Bayesian adaptive mixture, and regime-dependent multipliers.
result MRC achieves a Sharpe ratio of 1.51 and a cumulative return of 440.1% over 1,037 trading days, ranking first on CR, SR, and IR.
Paper uses Shapley values to explain how clusters of training data affect predictions.
problem Explaining how training data clusters impact predictions from black-box models.
method Extends Shapley values to cluster importance, using coalitional game theory.
result Shows how different clusters of training data contribute to model predictions.
We describe a new model to simulate the dynamic interactions between market price and the decisions of two different kind of traders. They possess spatial mobility allowing to group together to form coalitions. Each coalition follows a strategy chosen from a proportional voting ``dominated'' by a leader's decision. The…
The paper explains DNNs by quantifying interactions among input variables.
problem Understanding and explaining the complex behavior of deep neural networks.
method The paper defines and quantifies the significance of interactions among multiple input variables using the Shapley value.
result The proposed method effectively explains the behavior of DNNs by assigning attribution values to input variables.
We study the problem of interpreting trained classification models in the setting of linguistic data sets. Leveraging a parse tree, we propose to assign least-squares based importance scores to each word of an instance by exploiting syntactic constituency structure. We establish an axiomatic characterization of these i…
Fair insurance contracts are designed to handle default risk using cooperative game theory.
problem Designing fair insurance contracts in the presence of default risk.
method Cooperative game theory to specify premiums and participation in benefit.
result Fair benefit participation emerges as a game outcome involving residual risks.
Methodology to measure lag relevance in time series models.
problem Measuring lag relevance in machine learning models for univariate time series.
method Ghost variables, Shapley values, additive importance measures, auto-relevance and partial auto-relevance functions, one-step forecast.
result Calculated relevance measures successfully demonstrate expected lag structure in almost all cases.
EASE estimator improves probabilistic value estimation efficiency.
problem Efficiently estimating probabilistic values like Shapley and semivalues.
method Developed an Efficiency-Aware Surrogate-adjusted Estimator (EASE) that minimizes first-order mean squared error.
result EASE consistently outperforms existing estimators for various probabilistic values.
Generative Policy-based Models aim to enable a coalition of systems, be they devices or services to adapt according to contextual changes such as environmental factors, user preferences and different tasks whilst adhering to various constraints and regulations as directed by a managing party or the collective vision of…
The paper extends game theory using Hodge theory on graphs.
problem Generalizing Shapley's value allocation formula for cooperative games on graphs.
method Connecting stochastic path integrals to Hodge-theoretic Poisson's equations on graphs.
result The value allocation operator is the solution to Poisson's equation in combinatorial Hodge theory.
A game-theoretic approach selects features by testing their marginal contributions.
problem Feature selection in econometric and statistical models.
method A coalitional game where features are players and payoff is model performance. Hypothesis test decides feature relevance.
result The approach significantly outperforms existing methods in simulations.
This paper introduces a novel framework for designing fair and sustainable unemployment benefits, grounded in cooperative game theory and real-time fiscal policy. The labor market is modeled as a coalitional game, where a random subset of participants is employed, generating stochastic economic output. To ensure fairne…
The paper analyzes reinsurance strategies in peer-to-peer insurance schemes.
problem Strategic interaction between plan managers and reinsurers in P2P insurance.
method Develops two game-theoretic contract designs: Pareto and Bowley designs, deriving optimal contracts and analyzing their welfare effects.
result The Bowley design yields a unique optimal contract, while the Pareto design allows for multiple Pareto-optimal contracts.
Study estimates heterogeneous principal causal effects with binary treatments and intermediate variables.
problem Estimating subgroup effects within strata defined by potential values of an intermediate variable.
method Proposes a framework for estimating and forming confidence intervals for heterogeneous principal causal effects under principal ignorability assumption. Develops several estimators with varying robustness properties.
result Established large-sample theory and analyzed bias contributions of each approach.
Understanding the influence of features in machine learning is crucial to interpreting models and selecting the best features for classification. In this work we propose the use of principles from coalitional game theory to reason about importance of features. In particular, we propose the use of the Banzhaf power inde…
Random forests are a type of ensemble method which makes predictions by combining the results of several independent trees. However, the theory of random forests has long been outpaced by their application. In this paper, we propose a novel random forests algorithm based on cooperative game theory. Banzhaf power index …
Discovering imaging biomarkers for autism spectrum disorder (ASD) is critical to help explain ASD and predict or monitor treatment outcomes. Toward this end, deep learning classifiers have recently been used for identifying ASD from functional magnetic resonance imaging (fMRI) with higher accuracy than traditional lear…
To improve the performance of Intensive Care Units (ICUs), the field of bio-statistics has developed scores which try to predict the likelihood of negative outcomes. These help evaluate the effectiveness of treatments and clinical practice, and also help to identify patients with unexpected outcomes. However, they have…
New voting rules protect against strategic voting by robust statistics.
problem Strategic voting can skew election outcomes.
method Revisit Mallows model, develop robust estimator.
result Efficient estimator achieves nearly optimal robustness.
Proposes a Taylor framework to unify and analyze attribution methods.
problem Lack of a unified guideline for feature contribution assignment in machine learning models.
method Introduces a Taylor attribution framework to model the attribution problem and reformulates fourteen mainstream methods.
result Empirically validates the Taylor reformulations and reveals a positive correlation between performance and principles followed.
Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of n objects scales factorially in n. One recent way that has been used to reduce storage complexity has been to exploit probabilistic independence, but as we argue, full independence assumptions impo…
This paper maps the insurability of AI risks across various insurance products.
problem Emerging AI risks and their implications for insurance coverage.
method Coding 55 AI threat classes against 26 insurance products using public carrier materials and threat catalogs.
result Identification of a four-tier insurability frontier: affirmatively insured, silent-AI exposures, actively excluded, and unstructured perils.
New model for recovering unverifiable signals from observers in decentralized networks.
problem Verifying the level of service provided by untrusted parties in decentralized networks.
method Formal model of signal elicitation, source identifiability condition, and peer prediction techniques.
result Existence of a strictly truthful mechanism for unverifiable signal recovery.
New method calculates Shapley values for uncertain functions.
problem Uncertain value functions in explainable machine learning.
method Definition of Shapley values using probability theory.
result Shapley values can be applied to uncertain functions.
New set-valued star-shaped risk measures introduced for better risk assessment.
problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.
Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.
problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.
Formula for Z_2-valued index of symmetric operators on manifolds.
problem Index of symmetric operators on manifolds with boundary.
method Cohomological formula for Z_2-valued index.
result A formula for the Z_2-valued index of operators on manifolds.
New method converts p-values to e-values for more efficient CP and aggregation.
problem Limitations of existing p-to-e calibrators in CP setting.
method Proposes a novel P2E calibrator for set-preserving calibration.
result Significant efficiency gains over existing p-to-e calibrators.
Introduces joint Shapley values to measure feature importance in models.
problem Measuring the importance of feature sets in machine learning models.
method Extends Shapley's axioms to measure a set of features' average contribution to a model's prediction.
result Joint Shapley values provide unique insights and are more consistent with local intuitions.
Proposes a low-cost method to set hyperparameters using optimized default values.
problem Challenges of setting hyperparameters by trial and error, leading to subjective and inefficient results.
method Generates optimized default values using a small set of values that outperform existing defaults and tuned values.
result New default values deliver better predictive performance and are competitive with tuned values, making them easier to use.
The paper introduces the Banzhaf value for robust data valuation in machine learning, addressing stochastic model performance.
problem Inconsistent data value rankings due to model performance noise.
method Introduces the Banzhaf value and Maximum Sample Reuse (MSR) principle for efficient estimation.
result The Banzhaf value outperforms other semivalues in robust data valuation.
A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors followed by (2) taking the absolute value of every entry…
Complex-valued neural networks are not a new concept, however, the use of real-valued models has often been favoured over complex-valued models due to difficulties in training and performance. When comparing real-valued versus complex-valued neural networks, existing literature often ignores the number of parameters, r…
We approximate derivatives of functions on manifolds by embedding them and applying vector-valued operators.
problem Derivatives of manifold-valued functions are harder to approximate than vector-valued functions.
method Embed the manifold into a higher space, approximate the derivative of the vector-valued function, and project back.
result We provide error bounds for the approximation of manifold-valued function derivatives.
The paper defines and analyzes set-valued stochastic integrals for Lévy processes.
problem Defining and analyzing set-valued stochastic integrals for Lévy processes.
method Extending classical definitions to convoluted integrals with square-integrable kernels, and proving properties of set-valued convoluted stochastic integrals.
result Set-valued convoluted stochastic integrals can be explosive and take extended vector values.