{"total":25,"rows":[{"id":"2203.08392","title":"Patch-Fool: Are Vision Transformers Always Robust Against Adversarial Perturbations?","created":"2022-03-16","cited_by_count":49,"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":"2205.12134","title":"Adversarial Attack on Attackers: Post-Process to Mitigate Black-Box Score-Based Query Attacks","created":"2022-05-24","cited_by_count":19,"area":null},{"id":"2206.00843","title":"DepthShrinker: A New Compression Paradigm Towards Boosting Real-Hardware Efficiency of Compact Neural Networks","created":"2022-06-02","cited_by_count":19,"area":null},{"id":"2306.14306","title":"Adaptive Sharpness-Aware Pruning for Robust Sparse Networks","created":"2023-06-25","cited_by_count":17,"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":"2211.15335","title":"You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets","created":"2022-11-28","cited_by_count":14,"area":null},{"id":"2112.11542","title":"MIA-Former: Efficient and Robust Vision Transformers via Multi-grained Input-Adaptation","created":"2021-12-21","cited_by_count":12,"area":null},{"id":"2207.03677","title":"SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruning","created":"2022-07-08","cited_by_count":12,"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":"2409.01249","title":"Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustness","created":"2024-09-02","cited_by_count":10,"area":null},{"id":"2210.05211","title":"A Win-win Deal: Towards Sparse and Robust Pre-trained Language Models","created":"2022-10-11","cited_by_count":7,"area":null},{"id":"2211.01522","title":"Losses Can Be Blessings: Routing Self-Supervised Speech Representations Towards Efficient Multilingual and Multitask Speech Processing","created":"2022-11-02","cited_by_count":7,"area":null},{"id":"2202.01341","title":"Robust Binary Models by Pruning Randomly-initialized Networks","created":"2022-02-03","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":"2211.07263","title":"Efficient Adversarial Training with Robust Early-Bird Tickets","created":"2022-11-14","cited_by_count":5,"area":null},{"id":"2405.05075","title":"Sparse-PGD: A Unified Framework for Sparse Adversarial Perturbations Generation","created":"2024-05-08","cited_by_count":4,"area":null},{"id":"2304.11834","title":"Robust Tickets Can Transfer Better: Drawing More Transferable Subnetworks in Transfer Learning","created":"2023-04-24","cited_by_count":3,"area":null},{"id":"2202.06488","title":"Finding Dynamics Preserving Adversarial Winning Tickets","created":"2022-02-14","cited_by_count":1,"area":null},{"id":"2210.02618","title":"Dynamic Stochastic Ensemble with Adversarial Robust Lottery Ticket Subnetworks","created":"2022-10-06","cited_by_count":1,"area":null},{"id":"2310.02373","title":"SelectFormer: Private and Practical Data Selection for Transformers","created":"2023-10-03","cited_by_count":1,"area":null},{"id":"2504.04747","title":"Two is Better than One: Efficient Ensemble Defense for Robust and Compact Models","created":"2025-04-07","cited_by_count":1,"area":null},{"id":"2307.03803","title":"A Theoretical Perspective on Subnetwork Contributions to Adversarial Robustness","created":"2023-07-07","cited_by_count":0,"area":null},{"id":"2402.04325","title":"Enhance DNN Adversarial Robustness and Efficiency via Injecting Noise to Non-Essential Neurons","created":"2024-02-06","cited_by_count":0,"area":null},{"id":"2510.18381","title":"S2AP: Score-space Sharpness Minimization for Adversarial Pruning","created":"2025-10-21","cited_by_count":0,"area":null}],"next_cursor":null}