1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LG2023
Hardness of Deceptive Certificate Selection
Stephan Wäldchen
Recent progress towards theoretical interpretability guarantees for AI has been made with classifiers that are based on interactive proof systems. A prover selects a certificate fr…
cs.LG2022★ 1 cited
Training Characteristic Functions with Reinforcement Learning: XAI-methods play Connect Four
Stephan Wäldchen, Felix Huber, Sebastian Pokutta
One of the goals of Explainable AI (XAI) is to determine which input components were relevant for a classifier decision. This is commonly know as saliency attribution. Characterist…
cs.LG2021
A Complete Characterisation of ReLU-Invariant Distributions
Jan Macdonald, Stephan Wäldchen
We give a complete characterisation of families of probability distributions that are invariant under the action of ReLU neural network layers. The need for such families arises du…