arXiv Machine Learning By Jonas Fingerhut, Lukas Koller, Matthias Althoff

Training Mixed-Monotone Neural Networks for Verification Without Set Propagation

Read the original on arXiv Machine Learning →

The paper introduces a new neural network architecture that represents mixed‑monotone functions as the difference of two monotone subnetworks, enabling tight output enclosures via only two forward passes of opposite corners of an input interval. The enclosure size is a closed‑form function of the network weights, allowing direct minimization during training. Experiments on regression and dynamical‑system benchmarks show that the trained networks achieve enclosure sizes within 0.5% of a proven lower bound while maintaining prediction accuracy, and the method is significantly faster and often tighter than existing techniques such as CROWN, α‑CROWN, and zonotope propagation.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 14

Branch and Bound for Relational Verification of Neural Networks

arXiv:2608. 13118v1 Announce Type: new Abstract: Verification of neural networks against relational specifications, such as global robustness, is crucial for safety-critical applications of cyber-physical systems (CPS), given their increasing adoption of AI components.

By Kota Fukuda, Zhenya Zhang, Guanqin Zhang, Jianjun Zhao