Fetching the paper…
Reading the bibliography…
Machine learning models may inadvertently memorize sensitive, unauthorized, or malicious data, posing risks of privacy breaches, security vulnerabilities, and performance degradation.
B. Jayaraman and D. Evans, “Evaluating differentially private machine learning in practice,” in 28th USENIX Security Symposium (USENIX Security 19) , 2019, pp. 1895–1912
1912
Earlier work this paper cites.
C. E. Shannon, “A mathematical theory of communication,” The Bell system technical journal , vol. 27, no. 3, pp. 379–423, 1948
1948
Earlier work this paper cites.
F. R. Hampel, “The influence curve and its role in robust estimation,” Journal of the american statistical association , vol. 69, no. 346, pp. 383–393, 1974
1974
Earlier work this paper cites.
R. H. Byrd, J. Nocedal, and R. B. Schnabel, “Representations of quasi-newton matrices and their use in limited memory methods,” Mathematical Programming , vol. 63, no. 1-3, pp. 129–156, 1994
1994
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
C. L. Giles, K. D. Bollacker, and S. Lawrence, “Citeseer: An automatic citation indexing system,” Proceedings of the third ACM conference on Digital libraries , pp. 89–98, 1998
1998
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” arXiv preprint physics/0004057 , 2000
2000
Earlier work this paper cites.
L. I. Kuncheva and C. J. Whitaker, “Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy,” Machine learning , vol. 51, pp. 181–207, 2003
2003
Earlier work this paper cites.
C. Dwork, “Differential privacy,” in Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II 33 . Springer, 2006, pp. 1–12
2006
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” pp. 248–255, 2009
2009
Earlier work this paper cites.
L. Rokach, “Ensemble-based classifiers,” Artificial intelligence review , vol. 33, pp. 1–39, 2010
2010
Earlier work this paper cites.
Y. Netzer, T. Wang, A. Coates, A. Bissacco, B. Wu, and A. Y. Ng, “Reading digits in natural images with unsupervised feature learning,” in NIPS workshop on deep learning and unsupervised feature learning , vol. 2011, no. 2, 2011, p. 5
2011
Earlier work this paper cites.
A. L. Maas, R. E. Daly, P. T. Pham, D. Huang, A. Y. Ng, and C. Potts, “Learning word vectors for sentiment analysis,” in Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies , 2011, pp. 142–150
2011
Earlier work this paper cites.
K. Chaudhuri, C. Monteleoni, and A. D. Sarwate, “Differentially private empirical risk minimization.” Journal of Machine Learning Research , vol. 12, no. 3, 2011
2011
Earlier work this paper cites.
J. Ngiam, A. Khosla, M. Kim, J. Nam, H. Lee, and A. Y. Ng, “Multimodal deep learning,” in Proceedings of the 28th international conference on machine learning (ICML-11) , 2011, pp. 689–696
2011
Earlier work this paper cites.
B. Biggio, B. Nelson, P. Laskov et al. , “Poisoning attacks against support vector machines,” in Proceedings of the 29th International Conference on Machine Learning, ICML 2012 . ArXiv e-prints, 2012, pp. 1807–1814
2012
Earlier work this paper cites.
Z.-H. Zhou, Ensemble methods: foundations and algorithms . CRC press, 2012
2012
Earlier work this paper cites.
O. Hardt, K. Nader, and L. Nadel, “Decay happens: the role of active forgetting in memory,” Trends in cognitive sciences , vol. 17, no. 3, pp. 111–120, 2013
2013
Earlier work this paper cites.
J. Gama, I. Žliobaitė, A. Bifet, M. Pechenizkiy, and A. Bouchachia, “A survey on concept drift adaptation,” ACM computing surveys (CSUR) , vol. 46, no. 4, pp. 1–37, 2014
2014
Earlier work this paper cites.
J. Hirschberg and C. D. Manning, “Advances in natural language processing,” Science , vol. 349, no. 6245, pp. 261–266, 2015
2015
Earlier work this paper cites.
M. I. Jordan and T. M. Mitchell, “Machine learning: Trends, perspectives, and prospects,” Science , vol. 349, no. 6245, pp. 255–260, 2015
2015
Earlier work this paper cites.
Y. Cao and J. Yang, “Towards making systems forget with machine unlearning,” in 2015 IEEE symposium on security and privacy . IEEE, 2015, pp. 463–480
2015
Earlier work this paper cites.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in International conference on machine learning . pmlr, 2015, pp. 448–456
2015
Earlier work this paper cites.
X. Hu, M. Yuan, J. Yao, Y. Deng, L. Chen, Q. Yang, H. Guan, and J. Zeng, “Differential privacy in telco big data platform,” Proceedings of the VLDB Endowment , vol. 8, no. 12, pp. 1692–1703, 2015
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
Z. Izzo, M. A. Smart, K. Chaudhuri, and J. Zou, “Approximate data deletion from machine learning models,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 2008–2016
2016
Earlier work this paper cites.
P. Voigt and A. Von dem Bussche, The EU General Data Protection Regulation (GDPR). A Practical Guide . Springer International Publishing, 2017
2017
Earlier work this paper cites.
J. Steinhardt, P. W. W. Koh, and P. S. Liang, “Certified defenses for data poisoning attacks,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
P. W. Koh and P. Liang, “Understanding black-box predictions via influence functions,” in International conference on machine learning . PMLR, 2017, pp. 1885–1894
2017
Earlier work this paper cites.
B. Mirzasoleiman, A. Karbasi, and A. Krause, “Deletion-robust submodular maximization: Data summarization with ”the right to be forgotten”,” in Proceddings of the 34th International Conference on Machine Learning, ICML 2017 , vol. 5, 2017, pp. 3780–3790
2017
Earlier work this paper cites.
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Artificial intelligence and statistics . PMLR, 2017, pp. 1273–1282
2017
Earlier work this paper cites.
S. M. Lundberg and S.-I. Lee, “A unified approach to interpreting model predictions,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
N. Takahashi, M. Gygli, and L. Van Gool, “Aenet: Learning deep audio features for video analysis,” IEEE Transactions on Multimedia , vol. 20, no. 3, pp. 513–524, 2017
2017
Earlier work this paper cites.
Y. Cao, A. F. Yu, A. Aday, E. Stahl, J. Merwine, and J. Yang, “Efficient repair of polluted machine learning systems via causal unlearning,” in Proceedings of the 2018 on Asia conference on computer and communications security , 2018, pp. 735–747
2018
Earlier work this paper cites.
J. Serra, D. Suris, M. Miron, and A. Karatzoglou, “Overcoming catastrophic forgetting with hard attention to the task,” in International conference on machine learning . PMLR, 2018, pp. 4548–4557
2018
Earlier work this paper cites.
E. F. Villaronga, P. Kieseberg, and T. Li, “Humans forget, machines remember: Artificial intelligence and the right to be forgotten,” Computer Law & Security Review , vol. 34, no. 2, pp. 304–313, 2018
2018
Cited alongside, same era.
G. Wang, C. X. Dang, and Z. Zhou, “Measure contribution of participants in federated learning,” in 2019 IEEE international conference on big data (Big Data) . IEEE, 2019, pp. 2597–2604
2019
Cited alongside, same era.
T. Bertram, E. Bursztein, S. Caro, H. Chao, R. C. Feman, P. Fleischer, A. Gustafsson, J. Hemerly, C. Hibbert, L. Invernizzi, L. K. Donnelly, J. Ketover, J. Laefer, P. Nicholas, Y. Niu, H. Obhi, D. Price, A. Strait, K. Thomas, and A. Verney, “Five years of the right to be forgotten,” in Proceedings of the ACM Conference on Computer and Communications Security , 2019, pp. 959–972
2019
Cited alongside, same era.
A. Gokaslan and V. Cohen, “Openwebtext corpus,” http://Skylion007.github.io/OpenWebTextCorpus , 2019
2019
Cited alongside, same era.
J. Ye, Y. Fu, J. Song, X. Yang, S. Liu, X. Jin, M. Song, and X. Wang, “Learning with recoverable forgetting,” in European Conference on Computer Vision . Springer, 2022, pp. 87–103
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
M. Chen, Z. Zhang, T. Wang, M. Backes, M. Humbert, and Y. Zhang, “Graph Unlearning,” in Proceedings of the ACM Conference on Computer and Communications Security , 2022, pp. 499–513
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. A. Ginart, M. Y. Guan, G. Valiant, and J. Zou, “Making AI forget you: Data deletion in machine learning,” in Advances in Neural Information Processing Systems , vol. 32, no. NeurIPS, 2019, pp. 1–14
2019
Cited alongside, same era.
H. Zhao, J. Jia, and V. Koltun, “Exploring self-attention for image recognition,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2020, pp. 10 076–10 085
2020
Cited alongside, same era.
A. B. Arrieta, N. Díaz-Rodríguez, J. Del Ser, A. Bennetot, S. Tabik, A. Barbado, S. García, S. Gil-López, D. Molina, R. Benjamins et al. , “Explainable artificial intelligence (xai): Concepts, taxonomies, opportunities and challenges toward responsible ai,” Information fusion , vol. 58, pp. 82–115, 2020
2020
Cited alongside, same era.
S. Garg, S. Goldwasser, and P. N. Vasudevan, “Formalizing data deletion in the context of the right to be forgotten,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2020, pp. 373–402
2020
Cited alongside, same era.
Y. Wu, E. Dobriban, and S. Davidson, “Deltagrad: Rapid retraining of machine learning models,” in International Conference on Machine Learning . PMLR, 2020, pp. 10 355–10 366
2020
Cited alongside, same era.
A. Golatkar, A. Achille, and S. Soatto, “Eternal sunshine of the spotless net: Selective forgetting in deep networks,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2020, pp. 9304–9312
2020
Cited alongside, same era.
C. Guo, T. Goldstein, A. Hannun, and L. Van Der Maaten, “Certified data removal from machine learning models,” in International Conference on Machine Learning . PMLR, 2020, pp. 3832–3842
2020
Cited alongside, same era.
J. Brophy and D. Lowd, “Machine Unlearning for Random Forests,” in International Conference on Machine Learning , sep 2020, pp. 1092–1104. [Online]. Available: https://proceedings.mlr.press/v139/brophy21a.html
2020
Cited alongside, same era.
C. Chen, F. Sun, M. Zhang, and B. Ding, “Recommendation Unlearning,” in WWW 2022 - Proceedings of the ACM Web Conference 2022 , 2022, pp. 2768–2777
2022
Later among the works it cites.
Y. Liu, L. Xu, X. Yuan, C. Wang, and B. Li, “The right to be forgotten in federated learning: An efficient realization with rapid retraining,” in IEEE INFOCOM 2022-IEEE Conference on Computer Communications . IEEE, 2022, pp. 1749–1758
2022
Later among the works it cites.
V. Suriyakumar and A. C. Wilson, “Algorithms that approximate data removal: New results and limitations,” Advances in Neural Information Processing Systems , vol. 35, pp. 18 892–18 903, 2022
2022
Later among the works it cites.
R. Mehta, S. Pal, V. Singh, and S. N. Ravi, “Deep unlearning via randomized conditionally independent hessians,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2022, pp. 10 422–10 431
2022
Later among the works it cites.
G. Wu, M. Hashemi, and C. Srinivasa, “Puma: Performance unchanged model augmentation for training data removal,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 36, no. 8, 2022, pp. 8675–8682
2022
Later among the works it cites.
R. Tanno, M. F Pradier, A. Nori, and Y. Li, “Repairing neural networks by leaving the right past behind,” Advances in Neural Information Processing Systems , vol. 35, pp. 13 132–13 145, 2022
2022
Later among the works it cites.
X. Cao, J. Jia, Z. Zhang, and N. Z. Gong, “Fedrecover: Recovering from poisoning attacks in federated learning using historical information,” in 2023 IEEE Symposium on Security and Privacy (SP) . IEEE Computer Society, 2022, pp. 326–343
2022
Later among the works it cites.
Y. Liu, M. Fan, C. Chen, X. Liu, Z. Ma, L. Wang, and J. Ma, “Backdoor defense with machine unlearning,” in IEEE INFOCOM 2022-IEEE Conference on Computer Communications . IEEE, 2022, pp. 280–289
2022
Later among the works it cites.
J. Cheng, G. Dasoulas, H. He, C. Agarwal, and M. Zitnik, “Gnndelete: A general strategy for unlearning in graph neural networks,” in The Eleventh International Conference on Learning Representations , 2022
2022
Later among the works it cites.
E. Chien, C. Pan, and O. Milenkovic, “Efficient model updates for approximate unlearning of graph-structured data,” in The Eleventh International Conference on Learning Representations , 2022
2022
Later among the works it cites.
J. Wang, S. Guo, X. Xie, and H. Qi, “Federated unlearning via class-discriminative pruning,” in Proceedings of the ACM Web Conference 2022 , 2022, pp. 622–632
2022
Later among the works it cites.
X. Lu, S. Welleck, J. Hessel, L. Jiang, L. Qin, P. West, P. Ammanabrolu, and Y. Choi, “Quark: Controllable text generation with reinforced unlearning,” Advances in neural information processing systems , vol. 35, pp. 27 591–27 609, 2022
2022
Later among the works it cites.
Z. Ma, Y. Liu, X. Liu, J. Liu, J. Ma, and K. Ren, “Learn to forget: Machine unlearning via neuron masking,” IEEE Transactions on Dependable and Secure Computing , 2022
2022
Later among the works it cites.
Q. P. Nguyen, R. Oikawa, D. M. Divakaran, M. C. Chan, and B. K. H. Low, “Markov chain monte carlo-based machine unlearning: Unlearning what needs to be forgotten,” in Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security , 2022, pp. 351–363
2022
Later among the works it cites.
R. Zhang, J. Liu, Y. Ding, Z. Wang, Q. Wu, and K. Ren, ““adversarial examples” for proof-of-learning,” in 2022 IEEE Symposium on Security and Privacy (SP) . IEEE, 2022, pp. 1408–1422
2022
Later among the works it cites.
2022
Later among the works it cites.
D. M. Sommer, L. Song, S. Wagh, and P. Mittal, “Athena: Probabilistic verification of machine unlearning,” Proceedings on Privacy Enhancing Technologies , vol. 3, pp. 268–290, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
A. Thudi, G. Deza, V. Chandrasekaran, and N. Papernot, “Unrolling sgd: Understanding factors influencing machine unlearning,” in 2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P) . IEEE, 2022, pp. 303–319
2022
Later among the works it cites.
A. K. Tarun, V. S. Chundawat, M. Mandal, and M. Kankanhalli, “Fast yet effective machine unlearning,” IEEE Transactions on Neural Networks and Learning Systems , 2023
2023
Closest in time.
H. Xu, T. Zhu*, L. Zhang, W. Zhou, and P. S. Yu, “Machine unlearning: A survey,” ACM Computing Surveys , 2023
2023
Closest in time.
S. o. C. D. o. J. Office of the Attorney General, “California consumer privacy act (ccpa),” https://oag.ca.gov/privacy/ccpa , 2023
2023
Closest in time.
V. S. Chundawat, A. K. Tarun, M. Mandal, and M. Kankanhalli, “Zero-shot machine unlearning,” IEEE Transactions on Information Forensics and Security , 2023
2023
Closest in time.
S. Lin, X. Zhang, C. Chen, X. Chen, and W. Susilo, “Erm-ktp: Knowledge-level machine unlearning via knowledge transfer,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2023, pp. 20 147–20 155
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
N. Su and B. Li, “Asynchronous federated unlearning,” in IEEE INFOCOM 2023-IEEE Conference on Computer Communications . IEEE, 2023, pp. 1–10
2023
Closest in time.
A. Warnecke, L. Pirch, C. Wressnegger, and K. Rieck, “Machine unlearning of features and labels,” in 30th Annual Network and Distributed System Security Symposium, NDSS 2023, San Diego, California, USA, February 27 - March 3, 2023 . The Internet Society, 2023. [Online]. Available: https://www.ndss-symposium.org/ndss-paper/machine-unlearning-of-features-and-labels/
2023
Closest in time.
J. Wu, Y. Yang, Y. Qian, Y. Sui, X. Wang, and X. He, “Gif: A general graph unlearning strategy via influence function,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 651–661
2023
Closest in time.
2023
Closest in time.
C. Pan, E. Chien, and O. Milenkovic, “Unlearning graph classifiers with limited data resources,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 716–726
2023
Closest in time.
X. Zhu, G. Li, and W. Hu, “Heterogeneous federated knowledge graph embedding learning and unlearning,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 2444–2454
2023
Closest in time.
M. Chen, W. Gao, G. Liu, K. Peng, and C. Wang, “Boundary unlearning: Rapid forgetting of deep networks via shifting the decision boundary,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2023, pp. 7766–7775
2023
Closest in time.