Research

Paper

TESTING March 25, 2026

The Luna Bound Propagator for Formal Analysis of Neural Networks

Authors

Henry LeCates, Haoze Wu

Abstract

The parameterized CROWN analysis, a.k.a., alpha-CROWN, has emerged as a practically successful bound propagation method for neural network verification. However, existing implementations of alpha-CROWN are limited to Python, which complicates integration into existing DNN verifiers and long-term production-level systems. We introduce Luna, a new bound propagator implemented in C++. Luna supports Interval Bound Propagation, the CROWN analysis, and the alpha-CROWN analysis over a general computational graph. We describe the architecture of Luna and show that it is competitive with the state-of-the-art alpha-CROWN implementation in terms of both bound tightness and computational efficiency on benchmarks from VNN-COMP 2025.

Metadata

arXiv ID: 2603.23878
Provider: ARXIV
Primary Category: cs.LG
Published: 2026-03-25
Fetched: 2026-03-26 06:02

Related papers

Raw Data (Debug)
{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2603.23878v1</id>\n    <title>The Luna Bound Propagator for Formal Analysis of Neural Networks</title>\n    <updated>2026-03-25T03:09:25Z</updated>\n    <link href='https://arxiv.org/abs/2603.23878v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2603.23878v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>The parameterized CROWN analysis, a.k.a., alpha-CROWN, has emerged as a practically successful bound propagation method for neural network verification. However, existing implementations of alpha-CROWN are limited to Python, which complicates integration into existing DNN verifiers and long-term production-level systems. We introduce Luna, a new bound propagator implemented in C++. Luna supports Interval Bound Propagation, the CROWN analysis, and the alpha-CROWN analysis over a general computational graph. We describe the architecture of Luna and show that it is competitive with the state-of-the-art alpha-CROWN implementation in terms of both bound tightness and computational efficiency on benchmarks from VNN-COMP 2025.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.LG'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.AI'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.LO'/>\n    <published>2026-03-25T03:09:25Z</published>\n    <arxiv:comment>13 pages, 2 figures</arxiv:comment>\n    <arxiv:primary_category term='cs.LG'/>\n    <author>\n      <name>Henry LeCates</name>\n    </author>\n    <author>\n      <name>Haoze Wu</name>\n    </author>\n  </entry>"
}