參考文獻 |
[1] Z. Mai, R. Li, H. Kim, and S. Sanner, “Supervised contrastive replay: revisiting the nearest class mean classifier in online class-incremental continual learning,” arXiv:2103.13885.
[2] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” arXiv:1512.03385.
[3] I. Goodfellow, Y. Bengio, A. Courville, and Y. Bengio, Deep Learning, vol.1, MIT press, Cambridge, UK, 2016.
[4] M. McCloskey and N. J. Cohen, “Catastrophic interference in connectionist networks: the sequential learning problem,” in Psychology of Learning and Motivation, vol. 24, G. H. Bower, Ed., Academic Press, 1989, pp.109-165.
[5] Z. Ke, B. Liu, N. Ma, H. Xu, and L. Shu, “Achieving forgetting prevention and knowledge transfer in continual learning,” arXiv:2112.02706.
[6] M. Mundt, Y. Hong, I. Pliushch, and V. Ramesh, “A wholistic view of continual learning with deep neural networks: forgotten lessons and the bridge to active and open world learning,” arXiv:2009.01797.
[7] M. D. Lange, R. Aljundi, M. Masana, S. Parisot, X. Jia, A. Leonardis, G. Slabaugh, and T. Tuytelaars, “A continual learning survey: defying forgetting in classification tasks,” IEEE Trans. Pattern Anal. Mach. Intell., vol.44, no.7, pp.3366-3385, 2021.
[8] G. I. Parisi, R. Kemker, J. L. Part, C. Kanan, and S. Wermter, “Continual lifelong learning with neural networks: a review,” arXiv:1802.07569v4.
[9] R. Hadsell, D. Rao, A. A. Rusu, and R. Pascanu, “Embracing change: continual learning in deep neural networks,” Trends in Cognitive Sciences, vol.24, no.12, pp.1028-1040, Dec. 2020.
[10] A. Chaudhry, M. Rohrbach, M. Elhoseiny, T. Ajanthan, P. K. Dokania, P. H. S. Torr, and M. Ranzato, “On tiny episodic memories in continual learning,” arXiv:1902.10486.
[11] M. Riemer, I. Cases, R. Ajemian, M. Liu, I. Rish, Y. Tu, and G. Tesauro, “Learning to learn without forgetting by maximizing transfer and minimizing interference,” arXiv:1810.11910.
[12] D. Lopez-Paz and M. Ranzato, “Gradient episodic memory for continual learning,” arXiv:1706.08840.
[13] S.-A. Rebuffi, A. Kolesnikov, G. Sperl, and C. H. Lampert, “iCaRL: incremental classifier and representation learning,” arXiv:1611.07725.
[14] D. Rolnick, A. Ahuja, J. Schwarz, T. P. Lillicrap, and G. Wayne, “Experience replay for continual learning,” arXiv:1811.11682.
[15] G. M. van de Ven, H. T. Siegelmann, and A. S. Tolias, “Brain-inspired replay for continual learning with artificial neural networks,” Nature Communications, vol.11, no.1, pp.1-14, Aug. 2020.
[16] T. Mitchell, W. Cohen, E. Hruschka, P. Talukdar, J. Betteridge, A. Carlson, B. Dalvi, M. Gardner, B. Kisiel, J. Krishnamurthy, N. Lao, K. Mazaitis, T. Mohammad, N. Nakashole, E. Platanios, A. Ritterk, M. Samadi, B. Settles, R. Wang, D. Wijaya, A. Gupta, X. Chen, A. Saparov, M. Greaves, and J. Welling, “Never-ending learning,” Communications of the ACM, vol.61, no.5, pp.103-115, May 2018.
[17] Z. Li and D. Hoiem, “Learning without forgetting,” arXiv:1606.09282.
[18] J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ramalho, A. Grabska-Barwinska, D. Hassabis, C. Clopath, D. Kumaran, and R. Hadsell, “Overcoming catastrophic forgetting in neural networks,” Proc. Natl. Acad. Sci., vol.114, no.13, pp.3521-3526, Mar. 2017.
[19] X. Liu, M. Masana, L. Herranz, J. Van de Weijer, A. M. Lopez, and A. D. Bagdanov, “Rotate your networks: better weight consolidation and less catastrophic forgetting,” arXiv:1802.02950.
[20] J. Serrà, D. Surís, M. Miron, and A. Karatzoglou, “Overcoming catastrophic forgetting with hard attention to the task,” arXiv:1801.01423.
[21] J. Yoon, E. Yang, J. Lee, and S. J. Hwang, “Lifelong learning with dynamically expandable networks,” arXiv:1708.01547.
[22] A. Mallya and S. Lazebnik, “PackNet: adding multiple tasks to a single network by iterative pruning,” arXiv:1711.05769.
[23] Z. Ke, B. Liu, and X. Huang, “Continual learning of a mixed sequence of similar and dissimilar tasks,” arXiv:2112.10017.
[24] C. Fernando, D. Banarse, C. Blundell, Y. Zwols, D. Ha, A. A. Rusu, A. Pritzel, and D. Wierstra, “PathNet: evolution channels gradient descent in super neural networks,” arXiv:1701.08734.
[25] G. Hinton, O. Vinyals, and J. Dean, “Distilling the knowledge in a neural network,” arXiv:1503.02531.
[26] A. Jaiswal, A. R. Babu, M. Z. Zadeh, D. Banerjee, and F. Makedon, “A survey on contrastive self-supervised learning,” arXiv:2011.00362.
[27] P. H. Le-Khac, G. Healy, and A. F. Smeaton, “Contrastive representation learning: a framework and review,” arXiv:2010.05113v2.
[28] Y. Tian, D. Krishnan, and P. Isola, “Contrastive multiview coding,” arXiv:1906.05849.
[29] T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” arXiv:2002.05709.
[30] O. J. Henaff, A. Srinivas, J. D. Fauw, A. Razavi, C. Doersch, S. M. Ali Eslami, and A. Oord, “Data-efficient image recognition with contrastive predictive coding,” arXiv:1905.09272v3.
[31] R. D. Hjelm, A. Fedorov, S. Lavoie-Marchildon, K. Grewal, P. Bachman, A. Trischler, and Y. Bengio, “Learning deep representations by mutual information estimation and maximization,” arXiv:1808.06670.
[32] P. Khosla, P. Teterwak, C. Wang, A. Sarna, Y. Tian, P. Isola, A. Maschinot, C. Liu, and D. Krishnan, “Supervised contrastive learning,” arXiv:2004.11362.
[33] F. Schroff, D. Kalenichenko, and J. Philbin, “FaceNet: a unified embedding for face recognition and clustering,” arXiv:1503.03832v3.
[34] R. Hadsell, S. Chopra, and Y. LeCun, “Dimensionality reduction by learning an invariant mapping,” in Proc. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), New York, NY, Jun.17-22, 2006, pp.1735-1742.
[35] J. Hu, L. Shen, S. Albanie, G. Sun, and E. Wu, “Squeeze-and-excitation networks,” arXiv:1709.01507v4.
[36] S. Woo, J. Park, J.-Y. Lee, and I. Kweon, “CBAM: convolutional block attention module,” arXiv:1807.06521v2.
[37] L. S. Shapley, “A value for n-person games,” in Contributions to The Theory of Games, vol. 2, H. W. Kuhn and A. W. Tucker, Ed., Princeton University Press, 1953, pp.307-318.
[38] R. Jia, D. Dao, B. Wang, F. A. Hubis, N. M. Gurel, B. Li, C. Zhang, C. J. Spanos, and D. Song, “Efficient task-specific data valuation for nearest neighbor algorithms,” arXiv:1908.08619.
[39] D. Shim, Z. Mai, J. Jeong, S. Sanner, H. Kim, and J. Jang, “Online class-incremental continual learning with adversarial Shapley value,” arXiv:2009.00093.
[40] Z. Zhang and M. R. Sabuncu, “Generalized cross entropy loss for training deep neural networks with noisy labels,” in Proc. of Neural Information Processing Systems (NIPS), Palais des Congrès de Montréal, Montréal, Canada, Dec.2-8, 2018, pp.8778-8788. |