Abstract
AbstractIn machine learning applications, there is a need to obtain predictive models of high performance and, most importantly, to allow end-users and practitioners to understand and act on their predictions. One way to obtain such understanding is via counterfactuals, that provide sample-based explanations in the form of recommendations on which features need to be modified from a test example so that the classification outcome of a given classifier changes from an undesired outcome to a desired one. This paper focuses on the domain of time series classification, more specifically, on defining counterfactual explanations for univariate time series. We propose , a model-agnostic method for generating locally-constrained counterfactual explanations for time series classification using gradient search either on the original space or on a latent space that is learned through an auto-encoder. An additional flexibility of our method is the inclusion of constraints on the counterfactual generation process that favour applying changes to particular time series points or segments while discouraging changing others. The main purpose of these constraints is to ensure more reliable counterfactuals, while increasing the efficiency of the counterfactual generation process. Two particular types of constraints are considered, i.e., example-specific constraints and global constraints. We conduct extensive experiments on 40 datasets from the UCR archive, comparing different instantiations of against three competitors. Our findings suggest that outperforms the three competitors in terms of two common metrics for counterfactuals, i.e., proximity and compactness. Moreover, obtains comparable counterfactual validity compared to the best of the three competitors. Finally, when comparing the unconstrained variant of to the constraint-based variants, we conclude that the inclusion of example-specific and global constraints yields a good performance while demonstrating the trade-off between the different metrics.
Publisher
Springer Science and Business Media LLC
Reference43 articles.
1. Ates, E., Aksar, B., Leung, V. J., & Coskun, A. K. (2021). Counterfactual explanations for multivariate time series. In 2021 International conference on applied artificial intelligence (ICAPAI) (pp. 1–8). https://doi.org/10.1109/ICAPAI49758.2021.9462056
2. Bagnall, A., Lines, J., Bostrom, A., Large, J., & Keogh, E. (2017). The great time series classification bake off: A review and experimental evaluation of recent algorithmic advances. Data Mining and Knowledge Discovery, 31(3), 606–660.
3. Balasubramanian, R., Sharpe, S., Barr, B., Wittenbach, J., & Bruss, C. B. (2020). Latent-CF: A simple baseline for reverse counterfactual explanations. In NeurIPS 2020 Workshop on Fair AI in Finance.
4. Bento, J., Saleiro, P., Cruz, A. F., Figueiredo, M. A., & Bizarro, P. (2021). TimeSHAP: Explaining recurrent models through sequence perturbations. In Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining (pp. 2565–2573, ACM, Virtual Event Singapore). https://doi.org/10.1145/3447548.3467166
5. Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5–32. https://doi.org/10.1023/A:1010933404324
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. COMET: Constrained Counterfactual Explanations for Patient Glucose Multivariate Forecasting;2024 IEEE 37th International Symposium on Computer-Based Medical Systems (CBMS);2024-06-26