Fetching the paper…
Reading the bibliography…
Inspired by Regularized Lottery Ticket Hypothesis (RLTH), which hypothesizes that there exist smooth (non-binary) subnetworks within a dense network that achieve the competitive performance of the dense network, we propose a few-shot class incremental learning (FSCIL) method referred to as \emph{Soft-SubNetworks (SoftNet)}.
Catastrophic interference in connectionist networks: The sequential learning problem, 1989
Michael McCloskey and Neal J Cohen · 1989
Earlier work this paper cites.
Keeping the neural networks simple by minimizing the description length of the weights
Geoffrey E Hinton and Drew Van Camp · 1993
Earlier work this paper cites.
Simplifying neural nets by discovering flat minima
Sepp Hochreiter and Jürgen Schmidhuber · 1994
Earlier work this paper cites.
A Lifelong Learning Perspective for Mobile Robot Control
Sebastian Thrun · 1995
Earlier work this paper cites.
Neural networks for machine learning, 2012
Geoffrey Hinton · 2012
Earlier work this paper cites.
Estimating or propagating gradients through stochastic neurons for conditional computation
Yoshua Bengio, Nicholas Léonard, and Aaron C. Courville · 2013
Earlier work this paper cites.
An empirical investigation of catastrophic forgetting in gradient-based neural networks
Ian J Goodfellow, Mehdi Mirza, Da Xiao, Aaron Courville, and Yoshua Bengio · 2013
Earlier work this paper cites.
From n to n+ 1: Multiclass transfer incremental learning
Ilja Kuzborskij, Francesco Orabona, and Barbara Caputo · 2013
Earlier work this paper cites.
Distance-based image classification: Generalizing to new classes at near-zero cost
Thomas Mensink, Jakob Verbeek, Florent Perronnin, and Gabriela Csurka · 2013
Earlier work this paper cites.
Deep residual learning for image recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2016
Earlier work this paper cites.
Andrei A Rusu, Neil C Rabinowitz, Guillaume Desjardins, Hubert Soyer, James Kirkpatrick, Koray Kavukcuoglu, Razvan Pascanu, and Raia Hadsell · 2016
Earlier work this paper cites.
Fearnet: Brain-inspired model for incremental learning
Ronald Kemker and Christopher Kanan · 2017
Earlier work this paper cites.
Overcoming catastrophic forgetting in neural networks
James Kirkpatrick, Razvan Pascanu, Neil Rabinowitz, Joel Veness, Guillaume Desjardins, Andrei A Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka Grabska-Barwinska, Demis Hassabis, Claudia Clopath, Dharshan Kumaran, and Raia Hadsell · 2017
Earlier work this paper cites.
Learning without forgetting
Zhizhong Li and Derek Hoiem · 2017
Earlier work this paper cites.
icarl: Incremental classifier and representation learning
Sylvestre-Alvise Rebuffi, Alexander Kolesnikov, Georg Sperl, and Christoph H Lampert · 2017
Earlier work this paper cites.
Continual learning through synaptic intelligence
Friedemann Zenke, Ben Poole, and Surya Ganguli · 2017
Earlier work this paper cites.
Optimization methods for large-scale machine learning
Léon Bottou, Frank E Curtis, and Jorge Nocedal · 2018
Earlier work this paper cites.
End-to-end incremental learning
Francisco M Castro, Manuel J Marín-Jiménez, Nicolás Guil, Cordelia Schmid, and Karteek Alahari · 2018
Earlier work this paper cites.
Riemannian walk for incremental learning: Understanding forgetting and intransigence
Arslan Chaudhry, Puneet K Dokania, Thalaiyasingam Ajanthan, and Philip HS Torr · 2018
Earlier work this paper cites.
Overcoming catastrophic interference using conceptor-aided backpropagation
Xu He and Herbert Jaeger · 2018
Earlier work this paper cites.
Lifelong learning via progressive distillation and retrospection
Saihui Hou, Xinyu Pan, Chen Change Loy, Zilei Wang, and Dahua Lin · 2018
Earlier work this paper cites.
Packnet: Adding multiple tasks to a single network by iterative pruning
Arun Mallya and Svetlana Lazebnik · 2018
Earlier work this paper cites.
Piggyback: Adapting a single network to multiple tasks by learning to mask weights
Arun Mallya, Dillon Davis, and Svetlana Lazebnik · 2018
Earlier work this paper cites.
Alleviating catastrophic forgetting using context-dependent gating and synaptic stabilization
Nicolas Y Masse, Gregory D Grant, and David J Freedman · 2018
Cited alongside, same era.
Overcoming catastrophic forgetting with hard attention to the task
Joan Serra, Didac Suris, Marius Miron, and Alexandros Karatzoglou · 2018
Cited alongside, same era.
Overcoming catastrophic forgetting with hard attention to the task
Joan Serrà, Didac Suris, Marius Miron, and Alexandros Karatzoglou · 2018
Cited alongside, same era.
Reinforced continual learning
Ju Xu and Zhanxing Zhu · 2018
Cited alongside, same era.
Lifelong learning with dynamically expandable networks
Jaehong Yoon, Eunho Yang, Jeongtae Lee, and Sung Ju Hwang · 2018
Cited alongside, same era.
Task-free continual learning
Rahaf Aljundi, Klaas Kelchtermans, and Tinne Tuytelaars · 2019
Cited alongside, same era.
Pyhessian: Neural networks through the lens of the hessian
Zhewei Yao, Amir Gholami, Kurt Keutzer, and Michael W Mahoney · 2020
Later among the works it cites.
Good subnetworks provably exist: Pruning via greedy forward selection
Mao Ye, Chengyue Gong, Lizhen Nie, Denny Zhou, Adam Klivans, and Qiang Liu · 2020
Later among the works it cites.
Scalable and order-robust continual learning with additive parameter decomposition
Jaehong Yoon, Saehoon Kim, Eunho Yang, and Sung Ju Hwang · 2020
Later among the works it cites.
Subspace regularizers for few-shot class incremental learning
Afra Feyza Akyürek, Ekin Akyürek, Derry Wijaya, and Jacob Andreas · 2021
Later among the works it cites.
Long live the lottery: The existence of winning tickets in lifelong learning
Tianlong Chen, Zhenyu Zhang, Sijia Liu, Shiyu Chang, and Zhangyang Wang · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The lottery ticket hypothesis: Finding sparse, trainable neural networks
Jonathan Frankle and Michael Carbin · 2019
Cited alongside, same era.
Task agnostic continual learning via meta learning
Xu He, Jakub Sygnowski, Alexandre Galashov, Andrei A Rusu, Yee Whye Teh, and Razvan Pascanu · 2019
Cited alongside, same era.
Learning a unified classifier incrementally via rebalancing
Saihui Hou, Xinyu Pan, Chen Change Loy, Zilei Wang, and Dahua Lin · 2019
Cited alongside, same era.
Fantastic generalization measures and where to find them
Yiding Jiang, Behnam Neyshabur, Hossein Mobahi, Dilip Krishnan, and Samy Bengio · 2019
Cited alongside, same era.
Decoupling representation and classifier for long-tailed recognition
Bingyi Kang, Saining Xie, Marcus Rohrbach, Zhicheng Yan, Albert Gordo, Jiashi Feng, and Yannis Kalantidis · 2019
Cited alongside, same era.
Learn to grow: A continual structure learning framework for overcoming catastrophic forgetting
Xilai Li, Yingbo Zhou, Tianfu Wu, Richard Socher, and Caiming Xiong · 2019
Cited alongside, same era.
Semantic-aware knowledge distillation for few-shot class-incremental learning
Ali Cheraghian, Shafin Rahman, Pengfei Fang, Soumava Kumar Roy, Lars Petersson, and Mehrtash Harandi · 2021
Later among the works it cites.
A continual learning survey: Defying forgetting in classification tasks
Matthias Delange, Rahaf Aljundi, Marc Masana, Sarah Parisot, Xu Jia, Ales Leonardis, Greg Slabaugh, and Tinne Tuytelaars · 2021
Later among the works it cites.
Gradient-based editing of memory examples for online task-free continual learning
Xisen Jin, Arka Sadhu, Junyi Du, and Xiang Ren · 2021
Later among the works it cites.
Adaptive aggregation networks for class-incremental learning
Yaoyao Liu, Bernt Schiele, and Qianru Sun · 2021
Later among the works it cites.
Pratik Mazumder, Pravendra Singh, and Piyush Rai · 2021
Later among the works it cites.
Overcoming catastrophic forgetting in incremental few-shot learning by finding flat minima
Guangyuan Shi, Jiaxin Chen, Wenlong Zhang, Li-Ming Zhan, and Xiao-Ming Wu · 2021
Later among the works it cites.
Few-shot incremental learning with continually evolved classifiers
Chi Zhang, Nan Song, Guosheng Lin, Yun Zheng, Pan Pan, and Yinghui Xu · 2021
Later among the works it cites.
Self-promoted prototype refinement for few-shot class-incremental learning
Kai Zhu, Yang Cao, Wei Zhai, Jie Cheng, and Zheng-Jun Zha · 2021
Later among the works it cites.
Metafscil: A meta-learning approach for few-shot class incremental learning
Zhixiang Chi, Li Gu, Huan Liu, Yang Wang, Yuanhao Yu, and Jin Tang · 2022
Closest in time.
Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networks
Daiki Chijiwa, Shin’ya Yamaguchi, Atsutoshi Kumagai, and Yasutoshi Ida · 2022
Closest in time.
Constrained few-shot class-incremental learning
Michael Hersche, Geethan Karunaratne, Giovanni Cherubini, Luca Benini, Abu Sebastian, and Abbas Rahimi · 2022
Closest in time.
Forget-free continual learning with winning subnetworks
Haeyong Kang, Rusty John Lloyd Mina, Sultan Rizky Hikmawan Madjid, Jaehong Yoon, Mark Hasegawa-Johnson, Sung Ju Hwang, and Chang D Yoo · 2022
Closest in time.
Few-shot class-incremental learning via entropy-regularized data-free replay
Huan Liu, Li Gu, Zhixiang Chi, Yang Wang, Yuanhao Yu, Jun Chen, and Jin Tang · 2022
Closest in time.
Few-shot class-incremental learning from an open-set perspective
Can Peng, Kun Zhao, Tianren Wang, Meng Li, and Brian C Lovell · 2022
Closest in time.
Continual normalization: Rethinking batch normalization for online continual learning
Quang Pham, Chenghao Liu, and Steven HOI · 2022
Closest in time.
Online coreset selection for rehearsal-based continual learning
Jaehong Yoon, Divyam Madaan, Eunho Yang, and Sung Ju Hwang · 2022
Closest in time.
Few-shot class-incremental learning by sampling multi-phase tasks
Da-Wei Zhou, Han-Jia Ye, Liang Ma, Di Xie, Shiliang Pu, and De-Chuan Zhan · 2022
Closest in time.