- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work studies the least-core concept, which is a concept from cooperative game theory, that recently is receiving a bit more recognition than before (while still being very much under-explored compared to concepts such as Semivalues like the Shapley or Banzhaf values and their corresponding interactions). This paper studies a phenomenon that appears in games when players are being contextual distractors (i.e. players that usually help little in the payoff, but rarely harm a lot by reducing the payoff a lot). The paper then examines the least-core definition more closely and points out that the selection criterion that is usually used to make the core computable in practice (the core is often an empty set) can be reformulated with a new selection rule. The paper presents this as a new method and shows that this can be approximated with empirical tricks.
Critical strengths
- Clearly and transparently written. While I think this paper could be better presented as a whole, it still mostly clearly written and explains the related work and theoretical background well.
- The main contribution (equation 9), the ELC is to the best of my knowledge novel and not part of the existing literature. The paper correctly points out that the least-core attribution is not well defined without a selector, and that the usual l2 norm (min norm) selector is an arbitrary default. This is very good. Moreover, Proposition 4.2 shows that the entropy least core is connected to the nucleolus computation algorithm and one can now compute the new ELC variant with a GPU-friendly algorithm via projected gradient descent. This is a worthwhile contribution in an important research area. Particularly, the core is underdeveloped in the XAI literature and making it, or concepts derived from this definition seem very promising for making attributions, or generally explanations, more robust. Albeit, this paper does not make a very convincing case of this, yet.
Critical weaknesses
-
Limited Novelty. This work here is heavily based on a published workshop paper by Nagarajan et al. (2026). The conceptual basis (definition 3.3, least core vs. Shapley) is already discussed in the workshop paper. The main theoretical results, Proposition 4.2, seems to be a direct application of Alvarez (2000), which is heavily cited in the proof (which of course is good). This would, ultimately, not be a deal breaker if the proposed method would have been better presented and evaluated as a _new XAI method. Which brings me to my main concern.
-
The main method is underdeveloped. First, the contextual distractor setting (definition 3.3) is a very niche issue. The paper does not bring one real-life scenario of this phenomenon. While I am sure synthetically this may occur and it is interesting to investigate this, however, as it stands now, it is quite hard for an XAI researcher to place this contribution inside the existing literature on Shapley attribution. This is mainly a fact that the evaluation does not really help me understand what the benefit of the new formulation is. While I am sure some exist, I am unsure what implications this method would have for the attribution researcher and what better explanations I can create. Therein, the work feels quite technical and hand-crafted and not really impactful for the greater research community.
-
The used baselines in the existing experimental setup are quite weak. The Shaply estimator is a very bad estimator with very high variance. While it is kind-of like comparing apples with oranges, the baseline still should be the best it could be. Much more sophisticated approximators exist, such as RegressionMSR [1], LevaragSHAP [2], or OddSHAP [3]. The only downstream, implication of the work seems to be the results of Table 5 (the data valuation experiment), which shows only very small improvements over the baselines.
-
Finally, as it stands this work also contains a collection of minor, more easier fixable, issues (see below) which taken together also weigh as a larger weakness.
Minor, potentially Fixable Weaknesses:
- While later sections (e.g. lines 261-267) are very detailed, earlier parts of Section 3, particularly Section 3.1 introducing the general game theory concepts, does not contain any references. The definitions are just stated as such and it is unclear where each representation is coming from. This is mostly an issue for the -core as it is the most "non-standard definition" here.
- Inconsistent / Imprecise Language: Sometimes the language is not so clear: "min-norm selector" but in the paragraph "minimum norm selector". This inconsistency makes the comprehension a bit harder. "Let D ⊂N be a nonempty group." (line 180). Why use "group" as a stand in for coalition here. Naming the same thing differently is hard to follow.
- Definition 3.3, the Contextual distractor, is quite central for this paper, yet it receives little to no intuition for the reader. The definition is quite technical and the harmfulness implication in lines 186-187 is also very abstract. This should have been better developed and requires.
Reference
- [1] RegressionMSR https://neurips.cc/virtual/2025/loc/san-diego/poster/118119
- [2] LeverageSHAP https://iclr.cc/virtual/2025/poster/27831
- [3] OddSHAP https://icml.cc/virtual/2026/poster/60711
Questions for authors
Suggestions: Here is a small list of minor suggestions for small things that irked me.
- I think your abbreviation "ELC" for entropic least core is not a good choice. ELC is also known as egalitarian least core (the one with the l2 objective as the selection rule) and I would say this is what people would know ELC to stand for in the game theory literature. If I were you, I'd change the abbreviation.
- I highly suggest to use \phi as the attribution vector as is, in my opinion, quite standard in the literature. Writing feels very weird.