Skip to content
aiqbench takeAI Research

aiqbench analysis

This paper establishes a unified game-theoretic framework for backward attribution methods in neural networks, recasting gradients and LRP as integrals over game trajectories on extended network graphs. By formalizing explanation properties like robustness and localization focus as game-theoretic concepts such as risk aversion and policy regularization, the authors propose novel adaptations of existing rules that outperform prior transformer-specific methods. This theoretical advance directly addresses mechanistic interpretability challenges in debugging and understanding model decision boundaries.
Sources coveringarXiv, AI Alignment Forum, Quantum Zeitgeist
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Playing the network backward: A Game Theoretic Attribution Framework

arXiv2 min read

arXiv:2605.06212v2 Announce Type: replace Abstract: Attribution methods explain which input features drive a model's prediction, making them central to model debugging and mechanistic interpretability. Yet backward attribution methods, including gradients, LRP, and transformer-specific rules, lack a shared framework in which to compare the underlying backward calculations. We introduce such a framework by recasting backward attribution as a two-player game on an extended network graph, building on Gaubert and Vlassopoulos' ReLU Net Game. Gradients and the full alpha-beta-LRP family arise as integrals over game trajectories under specific equilibria, so attribution maps become projections of trajectory distributions rather than the primary object. Desired explanation properties, such as localisation focus, robustness to input noise, or stable attention routing, can be specified as game-theoretic concepts, including policy regularization, risk aversion, and extended action sets, and translate directly into novel adaptations of the well-known backward rules. On ViT-B/16, one such selected adaptation of alpha-beta-LRP outperforms prior transformer-specific backward methods across all considered localisation metrics.

Abstract:Attribution methods explain which input features drive a model's prediction, making them central to model debugging and mechanistic interpretability. Yet backward attribution methods, including gradients, LRP, and transformer-specific rules, lack a shared framework in which to compare the underlying backward calculations. We introduce such a framework by recasting backward attribution as a two-player game on an extended network graph, building on Gaubert and Vlassopoulos' ReLU Net Game. Gradients and the full alpha-beta-LRP family arise as integrals over game trajectories under specific equilibria, so attribution maps become projections of trajectory distributions rather than the primary object. Desired explanation properties, such as localisation focus, robustness to input noise, or stable attention routing, can be specified as game-theoretic concepts, including policy regularization, risk aversion, and extended action sets, and translate directly into novel adaptations of the well-known backward rules. On ViT-B/16, one such selected adaptation of alpha-beta-LRP outperforms prior transformer-specific backward methods across all considered localisation metrics.

79 pages (9 pages main text, 66 pages appendix). Code: this https URL

Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)

arXiv:2605.06212 [cs.LG]

(or arXiv:2605.06212v2 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2605.06212 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 265 words

Related coverage