{"total":45,"rows":[{"id":"2506.06665","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","created":"2025-06-07","cited_by_count":12,"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":"2412.03154","title":"SoundnessBench: A Soundness Benchmark for Neural Network Verifiers","created":"2024-12-04","cited_by_count":5,"area":null},{"id":"2406.00826","title":"Policy Verification in Stochastic Dynamical Systems Using Logarithmic Neural Certificates","created":"2024-06-02","cited_by_count":4,"area":null},{"id":"2410.20207","title":"Revisiting Differential Verification: Equivalence Verification with Confidence","created":"2024-10-26","cited_by_count":4,"area":null},{"id":"2411.18235","title":"Certified Training with Branch-and-Bound for Lyapunov-stable Neural Control","created":"2024-11-27","cited_by_count":3,"area":null},{"id":"2506.13961","title":"Safe Domains of Attraction for Discrete-Time Nonlinear Systems: Characterization and Verifiable Neural Network Estimation","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2408.10491","title":"Achieving the Tightest Relaxation of Sigmoids for Formal Verification","created":"2024-08-20","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":"2412.02029","title":"Learning Ensembles of Vision-based Safety Control Filters","created":"2024-12-02","cited_by_count":2,"area":null},{"id":"2502.11672","title":"Exact Upper and Lower Bounds for the Output Distribution of Neural Networks with Random Inputs","created":"2025-02-17","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":"2505.22889","title":"Local Stability and Region of Attraction Analysis for Neural Network Feedback Systems under Positivity Constraints","created":"2025-05-28","cited_by_count":2,"area":null},{"id":"2511.06341","title":"Scalable Verification of Neural Control Barrier Functions Using Linear Bound Propagation","created":"2025-11-09","cited_by_count":2,"area":null},{"id":"2605.10974","title":"Vertex-Softmax: Tight Transformer Verification via Exact Softmax Optimization","created":"2026-05-08","cited_by_count":2,"area":null},{"id":"2505.00466","title":"A General Framework for Property-Driven Machine Learning","created":"2025-05-01","cited_by_count":1,"area":null},{"id":"2602.17530","title":"Provably Explaining Neural Additive Models","created":"2026-02-19","cited_by_count":1,"area":null},{"id":"2605.26577","title":"Bridging Control with Neural Network Verifier alpha-beta-CROWN: A Tutorial","created":"2026-05-26","cited_by_count":1,"area":null},{"id":"2607.17290","title":"Lookahead Branching for Neural Network Verification","created":"2026-07-19","cited_by_count":1,"area":null},{"id":"2411.14163","title":"Creating a Formally Verified Neural Network for Autonomous Navigation: An Experience Report","created":"2024-11-21","cited_by_count":0,"area":null},{"id":"2503.00563","title":"A Guide to Failure in Machine Learning: Reliability and Robustness from Foundations to Practice","created":"2025-03-01","cited_by_count":0,"area":null},{"id":"2504.21155","title":"Evaluation and Verification of Physics-Informed Neural Models of the Grad-Shafranov Equation","created":"2025-04-29","cited_by_count":0,"area":null},{"id":"2505.12767","title":"Language Models That Walk the Talk: A Framework for Formal Fairness Certificates","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2507.04523","title":"Verification of Visual Controllers via Compositional Geometric Transformations","created":"2025-07-06","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":"2507.22760","title":"Of Good Demons and Bad Angels: Guaranteeing Safe Control under Finite Precision","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2509.03948","title":"Formal Verification of Local Robustness of a Classification Algorithm for a Spatial Use Case","created":"2025-09-04","cited_by_count":0,"area":null},{"id":"2510.25130","title":"Lipschitz-aware Linearity Grafting for Certified Robustness","created":"2025-10-29","cited_by_count":0,"area":null},{"id":"2512.01782","title":"Dual Randomized Smoothing: Beyond Global Noise Variance","created":"2025-12-01","cited_by_count":0,"area":null},{"id":"2602.03799","title":"Conformal Reachability for Safe Control in Unknown Environments","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2602.06737","title":"Optimized Piecewise Affine Abstractions of Neural Networks with Learnable Activation Functions","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2603.00408","title":"Exact and Asymptotically Complete Robust Verifications of Neural Networks via Ising Solvers","created":"2026-02-28","cited_by_count":0,"area":null},{"id":"2603.03082","title":"Safe and Robust Domains of Attraction for Discrete-Time Systems: A Set-Based Characterization and Certifiable Neural Network Estimation","created":"2026-03-03","cited_by_count":0,"area":null},{"id":"2603.06431","title":"Certified and accurate computation of function space norms of deep neural networks","created":"2026-03-06","cited_by_count":0,"area":null},{"id":"2603.13334","title":"Lipschitz-Based Robustness Certification Under Floating-Point Execution","created":"2026-03-06","cited_by_count":0,"area":null},{"id":"2603.28113","title":"Demystifying Lipschitz verification: positive matrices, negative results","created":"2026-03-30","cited_by_count":0,"area":null},{"id":"2605.14294","title":"Precise Verification of Transformers through ReLU-Catalyzed Abstraction Refinement","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2605.23096","title":"Encrypted Neural Networks without Overflows","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2605.23203","title":"Lipschitz Optimization for Formal Verification of Homographies","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2605.30155","title":"Neural Network Verification using Partial Multi-Neuron Relaxation","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2606.12490","title":"Robustness Verification of Recurrent Neural Networks with Abstraction Refinement","created":"2026-06-10","cited_by_count":0,"area":null},{"id":"2606.20292","title":"Shifting-based Optimizable Linear Relaxations for General Activation Functions","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2607.05253","title":"Repurposing CLIP to Localize at Pixel Level","created":"2026-07-06","cited_by_count":0,"area":null},{"id":"2607.29051","title":"Learning Lookahead Lemmas for Neural Network Verification","created":"2026-07-31","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}