mlsanityData to 14 Oct 2026

Real-Time Safe Control of Neural Network Dynamic Models with Sound Approximation

arXiv 2404.13456 ↗First posted 20 Apr 2024cs.LG cs.RO cs.SYcited by 5

Not on the map. Why?

Abstract (arXiv)

Safe control of neural network dynamic models (NNDMs) is important to robotics and many applications. However, it remains challenging to compute an optimal safe control in real time for NNDM. To enable real-time computation, we propose to use a sound approximation of the NNDM in the control synthesis. In particular, we propose Bernstein over-approximated neural dynamics (BOND) based on the Bernstein polynomial over-approximation (BPO) of ReLU activation functions in NNDM. To mitigate the errors introduced by the approximation and to ensure persistent feasibility of the safe control problems, we synthesize a worst-case safety index using the most unsafe approximated state within the BPO relaxation of NNDM offline. For the online real-time optimization, we formulate the first-order Taylor approximation of the nonlinear worst-case safety constraint as an additional linear layer of NNDM with the l2 bounded bias term for the higher-order remainder. Comprehensive experiments with different neural dynamics and safety constraints show that with safety guaranteed, our NNDMs with sound approximation are 10-100 times faster than the safe control baseline that uses mixed integer programming (MIP), validating the effectiveness of the worst-case safety index and scalability of the proposed BOND in real-time large-scale settings. The code is available at https://github.com/intelligent-control-lab/BOND.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 18 of its 24 references that are in the map. First posted on arXiv 20 Apr 2024.

Builds on

18 of 24 references.

References · 18

  1. 2019When to Trust Your Model: Model-Based Policy Optimizationcited by 773
  2. 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 567
  3. 2016The CMA Evolution Strategy: A Tutorialcited by 377
  4. 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 328
  5. 2017Neural Network Dynamics for Model-Based Deep Reinforcement Learning with Model-Free Fine-Tuningcited by 297
  6. 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 242
  7. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 228
  8. 2019Algorithms for Verifying Deep Neural Networkscited by 221
  9. 2018Scaling provable adversarial defensescited by 143
  10. 2020SoK: Certified Robustness for Deep Neural Networkscited by 105
  11. 2021POLAR: A Polynomial Arithmetic Framework for Verifying Neural-Network Controlled Systemscited by 39
  12. 2021Safe Control with Neural Network Dynamic Modelscited by 22
6 more
  1. 2019Safe Control Algorithms Using Energy Functions: A Unified Framework, Benchmark, and New Directionscited by 17
  2. 2023Model-Based Control with Sparse Neural Dynamicscited by 16
  3. 2021Safe Control Synthesis via Input Constrained Control Barrier Functionscited by 13
  4. 2022BERN-NN: Tight Bound Propagation For Neural Networks Using Bernstein Polynomial Interval Arithmeticcited by 5
  5. 2023DeepBern-Nets: Taming the Complexity of Certifying Neural Networks using Bernstein Polynomial Activations and Precise Bound Propagationcited by 5
  6. 2023System-level Safety Guard: Safe Tracking Control through Uncertain Neural Network Dynamics Modelscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 2.

5 papers.