The reviewed record of science sign in
Pith

arxiv: 2110.08105 · v2 · pith:CRONBAGO · submitted 2021-10-15 · cs.LG · math.OC

Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings

Reviewed by Pithpith:CRONBAGOopen to challenge →

classification cs.LG math.OC
keywords relevancefrank-wolfeconstrainedinterpretablemapsneuraloptimizationalgorithm
0
0 comments X
read the original abstract

We study the effects of constrained optimization formulations and Frank-Wolfe algorithms for obtaining interpretable neural network predictions. Reformulating the Rate-Distortion Explanations (RDE) method for relevance attribution as a constrained optimization problem provides precise control over the sparsity of relevance maps. This enables a novel multi-rate as well as a relevance-ordering variant of RDE that both empirically outperform standard RDE and other baseline methods in a well-established comparison test. We showcase several deterministic and stochastic variants of the Frank-Wolfe algorithm and their effectiveness for RDE.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.