A Tensor-Based Compiler and a Runtime for Neuron-Level DNN Certifier Specifications

TL;DR

This paper introduces a compiler framework that translates neuron-level DNN certifier specifications into efficient tensor-based implementations, enabling easier development and analysis of certifiers with performance comparable to manual optimization.

Contribution

The authors present a novel compiler and runtime system that bridges the semantic gap between neuron-level certifier design and tensor-level implementation, including a new IR and tensor compression format.

Findings

Compiler achieves performance comparable to hand-optimized code

Enables easy development of new certifiers for diverse DNNs

Introduces g-BCSR tensor format for efficient sparse tensor representation

Abstract

The uninterpretability of DNNs has led to the adoption of abstract interpretation-based certification as a practical means to establish trust in real-world systems that rely on DNNs. However, the current landscape supports only a limited set of certifiers, and developing new ones or modifying existing ones for different applications remains difficult. This is because the mathematical design of certifiers is expressed at the neuron level, while their implementations are optimized and executed at the tensor level. This mismatch creates a semantic gap between design and implementation, making manual bridging both complex and expertise-intensive -- requiring deep knowledge in formal methods, high-performance computing, etc. We propose a compiler framework that automatically translates neuron-level specifications of DNN certifiers into tensor-based, layer-level implementations. This is enabled by two key innovations: a novel stack-based intermediate representation (IR) and a shape analysis that infers the implicit tensor operations needed to simulate the neuron-level semantics. During lifting, the shape analysis creates tensors in the minimal shape required to perform the corresponding operations. The IR also enables domain-specific optimizations as rewrites. At runtime, the resulting tensor computations exhibit sparsity tied to the DNN architecture. This sparsity does not align well with existing formats. To address this, we introduce g-BCSR, a double-compression format that represents tensors as collections of blocks of varying sizes, each possibly internally sparse. Using our compiler and g-BCSR, we make it easy to develop new certifiers and analyze their utility across diverse DNNs. Despite its flexibility, the compiler achieves performance comparable to hand-optimized implementations.