arXiv Machine Learning

Playing the network backward: A Game Theoretic Attribution Framework

The paper proposes a game-theoretic framework that recasts backward attribution methods—such as gradients, LRP, and transformer-specific rules—as a two-player game on an extended network graph. Within this framework, gradients and the full alpha‑beta‑LRP family emerge as integrals over game trajectories under specific equilibria, turning attribution maps into projections of trajectory distributions. By expressing desired explanation properties (e.g., localisation focus, robustness to input noise, stable attention routing) as game-theoretic concepts, the authors derive novel adaptations of backward rules, one of which outperforms existing transformer-specific methods on ViT‑B/16 across all localisation metrics.

Hugging Face Trending Papers
Jun 24

RevengeBench: Reverse Engineering Code-Space Policies from Behavioral Experiments

For most of scientific history, researchers studying behavior could only infer hidden mechanisms from outward actions: an inverse problem that becomes more tractable when observation is augmented by targeted intervention. We pose a computational analogue: given only behavioral traces of an agent in a game environment, can a learner reconstruct the underlying decision program as executable code, and how much does this reconstruction improve with the ability to design controlled experiments?

arXiv Machine Learning
Jun 25

RevengeBench: Reverse Engineering Code-Space Policies from Behavioral Experiments

arXiv:2606. 26094v1 Announce Type: new Abstract: For most of scientific history, researchers studying behavior could only infer hidden mechanisms from outward actions: an inverse problem that becomes more tractable when observation is augmented by targeted intervention.

By Babak Rahmani, Sebastian Dziadzio, Joschka Str\"uber, Sergio Hern\'andez-Guti\'errez, Matthias Bethge
arXiv Machine Learning
Jun 5

Temporal Preference Concepts and their Functions in a Large Language Model

arXiv:2606. 05194v1 Announce Type: new Abstract: Large Language Models (LLMs) are increasingly being deployed to make decisions that require trading off near-term gains against long-term consequences, yet little is known about how they internally represent or resolve these tradeoffs.

By Ian Rios-Sialer, Shantanu Darveshi, Shuai Jiang, Avigya Paudel, Anastasiia Pronina, Ipshita Bandyopadhyay, Justin Shenk
arXiv Machine Learning
Aug 11

Decision-Focused Learning in Network Interdiction Games

arXiv:2608. 09036v1 Announce Type: cross Abstract: We study decision-focused learning (DFL) in shortest-path network interdiction (SPNI) games, a Stackelberg game where an interdictor (leader) strengthens the networks' arcs against attacks, while an evader (follower) who is uncertain about costs of attacking network arcs relies on a machine-learned predictor to identify the shortest path.

By Luca M. Hartmann, Parinaz Naghizadeh
arXiv AI
Oct 31

Rethinking GFlowNet Training: Negative Reinforce Dynamics

The paper introduces Negative Reinforce Dynamics (NRD), a new training approach for Generative Flow Networks (GFlowNets) that addresses the exploration–correctness trade‑off inherent in standard semi‑gradient updates. By linking the full gradient to a min‑min dynamic between a GFlowNet and a decoupled sampler, NRD effectively reduces balance errors in high‑error regions while preserving a single‑policy framework. Experiments on standard benchmarks show that NRD speeds up convergence and improves exploration efficiency compared to existing methods, without requiring a separate teacher or auxiliary policy.

By Pedro Dall'Antonia, Daniel Csillag, Diego Mesquita