Alternatives and similar repositories for Sparsity-Win-Robust-Generalization:

Users that are interested in Sparsity-Win-Robust-Generalization are comparing it to the libraries listed below

• VITA-Group / triple-wins
  [ICLR 2020] ”Triple Wins: Boosting Accuracy, Robustness and Efficiency Together by Enabling Input-Adaptive Inference“
  ☆24Updated 3 years ago
• inspire-group / hydra
  Code and checkpoints of compressed networks for the paper titled "HYDRA: Pruning Adversarially Robust Neural Networks" (NeurIPS 2020) (ht…
  ☆90Updated 2 years ago
• VITA-Group / PrAC-LTH
  [ICML 2021] "Efficient Lottery Ticket Finding: Less Data is More" by Zhenyu Zhang*, Xuxi Chen*, Tianlong Chen*, Zhangyang Wang
  ☆25Updated 3 years ago
• liuchen11 / AdversaryLossLandscape
  On the Loss Landscape of Adversarial Training: Identifying Challenges and How to Overcome Them [NeurIPS 2020]
  ☆35Updated 3 years ago
• shizhouxing / Fast-Certified-Robust-Training
  [NeurIPS 2021] Fast Certified Robust Training with Short Warmup
  ☆23Updated last year
• fra31 / robust-finetuning
  Code relative to "Adversarial robustness against multiple and single $l_p$-threat models via quick fine-tuning of robust classifiers"
  ☆18Updated 2 years ago
• VITA-Group / Alleviate-Robust-Overfitting
  [ICLR 2021] "Robust Overfitting may be mitigated by properly learned smoothening" by Tianlong Chen*, Zhenyu Zhang*, Sijia Liu, Shiyu Chan…
  ☆46Updated 3 years ago
• BorealisAI / mma_training
  Code for the paper "MMA Training: Direct Input Space Margin Maximization through Adversarial Training"
  ☆34Updated 4 years ago
• MingSun-Tse / Smile-Pruning
  A generic code base for neural network pruning, especially for pruning at initialization.
  ☆30Updated 2 years ago
• tml-epfl / adv-training-corruptions
  On the effectiveness of adversarial training against common corruptions [UAI 2022]
  ☆30Updated 2 years ago
• ShawnXYang / AT_HE
  ☆35Updated 4 years ago
• MadryLab / smoothed-vit
  Certified Patch Robustness via Smoothed Vision Transformers
  ☆42Updated 3 years ago
• Piyush-555 / GaussianDistillation
  Data-free knowledge distillation using Gaussian noise (NeurIPS paper)
  ☆15Updated last year
• Sanghyun-Hong / DeepSloth
  [ICLR 2021: Spotlight] Source code for the paper "A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Infer…
  ☆15Updated 2 years ago
• jh-jeong / smoothmix
  Code for the paper "SmoothMix: Training Confidence-calibrated Smoothed Classifiers for Certified Robustness" (NeurIPS 2021)
  ☆21Updated 2 years ago
• dedeswim / vits-robustness-torch
  Code for the paper "A Light Recipe to Train Robust Vision Transformers" [SaTML 2023]
  ☆52Updated last year
• VITA-Group / Nasty-Teacher
  [ICLR 2021 Spotlight Oral] "Undistillable: Making A Nasty Teacher That CANNOT teach students", Haoyu Ma, Tianlong Chen, Ting-Kuei Hu, Che…
  ☆81Updated 3 years ago
• kyleliang919 / Uncovering-the-Connections-BetweenAdversarial-Transferability-and-Knowledge-Transferability
  code for ICML 2021 paper in which we explore the relationship between adversarial transferability and knowledge transferability.
  ☆17Updated 2 years ago
• JingtongSu / sanity-checking-pruning
  Code for Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot
  ☆42Updated 4 years ago
• VITA-Group / Backdoor-LTH
  [CVPR 2022] "Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free" by Tianlong Chen*, Zhenyu Zhang*, Yihua Zhang*, Shiyu C…
  ☆25Updated 2 years ago
• pdejorge / N-FGSM
  Official repo for the paper "Make Some Noise: Reliable and Efficient Single-Step Adversarial Training" (https://arxiv.org/abs/2202.01181)
  ☆25Updated 2 years ago
• pluskid / structural-regularity
  ☆22Updated last year
• tml-epfl / understanding-sam
  Towards Understanding Sharpness-Aware Minimization [ICML 2022]
  ☆35Updated 2 years ago
• VITA-Group / Lifelong-Learning-LTH
  [ICLR 2021] "Long Live the Lottery: The Existence of Winning Tickets in Lifelong Learning" by Tianlong Chen*, Zhenyu Zhang*, Sijia Liu, S…
  ☆23Updated 3 years ago
• GATECH-EIC / Robust-Scratch-Ticket
  [NeurIPS 2021] "Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networks" by Yon…
  ☆13Updated 2 years ago
• cihangxie / SmoothAdversarialTraining
  Smooth Adversarial Training
  ☆67Updated 4 years ago
• boone891214 / MEST
  [NeurIPS‘2021] "MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge", Geng Yuan, Xiaolong Ma, Yanzhi Wang et al…
  ☆18Updated 2 years ago
• x-zho14 / ProbMask-official
  Implementation of Effective Sparsification of Neural Networks with Global Sparsity Constraint
  ☆28Updated 2 years ago
• VITA-Group / Trap-and-Replace-Backdoor-Defense
  [NeurIPS'22] Trap and Replace: Defending Backdoor Attacks by Trapping Them into an Easy-to-Replace Subnetwork. Haotao Wang, Junyuan Hong,…
  ☆14Updated last year
• VITA-Group / CV_LTH_Pre-training
  [CVPR 2021] "The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Models" Tianlong Chen, Jon…
  ☆68Updated 2 years ago