← Search

Tiehang Duan

7 accepted papers

2024

Training A Secure Model against Data-Free Model Extraction

ECCV 2024poster

"The objective of data-free model extraction (DFME) is to acquire a pre-trained black-box model solely through query access, without any knowledge of the training data used for the victim model. Defending against DFME is challenging because the attack query data distribution and the attacker’s strat…

Cited by 1SourcePDFScholar
2023

Defending against Data-Free Model Extraction by Distributionally Robust Defensive Training

NeurIPS 2023poster

Data-Free Model Extraction (DFME) aims to clone a black-box model without knowing its original training data distribution, making it much easier for attackers to steal commercial models. Defense against DFME faces several challenges: (i) effectiveness; (ii) efficiency; (iii) no prior on the attacker…

Cited by 13SourcePDFScholar
2023

MetaMix: Towards Corruption-Robust Continual Learning With Temporally Self-Adaptive Data Transformation

CVPR 2023poster

Continual Learning (CL) has achieved rapid progress in recent years. However, it is still largely unknown how to determine whether a CL model is trustworthy and how to foster its trustworthiness. This work focuses on evaluating and improving the robustness to corruptions of existing CL models. Our e…

Cited by 15SourcePDFScholar
2022

Improving Task-free Continual Learning by Distributionally Robust Memory Evolution

ICML 2022spotlight

Task-free continual learning (CL) aims to learn a non-stationary data stream without explicit task definitions and not forget previous knowledge. The widely adopted memory replay approach could gradually become less effective for long data streams, as the model may memorize the stored examples and o…

2022

Learning To Learn and Remember Super Long Multi-Domain Task Sequence

CVPR 2022oral

Catastrophic forgetting (CF) frequently occurs when learning with non-stationary data distribution. The CF issue remains nearly unexplored and is more challenging when meta-learning on a sequence of domains (datasets), called sequential domain meta-learning (SDML). In this work, we propose a simple…

Cited by 31PDFcodeScholar
2022

Meta-Learning with Less Forgetting on Large-Scale Non-stationary Task Distributions

ECCV 2022poster

"The paradigm of machine intelligence moves from purely supervised learning to a more practical scenario when many loosely related unlabeled data are available and labeled data is scarce. Most existing algorithms assume that the underlying task distribution is stationary. Here we consider a more rea…

Cited by 21SourcePDFScholar
2021

Meta Learning on a Sequence of Imbalanced Domains With Difficulty Awareness

ICCV 2021poster

Recognizing new objects by learning from a few labeled examples in an evolving environment is crucial to obtain excellent generalization ability for real-world machine learning systems. A typical setting across current meta learning algorithms assumes a stationary task distribution during meta train…

Cited by 25PDFcodeScholar