atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Rethinking Shapley Value for Negative Interactions in Non-convex Games

ICLR 2025 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Revisits Shapley-value-based payoff allocation to explicitly account for interactions between players, including negative interactions, in cooperative games for feature attribution.

Problem

Shapley-value-based feature attribution for deep learning does not explicitly capture interactions between players (features), particularly negative interactions in non-convex games.

Approach

Rethinks the Shapley value criterion so that causal interactions between players are represented explicitly in payoff allocation, with specific treatment of negative interactions in non-convex games.

Experimental setup

Builds on: Shapley value

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy