{"total":534,"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":"2101.08452","title":"Robust Reinforcement Learning on State Observations with Learned Optimal Adversary","created":"2021-01-21","cited_by_count":135,"area":null},{"id":"2112.08304","title":"On the Convergence and Robustness of Adversarial Training","created":"2021-12-15","cited_by_count":130,"area":null},{"id":"2108.00401","title":"Advances in adversarial attacks and defenses in computer vision: A survey","created":"2021-08-01","cited_by_count":127,"area":null},{"id":"2104.09425","title":"Robust Learning Meets Generative Models: Can Proxy Distributions Improve Adversarial Robustness?","created":"2021-04-19","cited_by_count":113,"area":null},{"id":"2102.08452","title":"Globally-Robust Neural Networks","created":"2021-02-16","cited_by_count":108,"area":null},{"id":"2104.07167","title":"Orthogonalizing Convolutional Layers with the Cayley Transform","created":"2021-04-14","cited_by_count":105,"area":null},{"id":"2102.11436","title":"Model-Based Domain Generalization","created":"2021-02-23","cited_by_count":104,"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":"2102.13620","title":"Towards Robust and Reliable Algorithmic Recourse","created":"2021-02-26","cited_by_count":102,"area":null},{"id":"2107.06641","title":"Trustworthy AI: A Computational Perspective","created":"2021-07-12","cited_by_count":93,"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":"2302.14301","title":"A Comprehensive Study on Robustness of Image Classification Models: Benchmarking and Rethinking","created":"2023-02-28","cited_by_count":85,"area":null},{"id":"2111.01124","title":"When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?","created":"2021-11-01","cited_by_count":77,"area":null},{"id":"2203.05151","title":"Frequency-driven Imperceptible Adversarial Attack on Semantic Similarity","created":"2022-03-10","cited_by_count":77,"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":"2105.11417","title":"Skew Orthogonal Convolutions","created":"2021-05-24","cited_by_count":67,"area":null},{"id":"2108.09135","title":"PatchCleanser: Certifiably Robust Defense against Adversarial Patches for Any Image Classifier","created":"2021-08-20","cited_by_count":65,"area":null},{"id":"2111.01395","title":"Training Certifiably Robust Neural Networks with Efficient Local Lipschitz Bounds","created":"2021-11-02","cited_by_count":65,"area":null},{"id":"2205.01663","title":"Adversarial Training for High-Stakes Reliability","created":"2022-05-03","cited_by_count":60,"area":null},{"id":"2303.03169","title":"A Unified Algebraic Perspective on Lipschitz Neural Networks","created":"2023-03-06","cited_by_count":60,"area":null},{"id":"2102.04716","title":"Better Safe Than Sorry: Preventing Delusive Adversaries with Adversarial Training","created":"2021-02-09","cited_by_count":59,"area":null},{"id":"2204.06974","title":"Planting Undetectable Backdoors in Machine Learning Models","created":"2022-04-14","cited_by_count":59,"area":null},{"id":"2104.04448","title":"Relating Adversarially Robust Generalization to Flat Minima","created":"2021-04-09","cited_by_count":57,"area":null},{"id":"2106.01606","title":"Exploring Memorization in Adversarial Training","created":"2021-06-03","cited_by_count":55,"area":null},{"id":"2210.04871","title":"Certified Training: Small Boxes are All You Need","created":"2022-10-10","cited_by_count":52,"area":null},{"id":"2210.01787","title":"Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspective","created":"2022-10-04","cited_by_count":51,"area":null},{"id":"2301.11526","title":"Direct Parameterization of Lipschitz-Bounded Deep Networks","created":"2023-01-27","cited_by_count":51,"area":null},{"id":"2111.09277","title":"SmoothMix: Training Confidence-calibrated Smoothed Classifiers for Certified Robustness","created":"2021-11-17","cited_by_count":49,"area":null},{"id":"2107.11630","title":"Detecting Adversarial Examples Is (Nearly) As Hard As Classifying Them","created":"2021-07-24","cited_by_count":48,"area":null},{"id":"2106.06946","title":"Boosting Randomized Smoothing with Variance Reduced Classifiers","created":"2021-06-13","cited_by_count":47,"area":null},{"id":"2108.04062","title":"Improved deterministic l2 robustness on CIFAR-10 and CIFAR-100","created":"2021-08-05","cited_by_count":47,"area":null},{"id":"2405.21063","title":"Neural Network Verification with Branch-and-Bound for General Nonlinearities","created":"2024-05-31","cited_by_count":47,"area":null},{"id":"2103.17268","title":"Fast Certified Robust Training with Short Warmup","created":"2021-03-31","cited_by_count":46,"area":null},{"id":"2110.07719","title":"Certified Patch Robustness via Smoothed Vision Transformers","created":"2021-10-11","cited_by_count":45,"area":null},{"id":"2210.07394","title":"Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation","created":"2022-10-13","cited_by_count":45,"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":"2202.02526","title":"LyaNet: A Lyapunov Framework for Training Neural ODEs","created":"2022-02-05","cited_by_count":44,"area":null},{"id":"2203.14046","title":"A Survey of Robust Adversarial Training in Pattern Recognition: Fundamental, Theory, and Methodologies","created":"2022-03-26","cited_by_count":44,"area":null},{"id":"2210.05927","title":"Efficient Adversarial Training without Attacking: Worst-Case-Aware Robust Reinforcement Learning","created":"2022-10-12","cited_by_count":43,"area":null},{"id":"2106.09292","title":"CROP: Certifying Robust Policies for Reinforcement Learning through Functional Smoothing","created":"2021-06-17","cited_by_count":42,"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":"2108.04140","title":"Reachability Analysis of Neural Feedback Loops","created":"2021-08-09","cited_by_count":41,"area":null},{"id":"2111.12229","title":"Subspace Adversarial Training","created":"2021-11-24","cited_by_count":41,"area":null},{"id":"2207.07972","title":"Certified Neural Network Watermarks with Randomized Smoothing","created":"2022-07-16","cited_by_count":41,"area":null},{"id":"2102.05363","title":"Towards Certifying L-infinity Robustness using Neural Networks with L-inf-dist Neurons","created":"2021-02-10","cited_by_count":40,"area":null},{"id":"2106.11420","title":"Policy Smoothing for Provably Robust Reinforcement Learning","created":"2021-06-21","cited_by_count":40,"area":null},{"id":"2107.10873","title":"On the Certified Robustness for Ensemble Models and Beyond","created":"2021-07-22","cited_by_count":40,"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":"2103.10834","title":"Improved, Deterministic Smoothing for L_1 Certified Robustness","created":"2021-03-17","cited_by_count":39,"area":null},{"id":"2110.15767","title":"Adversarial Robustness with Semi-Infinite Constrained Learning","created":"2021-10-29","cited_by_count":39,"area":null},{"id":"2203.14195","title":"How to Robustify Black-Box ML Models? A Zeroth-Order Optimization Perspective","created":"2022-03-27","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":"2106.06196","title":"CausalAdv: Adversarial Robustness through the Lens of Causality","created":"2021-06-11","cited_by_count":37,"area":null},{"id":"2112.06011","title":"Improving the Transferability of Adversarial Examples with Resized-Diverse-Inputs, Diversity-Ensemble and Region Fitting","created":"2021-12-11","cited_by_count":37,"area":null},{"id":"2202.01136","title":"Probabilistically Robust Learning: Balancing Average- and Worst-case Performance","created":"2022-02-02","cited_by_count":37,"area":null},{"id":"2107.10171","title":"Leave-one-out Unfairness","created":"2021-07-21","cited_by_count":36,"area":null},{"id":"2302.03015","title":"Exploring and Exploiting Decision Boundary Dynamics for Adversarial Robustness","created":"2023-02-06","cited_by_count":36,"area":null},{"id":"2107.00228","title":"Scalable Certified Segmentation via Randomized Smoothing","created":"2021-07-01","cited_by_count":35,"area":null},{"id":"2210.06284","title":"Visual Prompting for Adversarial Robustness","created":"2022-10-12","cited_by_count":34,"area":null},{"id":"2104.02466","title":"A Review of Formal Methods applied to Machine Learning","created":"2021-04-06","cited_by_count":33,"area":null},{"id":"2104.01789","title":"Deep Learning-Based Autonomous Driving Systems: A Survey of Attacks and Defenses","created":"2021-04-05","cited_by_count":30,"area":null},{"id":"2102.02956","title":"DetectorGuard: Provably Securing Object Detectors against Localized Patch Hiding Attacks","created":"2021-02-05","cited_by_count":29,"area":null},{"id":"2102.07861","title":"Low Curvature Activations Reduce Overfitting in Adversarial Training","created":"2021-02-15","cited_by_count":29,"area":null},{"id":"2102.10454","title":"On Fast Adversarial Robustness Adaptation in Model-Agnostic Meta-Learning","created":"2021-02-20","cited_by_count":29,"area":null},{"id":"2104.01575","title":"Reliably fast adversarial training via latent adversarial perturbation","created":"2021-04-04","cited_by_count":29,"area":null},{"id":"2302.01404","title":"Provably Bounding Neural Network Preimages","created":"2023-02-02","cited_by_count":29,"area":null},{"id":"2111.00861","title":"A Frequency Perspective of Adversarial Robustness","created":"2021-10-26","cited_by_count":28,"area":null},{"id":"2107.14110","title":"Enhancing Adversarial Robustness via Test-time Transformation Ensembling","created":"2021-07-29","cited_by_count":27,"area":null},{"id":"2202.04347","title":"Gradient Methods Provably Converge to Non-Robust Networks","created":"2022-02-09","cited_by_count":27,"area":null},{"id":"2103.12535","title":"NNrepair: Constraint-based Repair of Neural Network Classifiers","created":"2021-03-23","cited_by_count":26,"area":null},{"id":"2306.10426","title":"Understanding Certified Training with Interval Bound Propagation","created":"2023-06-17","cited_by_count":26,"area":null},{"id":"2106.04823","title":"Taxonomy of Machine Learning Safety: A Survey and Primer","created":"2021-06-09","cited_by_count":25,"area":null},{"id":"2112.01694","title":"On the Existence of the Adversarial Bayes Classifier (Extended Version)","created":"2021-12-03","cited_by_count":25,"area":null},{"id":"2206.02417","title":"Fast Adversarial Training with Adaptive Step Size","created":"2022-06-06","cited_by_count":25,"area":null},{"id":"2102.02145","title":"Adversarially Robust Learning with Unknown Perturbation Sets","created":"2021-02-03","cited_by_count":24,"area":null},{"id":"2102.04154","title":"Efficient Certified Defenses Against Patch Attacks on Image Classifiers","created":"2021-02-08","cited_by_count":24,"area":null},{"id":"2110.05365","title":"Intriguing Properties of Input-dependent Randomized Smoothing","created":"2021-10-11","cited_by_count":24,"area":null},{"id":"2110.06850","title":"Boosting the Certified Robustness of L-infinity Distance Nets","created":"2021-10-13","cited_by_count":24,"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":"2205.12331","title":"Certified Robustness Against Natural Language Attacks by Causal Intervention","created":"2022-05-24","cited_by_count":24,"area":null},{"id":"2105.12841","title":"DNNV: A Framework for Deep Neural Network Verification","created":"2021-05-26","cited_by_count":23,"area":null},{"id":"2206.04310","title":"GSmooth: Certified Robustness against Semantic Transformations via Generalized Randomized Smoothing","created":"2022-06-09","cited_by_count":23,"area":null},{"id":"2211.00525","title":"The Enemy of My Enemy is My Friend: Exploring Inverse Adversaries for Improving Adversarial Training","created":"2022-11-01","cited_by_count":23,"area":null},{"id":"2302.10164","title":"Seasoning Model Soups for Robustness to Adversarial and Natural Distribution Shifts","created":"2023-02-20","cited_by_count":23,"area":null},{"id":"2303.01456","title":"The Double-Edged Sword of Implicit Bias: Generalization vs. Robustness in ReLU Networks","created":"2023-03-02","cited_by_count":23,"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":"2110.01110","title":"Safe Control with Neural Network Dynamic Models","created":"2021-10-03","cited_by_count":22,"area":null},{"id":"2202.01811","title":"ObjectSeeker: Certifiably Robust Object Detection against Patch Hiding Attacks via Patch-agnostic Masking","created":"2022-02-03","cited_by_count":22,"area":null},{"id":"2206.07912","title":"Double Sampling Randomized Smoothing","created":"2022-06-16","cited_by_count":22,"area":null},{"id":"2103.11257","title":"Robust Models Are More Interpretable Because Attributions Look Normal","created":"2021-03-20","cited_by_count":21,"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":"2210.06983","title":"Denoising Masked AutoEncoders Help Robust Classification","created":"2022-10-10","cited_by_count":21,"area":null},{"id":"2310.00116","title":"Certified Robustness via Dynamic Margin Maximization and Improved Lipschitz Regularization","created":"2023-09-29","cited_by_count":21,"area":null},{"id":"2311.11871","title":"Training robust and generalizable quantum models","created":"2023-11-20","cited_by_count":21,"area":null},{"id":"2103.08187","title":"Adversarial Training is Not Ready for Robot Learning","created":"2021-03-15","cited_by_count":20,"area":null},{"id":"2106.03194","title":"Robust Implicit Networks via Non-Euclidean Contractions","created":"2021-06-06","cited_by_count":20,"area":null},{"id":"2206.12714","title":"Defending Multimodal Fusion Models against Single-Source Adversaries","created":"2022-06-25","cited_by_count":20,"area":null},{"id":"2106.06685","title":"Adversarial Robustness via Fisher-Rao Regularization","created":"2021-06-12","cited_by_count":19,"area":null}],"next_cursor":"100"}