Bielefeld Pub
metadata only
Convex Density Constraints for Computing Plausible Counterfactual Explanations
Artelt A, Hammer B. Convex Density Constraints for Computing Plausible Counterfactual Explanations. In: Farkas I, Masulli P, Wermter S, eds. Artificial Neural Networks and Machine Learning - ICANN 2020 - 29th International Conference on Artificial Neural Networks, Bratislava, Slovakia, September
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Narrow Ontic Counterfactual Account of Distinctively Mathematical Explanation#761508
- Efficient computation of counterfactual explanations of LVQ models#779198
- Counterfactual explanations as interventions in latent space#478134
- Counter Countermathematical Explanations#743995
- On the computation of counterfactual explanations - A survey#779282
Record · ID 779200
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive