mlsanityData to 7 Oct 2026

From Baselines to Transport Geodesics: Axiomatic Attribution via Optimal Generative Flows

arXiv 2603.05093 ↗First posted 5 Mar 2026cs.LG cs.AI cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Feature attributions often hide a critical modeling choice: they explain a prediction along a counterfactual path from a reference state to an input. Different baselines, interpolations, and generative trajectories define different paths and can therefor produce different explanations. We study this path ambiguity as a modeling problem. Our central question is whether the path can be chosen by the data-generating transport process, rather than by a hand-designed interpolation or by the sensitivity geometry of the model being explained. We separate attribution into fixed-path credit allocation and path selection. For a fixed path, we prove that the Aumann-Shapley line integral is the unique attribution rule under standard fixed-path axioms and explicit coordinate-trace regularity. For path selection, we minimize kinetic action over flows that transport a reference distribution to the data distribution, yielding a transport-geodesic attribution principle. We approximate this ideal with Rectified Flow and Reflow and derive stability bounds linking vector-field error to attribution error. Experiments show that lower-action, transport-consistent paths produce more stable and structured explanations, preserving competitive deletion faithfulness, without claiming data-manifold membership. Our code is available at https://github.com/cenweizhang/OTFlowSHAP.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 5 Mar 2026.

Builds on

25 of 35 references.

References · 25

  1. 2020Denoising Diffusion Implicit Modelscited by 9,655
  2. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  3. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  4. 2022Flow Matching for Generative Modelingcited by 5,426
  5. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  6. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
  7. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  8. 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,967
  9. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
  10. 2013Visualizing and Understanding Convolutional Networkscited by 2,278
  11. 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
  12. 2017SmoothGrad: removing noise by adding noisecited by 1,097
13 more
  1. 2014Striving for Simplicity: The All Convolutional Netcited by 983
  2. 2018RISE: Randomized Input Sampling for Explanation of Black-box Modelscited by 825
  3. 2017Interpretable Explanations of Black Boxes by Meaningful Perturbationcited by 611
  4. 2018A Benchmark for Interpretability Methods in Deep Neural Networkscited by 467
  5. 2015Evaluating the visualization of what a Deep Neural Network has learnedcited by 416
  6. 2019The many Shapley values for model explanationcited by 341
  7. 2015Explaining NonLinear Classification Decisions with Deep Taylor Decompositioncited by 248
  8. 2019Sanity Checks for Saliency Metricscited by 119
  9. 2019Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainabilitycited by 114
  10. 2021Guided Integrated Gradients: An Adaptive Path Method for Removing Noisecited by 102
  11. 2020Shapley explainability on the data manifoldcited by 88
  12. 2024Manifold Integrated Gradients: Riemannian Geometry for Feature Attributioncited by 21
  13. 2025Using the Path of Least Resistance to Explain Deep Networkscited by 3

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025On the Relation between Rectified Flows and Optimal Transport
  2. 2026Probabilistic Geodesic Flow Matching on Location-Scale Families
  3. 2026Beckmann Transport Models: From Autonomous Flows to One-Step Maps
  4. 2026The Fundamental Limits of Valid Transport Map Estimation
  5. 2026Self-Consistent Generative Paths via Admissible Random Variational Transport
  6. 2026Path-independent Flow Matching for Multi-parameter Generative Dynamics
  7. 2026Particle Dynamics of Flow Matching and Classifier-Free Guidance from a Stagewise Geometry Perspective
  8. 2024Metric Flow Matching for Smooth Interpolations on the Data Manifold