{"total":176,"rows":[{"id":"2110.01167","title":"Trustworthy AI: From Principles to Practices","created":"2021-10-04","cited_by_count":207,"area":null},{"id":"2106.07411","title":"Partial success in closing the gap between human and machine vision","created":"2021-06-14","cited_by_count":185,"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":"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":"2110.13771","title":"AugMax: Adversarial Composition of Random Augmentations for Robust Training","created":"2021-10-26","cited_by_count":90,"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":"2303.03169","title":"A Unified Algebraic Perspective on Lipschitz Neural Networks","created":"2023-03-06","cited_by_count":60,"area":null},{"id":"2104.04448","title":"Relating Adversarially Robust Generalization to Flat Minima","created":"2021-04-09","cited_by_count":57,"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":"2312.14820","title":"How Smooth Is Attention?","created":"2023-12-22","cited_by_count":44,"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":"2202.09844","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","created":"2022-02-20","cited_by_count":41,"area":null},{"id":"2202.00628","title":"Regret Minimization with Performative Feedback","created":"2022-02-01","cited_by_count":40,"area":null},{"id":"2107.12045","title":"How to Certify Machine Learning Based Safety-critical Systems? A Systematic Literature Review","created":"2021-07-26","cited_by_count":39,"area":null},{"id":"2209.08025","title":"Trustworthy Reinforcement Learning Against Intrinsic Vulnerabilities: Robustness, Safety, and Generalizability","created":"2022-09-16","cited_by_count":36,"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":"2306.04719","title":"Don't trust your eyes: on the (un)reliability of feature visualizations","created":"2023-06-07","cited_by_count":32,"area":null},{"id":"2303.10653","title":"Randomized Adversarial Training via Taylor Expansion","created":"2023-03-19","cited_by_count":28,"area":null},{"id":"2110.02180","title":"Noisy Feature Mixup","created":"2021-10-05","cited_by_count":27,"area":null},{"id":"2110.05365","title":"Intriguing Properties of Input-dependent Randomized Smoothing","created":"2021-10-11","cited_by_count":24,"area":null},{"id":"2311.11871","title":"Training robust and generalizable quantum models","created":"2023-11-20","cited_by_count":21,"area":null},{"id":"2403.19480","title":"$H$-Consistency Guarantees for Regression","created":"2024-03-28","cited_by_count":21,"area":null},{"id":"2206.07144","title":"Efficiently Training Low-Curvature Neural Networks","created":"2022-06-14","cited_by_count":19,"area":null},{"id":"2209.07263","title":"Robustness in deep learning: The good (width), the bad (depth), and the ugly (initialization)","created":"2022-09-15","cited_by_count":18,"area":null},{"id":"2301.12554","title":"Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing","created":"2023-01-29","cited_by_count":18,"area":null},{"id":"2103.07224","title":"BDD4BNN: A BDD-based Quantitative Analysis Framework for Binarized Neural Networks","created":"2021-03-12","cited_by_count":17,"area":null},{"id":"2109.07557","title":"CounterNet: End-to-End Training of Prediction Aware Counterfactual Explanations","created":"2021-09-15","cited_by_count":17,"area":null},{"id":"2111.03536","title":"A Unified Game-Theoretic Interpretation of Adversarial Robustness","created":"2021-11-05","cited_by_count":17,"area":null},{"id":"2102.03716","title":"SPADE: A Spectral Method for Black-Box Adversarial Robustness Evaluation","created":"2021-02-07","cited_by_count":16,"area":null},{"id":"2102.13625","title":"Learning Prediction Intervals for Regression: Generalization and Calibration","created":"2021-02-26","cited_by_count":16,"area":null},{"id":"2203.01212","title":"A Quantitative Geometric Approach to Neural-Network Smoothness","created":"2022-03-02","cited_by_count":16,"area":null},{"id":"2306.09844","title":"Wasserstein distributional robustness of neural networks","created":"2023-06-16","cited_by_count":16,"area":null},{"id":"2310.18274","title":"LipSim: A Provably Robust Perceptual Similarity Metric","created":"2023-10-27","cited_by_count":15,"area":null},{"id":"2102.07559","title":"Certifiably Robust Variational Autoencoders","created":"2021-02-15","cited_by_count":14,"area":null},{"id":"2105.11363","title":"Learning Security Classifiers with Verified Global Robustness Properties","created":"2021-05-24","cited_by_count":14,"area":null},{"id":"2302.12480","title":"Robust Weight Signatures: Gaining Robustness as Easy as Patching Weights?","created":"2023-02-24","cited_by_count":13,"area":null},{"id":"2306.01485","title":"Robust low-rank training via approximate orthonormal constraints","created":"2023-06-02","cited_by_count":13,"area":null},{"id":"2102.01886","title":"Learning Diverse-Structured Networks for Adversarial Robustness","created":"2021-02-03","cited_by_count":12,"area":null},{"id":"2202.13216","title":"Adversarial robustness of sparse local Lipschitz predictors","created":"2022-02-26","cited_by_count":11,"area":null},{"id":"2402.02629","title":"PROSAC: Provably Safe Certification for Machine Learning Models under Adversarial Attacks","created":"2024-02-04","cited_by_count":11,"area":null},{"id":"2103.09947","title":"Understanding Generalization in Adversarial Training via the Bias-Variance Decomposition","created":"2021-03-17","cited_by_count":10,"area":null},{"id":"2207.02152","title":"UniCR: Universally Approximated Certified Robustness via Randomized Smoothing","created":"2022-07-05","cited_by_count":10,"area":null},{"id":"2101.12100","title":"Increasing the Confidence of Deep Neural Networks by Coverage Analysis","created":"2021-01-28","cited_by_count":9,"area":null},{"id":"2203.07505","title":"Closing the Loop: A Framework for Trustworthy Machine Learning in Power Systems","created":"2022-03-14","cited_by_count":9,"area":null},{"id":"2105.14676","title":"NoiLIn: Improving Adversarial Training and Correcting Stereotype of Noisy Labels","created":"2021-05-31","cited_by_count":8,"area":null},{"id":"2109.06294","title":"On the regularized risk of distributionally robust learning over deep neural networks","created":"2021-09-13","cited_by_count":8,"area":null},{"id":"2302.01961","title":"Asymmetric Certified Robustness via Feature-Convex Neural Networks","created":"2023-02-03","cited_by_count":8,"area":null},{"id":"2303.03900","title":"Nash Equilibria, Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimization","created":"2023-03-07","cited_by_count":8,"area":null},{"id":"2405.01125","title":"Lipschitz constant estimation for general neural network architectures using control tools","created":"2024-05-02","cited_by_count":8,"area":null},{"id":"2510.11709","title":"Adversarial Attacks Leverage Interference Between Features in Superposition","created":"2025-10-13","cited_by_count":8,"area":null},{"id":"2102.09086","title":"Consistent Non-Parametric Methods for Maximizing Robustness","created":"2021-02-18","cited_by_count":7,"area":null},{"id":"2103.13598","title":"Recent Advances in Large Margin Learning","created":"2021-03-25","cited_by_count":7,"area":null},{"id":"2107.02732","title":"Provable Lipschitz Certification for Generative Models","created":"2021-07-06","cited_by_count":7,"area":null},{"id":"2205.03824","title":"A Survey on AI Sustainability: Emerging Trends on Learning Algorithms and Research Challenges","created":"2022-05-08","cited_by_count":7,"area":null},{"id":"2207.04307","title":"Adversarial Framework with Certified Robustness for Time-Series Domain via Statistical Features","created":"2022-07-09","cited_by_count":7,"area":null},{"id":"2210.00973","title":"NCVX: A General-Purpose Optimization Solver for Constrained Machine and Deep Learning","created":"2022-10-03","cited_by_count":7,"area":null},{"id":"2210.14283","title":"Accelerating Certified Robustness Training via Knowledge Transfer","created":"2022-10-25","cited_by_count":7,"area":null},{"id":"2401.14033","title":"Novel Quadratic Constraints for Extending LipSDP beyond Slope-Restricted Activations","created":"2024-01-25","cited_by_count":7,"area":null},{"id":"2501.19040","title":"Towards the Worst-case Robustness of Large Language Models","created":"2025-01-31","cited_by_count":7,"area":null},{"id":"2505.09368","title":"RobustSpring: Benchmarking Robustness to Image Corruptions for Optical Flow, Scene Flow and Stereo","created":"2025-05-14","cited_by_count":7,"area":null},{"id":"2203.10502","title":"Adversarial Parameter Attack on Deep Neural Networks","created":"2022-03-20","cited_by_count":6,"area":null},{"id":"2206.04569","title":"Benefits of Overparameterized Convolutional Residual Networks: Function Approximation under Smoothness Constraint","created":"2022-06-09","cited_by_count":6,"area":null},{"id":"2206.06854","title":"On the explainable properties of 1-Lipschitz Neural Networks: An Optimal Transport Perspective","created":"2022-06-14","cited_by_count":6,"area":null},{"id":"2207.05327","title":"Certified Adversarial Robustness via Anisotropic Randomized Smoothing","created":"2022-07-12","cited_by_count":6,"area":null},{"id":"2208.03835","title":"On Transfer of Adversarial Robustness from Pretraining to Downstream Tasks","created":"2022-08-07","cited_by_count":6,"area":null},{"id":"2210.00635","title":"Robust Empirical Risk Minimization with Tolerance","created":"2022-10-02","cited_by_count":6,"area":null},{"id":"2303.13401","title":"Optimization and Optimizers for Adversarial Robustness","created":"2023-03-23","cited_by_count":6,"area":null},{"id":"2405.20980","title":"Neural Gaussian Scale-Space Fields","created":"2024-05-31","cited_by_count":6,"area":null},{"id":"2505.08022","title":"Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks","created":"2025-05-12","cited_by_count":6,"area":null},{"id":"2102.01208","title":"Fast Training of Provably Robust Neural Networks by SingleProp","created":"2021-02-01","cited_by_count":5,"area":null},{"id":"2102.08868","title":"Bridging the Gap Between Adversarial Robustness and Optimization Bias","created":"2021-02-17","cited_by_count":5,"area":null},{"id":"2205.00210","title":"Software Testing for Machine Learning","created":"2022-04-30","cited_by_count":5,"area":null},{"id":"2206.04762","title":"Data-Efficient Double-Win Lottery Tickets from Robust Pre-training","created":"2022-06-09","cited_by_count":5,"area":null},{"id":"2303.06302","title":"Adversarial Attacks and Defenses in Machine Learning-Powered Networks: A Contemporary Survey","created":"2023-03-11","cited_by_count":5,"area":null},{"id":"2402.03317","title":"SpecFormer: Guarding Vision Transformer Robustness via Maximum Singular Value Penalization","created":"2024-01-02","cited_by_count":5,"area":null},{"id":"2407.06697","title":"Certified Continual Learning for Neural Network Regression","created":"2024-07-09","cited_by_count":5,"area":null},{"id":"2102.07265","title":"Exploring Adversarial Robustness of Deep Metric Learning","created":"2021-02-14","cited_by_count":4,"area":null},{"id":"2102.12192","title":"Multiplicative Reweighting for Robust Neural Network Optimization","created":"2021-02-24","cited_by_count":4,"area":null},{"id":"2109.08191","title":"Simple Post-Training Robustness Using Test Time Augmentations and Random Forest","created":"2021-09-16","cited_by_count":4,"area":null},{"id":"2206.00553","title":"FETA: Fairness Enforced Verifying, Training, and Predicting Algorithms for Neural Networks","created":"2022-06-01","cited_by_count":4,"area":null},{"id":"2209.04293","title":"Robust-by-Design Classification via Unitary-Gradient Neural Networks","created":"2022-09-09","cited_by_count":4,"area":null},{"id":"2308.12820","title":"Prediction without Preclusion: Recourse Verification with Reachable Sets","created":"2023-08-24","cited_by_count":4,"area":null},{"id":"2405.16918","title":"The Uncanny Valley: Exploring Adversarial Robustness from a Flatness Perspective","created":"2024-05-27","cited_by_count":4,"area":null},{"id":"2407.02811","title":"SPLITZ: Certifiable Robustness via Split Lipschitz Randomized Smoothing","created":"2024-07-03","cited_by_count":4,"area":null},{"id":"2504.12991","title":"A Theoretical Framework for OOD Robustness in Transformers using Gevrey Classes","created":"2025-04-17","cited_by_count":4,"area":null},{"id":"2506.13024","title":"Position: Certified Robustness Does Not (Yet) Imply Model Security","created":"2025-06-16","cited_by_count":4,"area":null},{"id":"2101.02689","title":"The Effect of Prior Lipschitz Continuity on the Adversarial Robustness of Bayesian Neural Networks","created":"2021-01-07","cited_by_count":3,"area":null},{"id":"2108.11135","title":"Bridged Adversarial Training","created":"2021-08-25","cited_by_count":3,"area":null},{"id":"2111.05063","title":"Tightening the Approximation Error of Adversarial Risk with Auto Loss Function Search","created":"2021-11-09","cited_by_count":3,"area":null},{"id":"2206.00513","title":"The robust way to stack and bag: the local Lipschitz way","created":"2022-06-01","cited_by_count":3,"area":null},{"id":"2207.07209","title":"Sound Randomized Smoothing in Floating-Point Arithmetics","created":"2022-07-14","cited_by_count":3,"area":null},{"id":"2210.13982","title":"Hindering Adversarial Attacks with Implicit Neural Representations","created":"2022-10-22","cited_by_count":3,"area":null},{"id":"2301.11783","title":"Certified Invertibility in Neural Networks via Mixed-Integer Programming","created":"2023-01-27","cited_by_count":3,"area":null},{"id":"2309.06166","title":"Certified Robust Models with Slack Control and Large Lipschitz Constants","created":"2023-09-12","cited_by_count":3,"area":null},{"id":"2402.07183","title":"A Random Ensemble of Encrypted Vision Transformers for Adversarially Robust Defense","created":"2024-02-11","cited_by_count":3,"area":null},{"id":"2411.01644","title":"Achieving Domain-Independent Certified Robustness via Knowledge Continuity","created":"2024-11-03","cited_by_count":3,"area":null},{"id":"2510.14231","title":"When Flatness Does (Not) Guarantee Adversarial Robustness","created":"2025-10-16","cited_by_count":3,"area":null},{"id":"2602.06105","title":"Robustness Verification of Polynomial Neural Networks","created":"2026-02-05","cited_by_count":3,"area":null}],"next_cursor":"100"}