x-zho14 / ProbMask-official
Implementation of Effective Sparsification of Neural Networks with Global Sparsity Constraint
☆28Updated 2 years ago
Related projects: ⓘ
- [NeurIPS 2020] "Once-for-All Adversarial Training: In-Situ Tradeoff between Robustness and Accuracy for Free" by Haotao Wang*, Tianlong C…☆43Updated 2 years ago
- [CVPR 2021] "The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Models" Tianlong Chen, Jon…☆67Updated last year
- [ICLR 2020] ”Triple Wins: Boosting Accuracy, Robustness and Efficiency Together by Enabling Input-Adaptive Inference“☆24Updated 2 years ago
- Code and checkpoints of compressed networks for the paper titled "HYDRA: Pruning Adversarially Robust Neural Networks" (NeurIPS 2020) (ht…☆88Updated last year
- Pytorch version of NIPS'16 "Learning to learn by gradient descent by gradient descent"☆59Updated last year
- [ICLR 2021] "Long Live the Lottery: The Existence of Winning Tickets in Lifelong Learning" by Tianlong Chen*, Zhenyu Zhang*, Sijia Liu, S…☆22Updated 2 years ago
- Official implementation of paper Gradient Matching for Domain Generalization☆116Updated 2 years ago
- Weight-Averaged Sharpness-Aware Minimization (NeurIPS 2022)☆25Updated last year
- [NeurIPS 2020] "Does Unsupervised Architecture Representation Learning Help Neural Architecture Search?" by Shen Yan, Yu Zheng, Wei Ao, X…☆49Updated 3 years ago
- ☆21Updated 4 years ago
- Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection☆21Updated 3 years ago
- Data-Free Network Quantization With Adversarial Knowledge Distillation PyTorch☆29Updated 3 years ago
- [ICLR 2021 Spotlight Oral] "Undistillable: Making A Nasty Teacher That CANNOT teach students", Haoyu Ma, Tianlong Chen, Ting-Kuei Hu, Che…☆80Updated 2 years ago
- Code for the paper "Understanding Generalization through Visualizations"☆60Updated 3 years ago
- [ICLR 2021] "Robust Overfitting may be mitigated by properly learned smoothening" by Tianlong Chen*, Zhenyu Zhang*, Sijia Liu, Shiyu Chan…☆45Updated 2 years ago
- Code for Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot☆43Updated 3 years ago
- ☆56Updated last year
- Gradient Starvation: A Learning Proclivity in Neural Networks☆59Updated 3 years ago
- "Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustness" (NeurIPS 2020).☆50Updated 3 years ago
- [ICML 2021] "Efficient Lottery Ticket Finding: Less Data is More" by Zhenyu Zhang*, Xuxi Chen*, Tianlong Chen*, Zhangyang Wang☆25Updated 2 years ago
- A Closer Look at Accuracy vs. Robustness☆87Updated 3 years ago
- Source Code for ICML 2019 Paper "Shallow-Deep Networks: Understanding and Mitigating Network Overthinking"☆35Updated 8 months ago
- ☆35Updated 3 years ago
- Code for "Picking Winning Tickets Before Training by Preserving Gradient Flow" https://openreview.net/pdf?id=SkgsACVKPH☆97Updated 4 years ago
- ICLR 2021, Fair Mixup: Fairness via Interpolation☆55Updated 3 years ago
- [ICML2022] Training Your Sparse Neural Network Better with Any Mask. Ajay Jaiswal, Haoyu Ma, Tianlong Chen, ying Ding, and Zhangyang Wang☆23Updated 2 years ago
- Towards Understanding Sharpness-Aware Minimization [ICML 2022]☆34Updated 2 years ago
- Coresets via Bilevel Optimization☆66Updated 3 years ago
- [ICLR 2021] "GANs Can Play Lottery Too" by Xuxi Chen, Zhenyu Zhang, Yongduo Sui, Tianlong Chen☆27Updated 2 years ago
- ☆38Updated last year