{"total":35,"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":"2109.00498","title":"The Second International Verification of Neural Networks Competition (VNN-COMP 2021): Summary and Results","created":"2021-08-31","cited_by_count":71,"area":null},{"id":"2301.05815","title":"First Three Years of the International Verification of Neural Networks Competition (VNN-COMP)","created":"2023-01-14","cited_by_count":58,"area":null},{"id":"2104.06718","title":"Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition","created":"2021-04-14","cited_by_count":44,"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":"2212.10376","title":"The Third International Verification of Neural Networks Competition (VNN-COMP 2022): Summary and Results","created":"2022-12-20","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":"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":"2206.03669","title":"Toward Certified Robustness Against Real-World Distribution Shifts","created":"2022-06-08","cited_by_count":16,"area":null},{"id":"2306.03048","title":"From Robustness to Explainability and Back Again","created":"2023-06-05","cited_by_count":14,"area":null},{"id":"2105.14644","title":"Generating Adversarial Examples with Graph Neural Networks","created":"2021-05-30","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":"2205.14189","title":"Optimizing Objective Functions from Trained ReLU Neural Networks via Sampling","created":"2022-05-27","cited_by_count":11,"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":"2206.07839","title":"Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustness","created":"2022-06-15","cited_by_count":10,"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":"2306.10742","title":"BNN-DP: Robustness Certification of Bayesian Neural Networks via Dynamic Programming","created":"2023-06-19","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":"2107.12855","title":"Neural Network Branch-and-Bound for Neural Network Verification","created":"2021-07-27","cited_by_count":6,"area":null},{"id":"2210.08069","title":"Zonotope Domains for Lagrangian Neural Network Verification","created":"2022-10-14","cited_by_count":5,"area":null},{"id":"2209.07235","title":"Sound and Complete Verification of Polynomial Networks","created":"2022-09-15","cited_by_count":4,"area":null},{"id":"2512.00164","title":"Faster Verified Explanations for Neural Networks","created":"2025-11-28","cited_by_count":4,"area":null},{"id":"2310.07068","title":"Taking the human out of decomposition-based optimization via artificial intelligence: Part I. Learning when to decompose","created":"2023-10-10","cited_by_count":3,"area":null},{"id":"2406.04476","title":"Provable Bounds on the Hessian of Neural Networks: Derivative-Preserving Reachability Analysis","created":"2024-06-06","cited_by_count":3,"area":null},{"id":"2410.01617","title":"On Using Certified Training towards Empirical Robustness","created":"2024-10-02","cited_by_count":3,"area":null},{"id":"2212.07553","title":"Automated Reachability Analysis of Neural Network-Controlled Systems via Adaptive Polytopes","created":"2022-12-14","cited_by_count":2,"area":null},{"id":"2308.03330","title":"Expediting Neural Network Verification via Network Reduction","created":"2023-08-07","cited_by_count":1,"area":null},{"id":"2306.02639","title":"Evaluating robustness of support vector machines with the Lagrangian dual approach","created":"2023-06-05","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":"2407.09550","title":"CAPM: Fast and Robust Verification on Maxpool-based CNN via Dual Network","created":"2024-06-27","cited_by_count":0,"area":null},{"id":"2607.28954","title":"Mining Verdict Boundaries for Neural Network Verification","created":"2026-07-31","cited_by_count":0,"area":null},{"id":"2609.34628","title":"CLAD: Constrained Abstract Domain for Neural Network Verification","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}