arXiv:2607. 08641v1 Announce Type: new Abstract: Over the last few years, there has been an increased interest in making machine learning models more interpretable.
By Yann Claes, Pierre Geurts, V\^an Anh Huynh-Thu
arXiv:2603. 14894v3 Announce Type: replace-cross Abstract: Trust and ethical concerns due to the widespread deployment of opaque machine learning (ML) models motivating the need for reliable model explanations.
By Sumedha Chugh, Ranjitha Prasad, Nazreen Shah
arXiv:2608. 25897v1 Announce Type: new Abstract: Explaining deep learning models operating on time series data is crucial in various applications that require transparent and interpretable insights into model behavior.
By Xu Zheng, Zichuan Liu, Zhuomin Chen, Mayur Akewar, Janki Bhimani, Jason Liu, Mo Sha, Jingchao Ni, Wei Cheng, Dongsheng Luo
Explaining deep learning models operating on time series data is crucial in various applications that require transparent and interpretable insights into model behavior. {Existing explanation methods...
Counterfactual (CF) explanations identify changes that alter an input's classification. While existing methods produce realistic and low-cost CFs, they often fail to ensure feasibility, by suggesting...
arXiv:2609.26037v1 Announce Type: new
Abstract: Explanations are central to causal reasoning, and cognitive science has long established that the human drive to explain is itself a mechanism for lear...
By Nicholas Tagliapietra, Florian Peter Busch, Moritz Willig, Matej Ze\v{c}evi\'c, Lavdim Halilaj, Juergen Luettin, Kristian Kersting
The paper introduces Probabilistic Causal Impact (PCI), a framework that blends actual causality (AC) with Pearl’s probability of necessity and sufficiency to provide tractable, causally grounded explanations. PCI reframes explainability as an estimation problem on a probabilistic causal model, enabling efficient approximation via Monte Carlo sampling. The authors evaluate PCI on synthetic and real-world data, demonstrating consistency with AC, scalability, and applicability to complex continuous systems and large-scale causal machine learning models.
By Rafal Urbaniak, Sam Witty, Daniel Waxman, Andy Zane, Poorva Garg, Emily Bunnapradist, Sankaran Vaidyanathan, Jack Feser, Drew Lehe, Eli Bingham
FCx is a new algorithm that generates counterfactual explanations while explicitly enforcing feasibility constraints. It uses a modified Variational Autoencoder with a multi‑factor loss to produce realistic, low‑cost counterfactuals that satisfy both hard constraints supplied by users and soft constraints inferred via causal inference. Experiments on four public datasets demonstrate that FCx matches state‑of‑the‑art performance across multiple metrics while guaranteeing feasibility.
By Kleopatra Markou, Vana Kalogeraki, Dimitrios Gunopulos
arXiv:2607. 21573v1 Announce Type: cross Abstract: Faithful explanations of time-series classifiers should identify subsequences that are not only sufficient to preserve a black-box model's prediction, but also necessary for maintaining it.
By Hongnan Ma, Yiwei Shi, Mengyue Yang, Weiru Liu
arXiv:2608.23835v1 Announce Type: new
Abstract: Real-world decision-making in public health and social science can greatly benefit from predictive models, yet translating predictions into effective i...
By Mulin Tian, Ajitesh Srivastava
arXiv:2609. 19077v1 Announce Type: cross Abstract: Formal explainability provides mathematically grounded justifications for individual predictions.
By Frederic Koriche, Jean-Marie Lagniez, Chi Tran
arXiv:2606. 28615v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly deployed in high-stakes domains, where free-text explanations such as chain-of-thought and post-hoc rationales are used to justify model outputs.
By Nhi Nguyen, Shauli Ravfogel, Rajesh Ranganath