Efficient neural network analysis with sum-of-infeasibilities

DOI10.1007/978-3-030-99524-9_8zbMATH Open1547.68461MaRDI QIDQ6535564FDOQ6535564

Authors: Haoze Wu, Aleksandar Zeljić, Guy Katz, Clark Barrett 

Publication date: 23 January 2024

zbMATH Keywords

convex optimizationneural networksstochastic local searchsum of infeasibilities

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Handbook of Markov Chain Monte Carlo
• An introduction to MCMC for machine learning
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Experiments in mixed-integer linear programming
• Safety verification of deep neural networks
• Reluplex: an efficient SMT solver for verifying deep neural networks
• Verification of deep convolutional neural networks using ImageStars
• Improved geometric path enumeration for verifying ReLU neural networks
• Title not available (Why is that?)
• Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
• Strong mixed-integer programming formulations for trained neural networks

Cited In (3)

• Towards formal XAI: formally approximate minimal explanations of neural networks
• Verifying the generalization of deep learning to out-of-distribution domains
• Verifying generalization in deep learning

This page was built for publication: Efficient neural network analysis with sum-of-infeasibilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535564)