169 citations · 183 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LG2024
S-CFE: Simple Counterfactual Explanations
Shpresim Sadiku, Moritz Wagner, Sai Ganesh Nagarajan +1
We study the problem of finding optimal sparse, manifold-aligned counterfactual explanations for classifiers. Canonically, this can be formulated as an optimization problem with mu…
cs.GT2024
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan
Adversarial multiplayer games are an important object of study in multiagent learning. In particular, polymatrix zero-sum games are a multiplayer setting where Nash equilibria are…