paperbot · PL 论文追踪

全部论文 待读 收藏

P1 Support Triangle Machine

支撑三角形机器(Support Triangle Machine)
PLDI 9(PLDI)2025匹配度 5/10 · 论文属于 DNN 形式化验证中的凸近似方法,与用户关注的机器学习系统形式化验证/程序验证有相邻关系,且兼具理论证明与实验评估;但它不涉及 LLM/Agent、浮点程序分析或贝叶斯程序分析,也不是将 LLM 用于静态分析,因此不在当前研究追逐的核心议题上。引用 0 inbox
Jiaying Li, Chunxue Hao
crossref: 2026-09-10

AI 速览

一句话:提出凸近似提升问题及支撑三角形机器,将单神经元近似提升为更精确的多神经元近似,用于DNN验证。

深度神经网络验证依赖近似,但单神经元近似易构造而精度低,多神经元近似精度高但构造复杂,二者间存在明显空白。本文将这一过渡形式化为新问题“凸近似提升”(CAL),并提出构造性方法“支撑三角形机器”(STM)。STM 基于两点:支撑三角形这一简单几何结构及高效三角形提升技术可连接单神经元与多神经元近似;典型单神经元近似可分解为多个可原子提升分量。对每个 CAL 实例,STM 逐输出坐标将单神经元近似分解为线性部分,分别提升并合成中间近似,迭代进行。作者证明了 STM 的正确性,并在多种 CAL 问题与 DNN 验证任务上实验,表明其适用性广、精度更高且效率稳定。

问题
DNN 验证中的近似精度与构造复杂度之间存在空白:单神经元近似简单但精度低,多神经元近似精确但构造复杂。
方法
将单神经元近似提升为多神经元近似形式化为凸近似提升问题,提出 STM,通过支撑三角形与三角形提升技术逐坐标分解、提升并迭代合成多神经元近似。
评估
理论上证明 STM 的正确性,并在多种 CAL 问题与 DNN 验证任务上进行实验,验证其广泛适用性、精度提升与效率。
原文摘要(Abstract)

Approximations play a pivotal role in verifying deep neural networks (DNNs). Existing approaches typically rely on either single-neuron approximations (simpler to design but less precise) or multi-neuron approximations (higher precision but significantly more complex to construct). Between them, a notable gap exists. This work bridges the gap. The idea is to lift single-neuron approximations into multi-neuron approximations with precision gain. To this end, we formulate the approximation transition as a novel problem, named Convex Approximation Lifting (CAL), and propose a constructive approach, Support Triangle Machine (STM), to solving it. STM is grounded in two core insights: (i) there exists a simple geometric structure, called the support triangle, along with an efficient triangle lifting technique that connects single-neuron approximations and multi-neuron approximations; and (ii) typical single-neuron approximations can be easily decomposed into multiple atomically liftable components . Specifically, given a CAL instance, STM constructs a multi-neuron approximation by iteratively processing each output coordinate. For each coordinate, it decomposes the single-neuron approximation into several linear parts, lifts each of them using the triangle lifting technique, and then synthesize an intermediate approximation, which later servers as input for the next iteration. We theoretically prove the correctness of STM and empirically evaluate its performance on a variety of CAL problems and DNN verification tasks. Experimental results demonstrate STM’s broad applicability, improved precision, and sustained efficiency. Beyond DNN verification, STM has the potential to facilitate approximation construction process in more general tasks, and we expect it to catalyze further research in related fields.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot3100,
  title = {Support Triangle Machine},
  author = {Jiaying Li and Chunxue Hao},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {9},
  number = {PLDI},
  year = {2025},
  doi = {10.1145/3729255}
}