Mechanistic Interpretability of Atmospheric Rivers in GraphCast
cs.LG, cs.AI
Submitted: 2026-10-06
Updated: 2026-10-06
Comments: Accepted to TCCML NeurIPS workshop 2026
Code: https://github.com/AikyamLab/climate_xai
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: While AI weather models now rival operational forecasts, how they represent the atmosphere internally remains an open question: feature attribution reveals which input patterns matter, not what the
Terminology
Abstract
While AI weather models now rival operational forecasts, how they represent the atmosphere internally remains an open question: feature attribution reveals which input patterns matter, not what the model computes or how it combines information internally. We train sparse autoencoders (SAEs) on GraphCast to uncover its learned concepts, using atmospheric rivers as our phenomenon of focus. Both standard and Matryoshka SAEs show GraphCast computes atmospheric river intensity, measured by integrated vapor transport (IVT), as a stable internal variable, despite IVT being neither an input nor a target. In contrast to the unstructured concept retrieval of the standard SAE, the Matryoshka SAE orders concepts by importance and exposes their relations. Atmospheric river concepts persist across depth and direct interventions confirm causality. This method offers a way to find internal variables and determine which of them the model actually relies on, which is a prerequisite for asking whether those variables remain meaningful as the phenomenon changes under a warming climate.
Sources
- Towards A Rigorous Science of Interpretable Machine Learning
- SmoothGrad: removing noise by adding noise
- Towards mechanistic understanding in a data-driven weather model: internal activations reveal interpretable physical features
- Scaling and evaluating sparse autoencoders
- Learning Multi-Level Features with Matryoshka Sparse Autoencoders
- A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoders
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks