LGLOJun 18

Shifting-based Optimizable Linear Relaxations for General Activation Functions

arXiv:2606.202926.4
Predicted impact top 67% in LG · last 90 daysOriginality Highly original
AI Analysis

For neural network verification, SLiR eliminates the need for hand-crafted relaxations for each activation function, making verification more broadly applicable.

SLiR introduces a general method for computing optimizable linear relaxations of activation functions, requiring only a Lipschitz constant or critical points, and enables verification of up to 7.8x more properties compared to state-of-the-art methods.

The use of neural networks (NNs) is rapidly increasing, including in safety- and security-critical domains. To provide formal guarantees about NN behavior, many verification methods rely on optimizable linear relaxations of activation functions. However, existing techniques depend on hand-crafted relaxations for each activation function. Extension to state-of-the-art activation functions therefore requires substantial manual effort. In contrast, our approach SLiR (Shifting-based Linear Relaxations) is broadly applicable, requiring only a Lipschitz constant or a set of critical points. SLiR parameterizes relaxations by their slope and computes the corresponding offset via a shifting procedure that ensures sound upper and lower bounds over the input domain, enabling efficient optimization while maintaining correctness. Our experiments show that SLiR produces tight relaxations across a wide range of practical activation functions and enables verification of up to 7.8x more properties compared to state-of-the-art methods.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes