mlsanityData to 7 Oct 2026

Combining Machine Learning Defenses without Conflicts

arXiv 2411.09776 ↗First posted 14 Nov 2024cs.CR cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Machine learning (ML) defenses protect against various risks to security, privacy, and fairness. Real-life models need simultaneous protection against multiple different risks which necessitates combining multiple defenses. But combining defenses with conflicting interactions in an ML model can be ineffective, incurring a significant drop in the effectiveness of one or more defenses being combined. Practitioners need a way to determine if a given combination can be effective. Experimentally identifying effective combinations can be time-consuming and expensive, particularly when multiple defenses need to be combined. We need an inexpensive, easy-to-use combination technique to identify effective combinations. Ideally, a combination technique should be (a) accurate (correctly identifies whether a combination is effective or not), (b) scalable (allows combining multiple defenses), (c) non-invasive (requires no change to the defenses being combined), and (d) general (is applicable to different types of defenses). Prior works have identified several ad-hoc techniques but none satisfy all the requirements above. We propose a principled combination technique, DefCon, to identify effective defense combinations. DefCon meets all requirements, achieving 90% accuracy on eight combinations explored in prior work and 81% in 30 previously unexplored combinations that we empirically evaluate in this paper.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 141 of its 189 references that are in the map. First posted on arXiv 14 Nov 2024.

Builds on

141 of 189 references.

References · 141

  1. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  4. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  5. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  6. 2016Deep Learning with Differential Privacycited by 2,682
  7. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  8. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  9. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  10. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
  11. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  12. 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
38 more
  1. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
  2. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
  3. 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,309
  4. 2017SmoothGrad: removing noise by adding noisecited by 1,097
  5. 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
  6. 2017BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chaincited by 1,052
  7. 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
  8. 2018Robustness May Be at Odds with Accuracycited by 873
  9. 2014Certifying and removing disparate impactcited by 715
  10. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  11. 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
  12. 2018A Reductions Approach to Fair Classificationcited by 585
  13. 2018Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networkscited by 550
  14. 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
  15. 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 542
  16. 2020Captum: A unified and generic model interpretability library for PyTorchcited by 542
  17. 2017Countering Adversarial Images using Input Transformationscited by 517
  18. 2022Diffusion Models for Adversarial Purificationcited by 469
  19. 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
  20. 2018Spectral Signatures in Backdoor Attackscited by 457
  21. 2019On Evaluating Adversarial Robustnesscited by 442
  22. 2018Detecting Backdoor Attacks on Deep Neural Networks by Activation Clusteringcited by 429
  23. 2020Backdoor Learning: A Surveycited by 412
  24. 2017On Fairness and Calibrationcited by 406
  25. 2017Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairnesscited by 381
  26. 2021Opacus: User-Friendly Differential Privacy Library in PyTorchcited by 375
  27. 2017Measuring Catastrophic Forgetting in Neural Networkscited by 359
  28. 2016Semi-supervised Knowledge Transfer for Deep Learning from Private Training Datacited by 347
  29. 2018Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooringcited by 334
  30. 2019Differential Privacy Has Disparate Impact on Model Accuracycited by 316
  31. 2021Membership Inference Attacks on Machine Learning: A Surveycited by 306
  32. 2018Knockoff Nets: Stealing Functionality of Black-Box Modelscited by 285
  33. 2017PixelDefend: Leveraging Generative Models to Understand and Defend against Adversarial Examplescited by 243
  34. 2018Differentially Private Generative Adversarial Networkcited by 235
  35. 2020Differentially Private Learning Needs Better Features (or Much More Data)cited by 233
  36. 2021Adversarial Neuron Pruning Purifies Backdoored Deep Modelscited by 230
  37. 2017Embedding Watermarks into Deep Neural Networkscited by 227
  38. 2021Data Augmentation Can Improve Robustnesscited by 193

50 most cited of 141 All 141 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.