tginart / deletion-efficient-kmeansLinks
Research prototype of deletion efficient k-means algorithms
☆24Updated 5 years ago
Alternatives and similar repositories for deletion-efficient-kmeans
Users that are interested in deletion-efficient-kmeans are comparing it to the libraries listed below
Sorting:
- ☆19Updated 4 years ago
- ☆25Updated 5 years ago
- ☆16Updated 3 years ago
- Implementation for What it Thinks is Important is Important: Robustness Transfers through Input Gradients (CVPR 2020 Oral)☆16Updated 2 years ago
- This code reproduces the results of the paper, "Measuring Data Leakage in Machine-Learning Models with Fisher Information"☆50Updated 3 years ago
- Code release for the ICML 2019 paper "Are generative classifiers more robust to adversarial attacks?"☆23Updated 6 years ago
- [JMLR] TRADES + random smoothing for certifiable robustness☆14Updated 4 years ago
- Source code of "Hold me tight! Influence of discriminative features on deep network boundaries"☆22Updated 3 years ago
- ☆22Updated 4 years ago
- Code for the paper "Adversarial Training and Robustness for Multiple Perturbations", NeurIPS 2019☆47Updated 2 years ago
- ☆38Updated 4 years ago
- Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulation [NeurIPS 2017]☆18Updated 7 years ago
- Code for the CVPR 2021 paper: Understanding Failures of Deep Networks via Robust Feature Extraction☆36Updated 3 years ago
- Official repository for "Bridging Adversarial Robustness and Gradient Interpretability".☆30Updated 6 years ago
- 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
- Code for the Adversarial Image Detectors and a Saliency Map☆12Updated 8 years ago
- ICLR 2021, Fair Mixup: Fairness via Interpolation☆56Updated 3 years ago
- [ICLR 2022] "Sparsity Winning Twice: Better Robust Generalization from More Efficient Training" by Tianlong Chen*, Zhenyu Zhang*, Pengjun…☆39Updated 3 years ago
- ☆29Updated 6 years ago
- Code for the paper: Learning Adversarially Robust Representations via Worst-Case Mutual Information Maximization (https://arxiv.org/abs/2…☆23Updated 4 years ago
- Code for the paper "Feature Grouping as a Stochastic Regularizer for High-Dimensional Structured Data" at ICML 2019.☆20Updated 6 years ago
- Code for "Imitation Attacks and Defenses for Black-box Machine Translations Systems"☆35Updated 5 years ago
- Randomized Smoothing of All Shapes and Sizes (ICML 2020).☆52Updated 4 years ago
- Learning perturbation sets for robust machine learning☆65Updated 3 years ago
- Fine-grained ImageNet annotations☆29Updated 5 years ago
- Self-Distillation with weighted ground-truth targets; ResNet and Kernel Ridge Regression☆18Updated 3 years ago
- CVPR'19 experiments with (on-manifold) adversarial examples.☆45Updated 5 years ago
- ICML 2020, Estimating Generalization under Distribution Shifts via Domain-Invariant Representations☆23Updated 5 years ago
- SmoothOut: Smoothing Out Sharp Minima to Improve Generalization in Deep Learning☆23Updated 6 years ago
- Repository containing code for getting statistical guarantees on properties of BNNs☆13Updated 6 years ago