TriShGAN: Enhancing Sparsity and Robustness in Multivariate Time Series Counterfactuals Explanation
Not on the map. Why?
Abstract (arXiv)
In decision-making processes, stakeholders often rely on counterfactual explanations, which provide suggestions about what should be changed in the queried instance to alter the outcome of an AI system. However, generating these explanations for multivariate time series presents challenges due to their complex, multi-dimensional nature. Traditional Nearest Unlike Neighbor-based methods typically substitute subsequences in a queried time series with influential subsequences from an NUN, which is not always realistic in real-world scenarios due to the rigid direct substitution. Counterfactual with Residual Generative Adversarial Networks-based methods aim to address this by learning from the distribution of observed data to generate synthetic counterfactual explanations. However, these methods primarily focus on minimizing the cost from the queried time series to the counterfactual explanations and often neglect the importance of distancing the counterfactual explanation from the decision boundary. This oversight can result in explanations that no longer qualify as counterfactual if minor changes occur within the model. To generate a more robust counterfactual explanation, we introduce TriShGAN, under the CounteRGAN framework enhanced by the incorporation of triplet loss. This unsupervised learning approach uses distance metric learning to encourage the counterfactual explanations not only to remain close to the queried time series but also to capture the feature distribution of the instance with the desired outcome, thereby achieving a better balance between minimal cost and robustness. Additionally, we integrate a Shapelet Extractor that strategically selects the most discriminative parts of the high-dimensional queried time series to enhance the sparsity of counterfactual explanation and efficiency of the training process.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 22 references that are in the map. First posted on arXiv 9 Nov 2025.
Builds on
11 of 22 references.
References · 11
- 2022Generative Adversarial Networkscited by 5,627
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,089
- 2019Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifierscited by 144
- 2020Instance-based Counterfactual Explanations for Time Series Classificationcited by 64
- 2020Counterfactual Explanations for Machine Learning on Multivariate Time Series Datacited by 49
- 2022Robust Counterfactual Explanations for Tree-Based Ensemblescited by 49
- 2024Explaining Time Series via Contrastive and Locally Sparse Perturbationscited by 22
- 2021CounterNet: End-to-End Training of Prediction Aware Counterfactual Explanationscited by 17
- 2022Motif-guided Time Series Counterfactual Explanationscited by 12
- 2021Towards a Rigorous Evaluation of Explainability for Multivariate Time Seriescited by 10
- 2024Autonomous Goal Detection and Cessation in Reinforcement Learning: A Case Study on Source Term Estimationcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.