Polynomial-time max-product algorithms for exact (neuron-level) and approximate (node-level) top-K relevant walk search in GNN-LRP explanations.
and Debnath, Gargi and Shusterman, Alan J
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LG 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
PLACE delivers a closed-form certified classification method for point clouds and graphs based on persistent homology with explicit excess-risk bounds, selection rules, and training-time certificates.
Message-passing algorithms compute GNN-LRP subgraph attributions in linear time w.r.t. network depth by exploiting the distributive property.
citing papers explorer
No citing papers match the current filters.