A General Framework for Property-Driven Machine Learning
Not on the map. Why?
Abstract (arXiv)
Neural networks have been shown to frequently fail to learn critical safety and correctness properties purely from data, highlighting the need for training methods that directly integrate logical specifications. While adversarial training can be used to improve robustness to small perturbations within ε-cubes, domains other than computer vision -- such as control systems and natural language processing -- may require more flexible input region specifications via generalised hyper-rectangles. Differentiable logics offer a way to encode arbitrary logical constraints as additional loss terms that guide the learning process towards satisfying these constraints. In this paper, we investigate how these two complementary approaches can be unified within a single framework for property-driven machine learning, as a step toward effective formal verification of neural networks. We show that well-known properties from the literature are subcases of this general approach, and we demonstrate its practical effectiveness on a case study involving a neural network controller for a drone system. Our framework is made publicly available at https://github.com/tflinkow/property-driven-ml.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 45 of its 75 references that are in the map. First posted on arXiv 1 May 2025.
Builds on
45 of 75 references.
References · 45
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
- 2018Robustness May Be at Odds with Accuracycited by 880
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 744
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 567
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 445
- 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 394
- 2018Certified Defenses against Adversarial Examplescited by 306
33 more
- 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 270
- 2019Algorithms for Verifying Deep Neural Networkscited by 221
- 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 187
- 2018Scaling provable adversarial defensescited by 143
- 2019Branch and Bound for Piecewise Linear Neural Network Verificationcited by 138
- 2020NNV: The Neural Network Verification Tool for Deep Neural Networks and Learning-Enabled Cyber-Physical Systemscited by 128
- 2022Semantic Probabilistic Layers for Neuro-Symbolic Learningcited by 103
- 2022General Cutting Planes for Bound-Propagation-Based Neural Network Verificationcited by 103
- 2020Analyzing Differentiable Fuzzy Logic Operatorscited by 101
- 2024Marabou 2.0: A Versatile Formal Analyzer of Neural Networkscited by 81
- 2021The Second International Verification of Neural Networks Competition (VNN-COMP 2021): Summary and Resultscited by 71
- 2021Introduction to Neural Network Verificationcited by 63
- 2023First Three Years of the International Verification of Neural Networks Competition (VNN-COMP)cited by 58
- 2024Neural Network Verification with Branch-and-Bound for General Nonlinearitiescited by 47
- 2022Deep Learning with Logical Constraintscited by 44
- 2022The Third International Verification of Neural Networks Competition (VNN-COMP 2022): Summary and Resultscited by 39
- 2023The Fourth International Verification of Neural Networks Competition (VNN-COMP 2023): Summary and Resultscited by 38
- 2021Neural Network Robustness as a Verification Property: A Principled Case Studycited by 35
- 2021A Review of Formal Methods applied to Machine Learningcited by 33
- 2018Logit Pairing Methods Can Fool Gradient-Based Attackscited by 27
- 2020On Robustness Metrics for Learning STL Taskscited by 27
- 2025Beyond the convexity assumption: Realistic tabular data generation under quantifier-free real linear constraintscited by 18
- 2024NLP Verification: Towards a General Methodology for Certifying Robustnesscited by 16
- 2023Logic of Differentiable Logics: Towards a Uniform Semantics of DLcited by 15
- 2024Vehicle: Bridging the Embedding Gap in the Verification of Neuro-Symbolic Programscited by 14
- 2019Scaling up the randomized gradient-free adversarial attack reveals overestimation of robustness using established attackscited by 11
- 2025A Probabilistic Neuro-symbolic Layer for Algebraic Constraint Satisfactioncited by 11
- 2024ULLER: A Unified Language for Learning and Reasoningcited by 9
- 2024Comparing differentiable logics for learning with logical constraintscited by 7
- 2023ANTONIO: Towards a Systematic Method of Generating NLP Benchmarks for Verificationcited by 6
- 2022Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Proverscited by 5
- 2024Compiling High-Level Neural Network Specifications into VNN-LIB Queriescited by 3
- 2024Taming Differentiable Logics with Coq Formalisationcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.