Provenance Tracking in AI Compilers through the Lens of Coalgebra
Not on the map. Why?
Abstract (arXiv)
AI compilers aggressively rewrite computation graphs through normalization, lowering, and optimization, making it difficult to track the provenance of tensors and operators across compilation. Reliable provenance is essential for attaching platform-specific postprocessing, debugging compiler behavior, and validating transformations, yet existing solutions are either invasive or ad hoc under non-injective graph rewrites. We present a lightweight, generative approach to provenance tracking based on observational semantics. Instead of propagating identifiers through compiler passes, we observe graph transformations and reason about provenance in terms of observable computational actions. We formalize this approach using a coalgebraic model and bisimulation, which preserves provenance even when intermediate nodes are eliminated. Furthermore, we implement this approach in a prototype AI compiler COVAN, demonstrating stable provenance across compilation pipelines with minimal engineering overhead.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 13 references that are in the map. First posted on arXiv 9 Jun 2026.
Builds on
3 of 13 references.
References · 3
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2018Glow: Graph Lowering Compiler Techniques for Neural Networkscited by 75
Built on by
Not cited yet.