Continual Learning From a Stream of APIs
Not on the map. Why?
Abstract (arXiv)
Continual learning (CL) aims to learn new tasks without forgetting previous tasks. However, existing CL methods require a large amount of raw data, which is often unavailable due to copyright considerations and privacy risks. Instead, stakeholders usually release pre-trained machine learning models as a service (MLaaS), which users can access via APIs. This paper considers two practical-yet-novel CL settings: data-efficient CL (DECL-APIs) and data-free CL (DFCL-APIs), which achieve CL from a stream of APIs with partial or no raw data. Performing CL under these two new settings faces several challenges: unavailable full raw data, unknown model parameters, heterogeneous models of arbitrary architecture and scale, and catastrophic forgetting of previous APIs. To overcome these issues, we propose a novel data-free cooperative continual distillation learning framework that distills knowledge from a stream of APIs into a CL model by generating pseudo data, just by querying APIs. Specifically, our framework includes two cooperative generators and one CL model, forming their training as an adversarial game. We first use the CL model and the current API as fixed discriminators to train generators via a derivative-free method. Generators adversarially generate hard and diverse synthetic data to maximize the response gap between the CL model and the API. Next, we train the CL model by minimizing the gap between the responses of the CL model and the black-box API on synthetic data, to transfer the API's knowledge to the CL model. Furthermore, we propose a new regularization term based on network similarity to prevent catastrophic forgetting of previous APIs.Our method performs comparably to classic CL with full raw data on the MNIST and SVHN in the DFCL-APIs setting. In the DECL-APIs setting, our method achieves 0.97x, 0.75x and 0.69x performance of classic CL on CIFAR10, CIFAR100, and MiniImageNet.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 60 of its 94 references that are in the map. First posted on arXiv 31 Aug 2023.
Builds on
60 of 94 references.
References · 60
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2022Generative Adversarial Networkscited by 5,627
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2014Going Deeper with Convolutionscited by 4,241
- 2016Wide Residual Networkscited by 3,070
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2020Extracting Training Data from Large Language Modelscited by 2,189
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
38 more
- 2020Knowledge Distillation: A Surveycited by 1,603
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
- 2016Practical Black-Box Attacks against Machine Learningcited by 903
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
- 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 712
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
- 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 675
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 666
- 2017Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Modelscited by 462
- 2019Orthogonal Gradient Descent for Continual Learningcited by 369
- 2021Gradient Projection Memory for Continual Learningcited by 348
- 2019On Tiny Episodic Memories in Continual Learningcited by 307
- 2018Knockoff Nets: Stealing Functionality of Black-Box Modelscited by 292
- 2022Black-Box Tuning for Language-Model-as-a-Servicecited by 256
- 2018Learning without Memorizingcited by 250
- 2019Data-Free Learning of Student Networkscited by 204
- 2019Episodic Memory in Lifelong Language Learningcited by 188
- 2018Continual Learning of Context-dependent Processing in Neural Networkscited by 179
- 2020A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learningcited by 162
- 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 161
- 2019Uncertainty-based Continual Learning with Adaptive Regularizationcited by 146
- 2020Data-Free Model Extractioncited by 124
- 2020Continual Deep Learning by Functional Regularisation of Memorable Pastcited by 105
- 2020MAZE: Data-Free Model Stealing Attack Using Zeroth-Order Gradient Estimationcited by 99
- 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
- 2019Data-Free Adversarial Distillationcited by 90
- 2021Continual Learning for Text Classification with Information Disentanglement Based Regularizationcited by 86
- 2022TRGP: Trust Region Gradient Projection for Continual Learningcited by 82
- 2022I Know What You Trained Last Summer: A Survey on Stealing Machine Learning Models and Defencescited by 75
- 2021Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learningcited by 72
- 2023A Comprehensive Survey of Forgetting in Deep Learning Beyond Continual Learningcited by 69
- 2020DaST: Data-free Substitute Training for Adversarial Attackscited by 60
- 2022BBTv2: Towards a Gradient-Free Future with Large Language Modelscited by 53
- 2021Posterior Meta-Replay for Continual Learningcited by 45
50 most cited of 60 All 60 (JSON)
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 1.
6 papers.
- 2025ZeroFlow: Overcoming Catastrophic Forgetting is Easier than You Thinkcited by 9
- 2025Jailbreaking the Non-Transferable Barrier via Test-Time Data Disguisingcited by 8
- 2025Sparse Model Inversion: Efficient Inversion of Vision Transformers for Data-Free Applicationscited by 4
- 2026AI Security in the Foundation Model Era: A Comprehensive Survey from a Unified Perspectivecited by 1
- 2024CaBaGe: Data-Free Model Extraction using ClAss BAlanced Generator Ensemblecited by 0
- 2025I Stolenly Swear That I Am Up to (No) Good: Design and Evaluation of Model Stealing Attackscited by 0
- 2026AI Security in the Foundation Model Era: A Comprehensive Survey from a Unified Perspective25 Mar 2026
- 2025Sparse Model Inversion: Efficient Inversion of Vision Transformers for Data-Free Applications31 Oct 2025
- 2025I Stolenly Swear That I Am Up to (No) Good: Design and Evaluation of Model Stealing Attacks29 Aug 2025
- 2025Jailbreaking the Non-Transferable Barrier via Test-Time Data Disguising21 Mar 2025
- 2025ZeroFlow: Overcoming Catastrophic Forgetting is Easier than You Think2 Jan 2025
- 2024CaBaGe: Data-Free Model Extraction using ClAss BAlanced Generator Ensemble16 Sep 2024