Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchProduse AI

analiza aiqbench

This research introduces a coalgebraic framework for tracking tensor provenance in AI compilers, solving the challenge of maintaining data lineage during aggressive graph rewrites without invasive instrumentation. By observing computational actions rather than propagating identifiers, the proposed method preserves provenance even when intermediate nodes are eliminated, offering a robust solution for debugging and validating compiler transformations. The accompanying prototype, COVAN, demonstrates that this approach achieves stable tracking with minimal engineering overhead, addressing a critical gap in compiler reliability.
Sursă care acoperăarXiv

Provenance Tracking in AI Compilers through the Lens of Coalgebra

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2606.10937v1 Announce Type: cross Abstract: 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.

Abstract: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.

Databases (cs.DB); Artificial Intelligence (cs.AI)

arXiv:2606.10937 [cs.DB]

(or arXiv:2606.10937v1 [cs.DB] for this version)

https://doi.org/10.48550/arXiv.2606.10937 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 221 cuvinte

Subiecte conexe