{"total":50,"rows":[{"id":"2103.06624","title":"Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verification","created":"2021-03-11","cited_by_count":228,"area":null},{"id":"2208.05740","title":"General Cutting Planes for Bound-Propagation-Based Neural Network Verification","created":"2022-08-11","cited_by_count":103,"area":null},{"id":"2205.00263","title":"Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound","created":"2022-04-30","cited_by_count":92,"area":null},{"id":"2103.03638","title":"PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations","created":"2021-03-05","cited_by_count":77,"area":null},{"id":"2206.12227","title":"Adversarial Robustness of Deep Neural Networks: A Survey from a Formal Verification Perspective","created":"2022-06-24","cited_by_count":42,"area":null},{"id":"2102.04373","title":"Partition-based formulations for mixed-integer optimization of trained ReLU neural networks","created":"2021-02-08","cited_by_count":39,"area":null},{"id":"2305.00241","title":"When Deep Learning Meets Polyhedral Theory: A Survey","created":"2023-04-29","cited_by_count":39,"area":null},{"id":"2202.02414","title":"OMLT: Optimization & Machine Learning Toolkit","created":"2022-02-04","cited_by_count":35,"area":null},{"id":"2203.11201","title":"Efficient Neural Network Analysis with Sum-of-Infeasibilities","created":"2022-03-19","cited_by_count":24,"area":null},{"id":"2305.13991","title":"Expressive Losses for Verified Robustness via Convex Combinations","created":"2023-05-23","cited_by_count":23,"area":null},{"id":"2206.14772","title":"IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound","created":"2022-06-29","cited_by_count":21,"area":null},{"id":"2203.03153","title":"Scalable Verification of GNN-based Job Schedulers","created":"2022-03-07","cited_by_count":19,"area":null},{"id":"2303.01713","title":"Convex Bounds on the Softmax Function with Applications to Robustness Verification","created":"2023-03-03","cited_by_count":19,"area":null},{"id":"2206.03669","title":"Toward Certified Robustness Against Real-World Distribution Shifts","created":"2022-06-08","cited_by_count":16,"area":null},{"id":"2110.01388","title":"Neural Network Verification in Control","created":"2021-09-30","cited_by_count":14,"area":null},{"id":"2206.07311","title":"Can pruning improve certified robustness of neural networks?","created":"2022-06-15","cited_by_count":14,"area":null},{"id":"2102.06700","title":"On the Paradox of Certified Training","created":"2021-02-12","cited_by_count":12,"area":null},{"id":"2107.08467","title":"GoTube: Scalable Stochastic Verification of Continuous-Depth Models","created":"2021-07-18","cited_by_count":12,"area":null},{"id":"2101.05844","title":"Scaling the Convex Barrier with Sparse Dual Algorithms","created":"2021-01-14","cited_by_count":10,"area":null},{"id":"2108.13628","title":"Learning Optimal Prescriptive Trees from Observational Data","created":"2021-08-31","cited_by_count":10,"area":null},{"id":"2206.07839","title":"Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustness","created":"2022-06-15","cited_by_count":10,"area":null},{"id":"2402.13937","title":"Verifying message-passing neural networks via topology-based bounds tightening","created":"2024-02-21","cited_by_count":10,"area":null},{"id":"2512.11087","title":"Clip-and-Verify: Linear Constraint-Driven Domain Clipping for Accelerating Neural Network Verification","created":"2025-12-11","cited_by_count":9,"area":null},{"id":"2106.09117","title":"DeepSplit: Scalable Verification of Deep Neural Networks via Operator Splitting","created":"2021-06-16","cited_by_count":8,"area":null},{"id":"2208.09872","title":"Provably Tightest Linear Approximation for Robustness Verification of Sigmoid-like Neural Networks","created":"2022-08-21","cited_by_count":8,"area":null},{"id":"2311.04015","title":"Expressivity of ReLU-Networks under Convex Relaxations","created":"2023-11-07","cited_by_count":8,"area":null},{"id":"2408.13140","title":"Verification of Geometric Robustness of Neural Networks via Piecewise Linear Approximation and Lipschitz Optimisation","created":"2024-08-23","cited_by_count":7,"area":null},{"id":"2112.02215","title":"Deep Policy Iteration with Integer Programming for Inventory Management","created":"2021-12-04","cited_by_count":6,"area":null},{"id":"2106.12074","title":"Reachability Analysis of Convolutional Neural Networks","created":"2021-06-22","cited_by_count":4,"area":null},{"id":"2410.01617","title":"On Using Certified Training towards Empirical Robustness","created":"2024-10-02","cited_by_count":3,"area":null},{"id":"2101.09306","title":"Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification","created":"2021-01-22","cited_by_count":2,"area":null},{"id":"2106.03099","title":"A Primer on Multi-Neuron Relaxation-based Adversarial Robustness Certification","created":"2021-06-06","cited_by_count":2,"area":null},{"id":"2211.14706","title":"Neural Network Verification as Piecewise Linear Optimization: Formulations for the Composition of Staircase Functions","created":"2022-11-27","cited_by_count":2,"area":null},{"id":"2305.16998","title":"A Tale of Two Approximations: Tightening Over-Approximation for DNN Robustness Verification via Under-Approximation","created":"2023-05-26","cited_by_count":2,"area":null},{"id":"2410.06816","title":"Expressiveness of Multi-Neuron Convex Relaxations in Neural Network Certification","created":"2024-10-09","cited_by_count":2,"area":null},{"id":"2505.00963","title":"Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification","created":"2025-05-02","cited_by_count":2,"area":null},{"id":"2208.07464","title":"An Overview and Prospective Outlook on Robust Training and Certification of Machine Learning Models","created":"2022-08-15","cited_by_count":1,"area":null},{"id":"2212.03659","title":"Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks","created":"2022-12-07","cited_by_count":1,"area":null},{"id":"2303.11552","title":"Boosting Verified Training for Robust Image Classifications via Abstraction","created":"2023-03-21","cited_by_count":1,"area":null},{"id":"2304.07980","title":"RNN-Guard: Certified Robustness Against Multi-frame Attacks for Recurrent Neural Networks","created":"2023-04-17","cited_by_count":1,"area":null},{"id":"2308.03330","title":"Expediting Neural Network Verification via Network Reduction","created":"2023-08-07","cited_by_count":1,"area":null},{"id":"2501.15767","title":"Formal Verification of Markov Processes with Learned Parameters","created":"2025-01-27","cited_by_count":1,"area":null},{"id":"2507.23197","title":"Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification","created":"2025-07-31","cited_by_count":1,"area":null},{"id":"2210.00178","title":"On the tightness of linear relaxation based robustness certification methods","created":"2022-10-01","cited_by_count":0,"area":null},{"id":"2211.11186","title":"DualApp: Tight Over-Approximation for Neural Network Robustness Verification via Under-Approximation","created":"2022-11-21","cited_by_count":0,"area":null},{"id":"2308.12192","title":"Robustness Analysis of Continuous-Depth Models with Lagrangian Techniques","created":"2023-08-23","cited_by_count":0,"area":null},{"id":"2406.00699","title":"Towards General Robustness Verification of MaxPool-based Convolutional Neural Networks via Tightening Linear Approximation","created":"2024-06-02","cited_by_count":0,"area":null},{"id":"2410.23362","title":"Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations","created":"2024-10-30","cited_by_count":0,"area":null},{"id":"2507.17453","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","created":"2025-07-23","cited_by_count":0,"area":null},{"id":"2608.13118","title":"Branch and Bound for Relational Verification of Neural Networks","created":"2026-08-13","cited_by_count":0,"area":null}],"next_cursor":null}