[19] P. W. Koh and P. Liang, “Understanding black-box predictions via influence functions,” in International conference on machine learning. PMLR, 2017, pp. 1885–1894. 2, 3, 5
[20] A. Schioppa, P. Zablotskaia, D. Vilar, and A. Sokolov, "Scaling up influence functions," in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, 2022, pp. 8179-8186. 5
[21] H. Guo, N. F. Rajani, P. Hase, M. Bansal, and C. Xiong, "Fastif: Scalable influence functions for efficient model interpretation and debugging," arXiv preprint arXiv:2012.15781, 2020.
[22] S. Yang, Z. Xie, H. Peng, M. Xu, M. Sun, and P. Li, "Dataset pruning: Reducing training data by examining generalization influence," arXiv preprint arXiv:2205.09329, 2022. 2, 3
[23] S. Kong, Y. Shen, and L. Huang, “Resolving training biases via influence-based data relabeling,” in International Conference on Learning Representations, 2022. [Online]. Available: https://openreview.net/forum?id=EskfH0bwNVn 1, 2, 3, 5
[24] G. Pleiss, T. Zhang, E. Elenberg, and K. Q. Weinberger, "Identifying mislabeled data using the area under the margin ranking," Advances in Neural Information Processing Systems, vol. 33, pp. 17044-17056, 2020. 1, 2, 3
[25] M. Welling, “Herding dynamical weights to learn,” in Proceedings of the 26th Annual International Conference on Machine Learning, 2009, pp. 1121–1128. 2, 3
[26] M. Paul, S. Ganguli, and G. K. Dziugaite, “Deep learning on a data diet: Finding important examples early in training,” Advances in Neural Information Processing Systems, vol. 34, pp. 20596-20607, 2021. 2, 3, 5, 7
[27] G. Pruthi, F. Liu, S. Kale, and M. Sundararajan, "Estimating training data influence by tracing gradient descent," Advances in Neural Information Processing Systems, vol. 33, pp. 19-20-19930, 2020. 3
[28] S.-A. Rebuffi, A. Kolesnikov, G. Sperl, and C. H. Lampert, "icarl: Incremental classifier and representation learning," in Proceedings of the IEEE conference on Computer Vision and Pattern Recognition, 2017, pp. 2001-2010. 1, 2, 3
[29] D. Feldman and M. Langberg, “A unified framework for approximating and clustering data,” in Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011, pp. 569–578. 1, 3
[30] J. Ju, H. Jung, Y. Oh, and J. Kim, “Extending contrastive learning to unsupervised coreset selection,” IEEE Access, vol. 10, pp. 7704–7715, 2022.
[31] J. Huggins, T. Campbell, and T. Broderick, "Coresets for scalable bayesian logistic regression," Advances in Neural Information Processing Systems, vol. 29, 2016.
[32] T. Campbell and T. Broderick, "Automated scalable bayesian inference via hilbert coresets," The Journal of Machine Learning Research, vol. 20, no. 1, pp. 551-588, 2019.
[33] C. V. Nguyen, Y. Li, T. D. Bui, and R. E. Turner, "Variational continual learning," arXiv preprint arXiv:1710.10628, 2017.
[34] S. Farquhar and Y. Gal, “Towards robust evaluations of continual learning,” arXiv preprint arXiv:1805.09733, 2018.
[35] S. Kim, S. Bae, and S.-Y. Yun, "Coreset sampling from open-set for fine-grained self-supervised learning," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023, pp. 7537-7547. 3
[36] Y. Yang, H. Kang, and B. Mirzasoleiman, "Towards sustainable learning: Coresets for data-efficient deep learning," arXiv preprint arXiv:2306.01244, 2023. 1, 3
[37] S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Transactions on knowledge and data engineering, vol. 22, no. 10, pp. 1345–1359, 2010. 2, 4