Mechanistic Interpretability for Transformer-based Time Series Classification
Mat\=iss Kaln\=are, Sofoklis Kitharidis, Thomas B\"ack, Niki van Stein

TL;DR
This paper adapts mechanistic interpretability techniques from NLP to transformer models for time series classification, revealing internal causal structures and key features that drive model decisions.
Contribution
It introduces adapted interpretability methods for time series transformers and uncovers their internal causal mechanisms and key attention components.
Findings
Identified causal roles of attention heads and timesteps.
Constructed causal graphs illustrating information flow.
Demonstrated autoencoders' ability to reveal interpretable features.
Abstract
Transformer-based models have become state-of-the-art tools in various machine learning tasks, including time series classification, yet their complexity makes understanding their internal decision-making challenging. Existing explainability methods often focus on input-output attributions, leaving the internal mechanisms largely opaque. This paper addresses this gap by adapting various Mechanistic Interpretability techniques; activation patching, attention saliency, and sparse autoencoders, from NLP to transformer architectures designed explicitly for time series classification. We systematically probe the internal causal roles of individual attention heads and timesteps, revealing causal structures within these models. Through experimentation on a benchmark time series dataset, we construct causal graphs illustrating how information propagates internally, highlighting key attention…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Time Series Analysis and Forecasting · Machine Learning in Healthcare
