Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yinli Li

dblp:294/8444 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 70% Transfer learning and domain adaptation · 23% Deep learning architectures and training · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › adversarial transfer learning
adversarially robust transfer learning
0.512021
CARTL: Cooperative Adversarially-Robust Transfer Learning · ICML 2021
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.512021
CARTL: Cooperative Adversarially-Robust Transfer Learning · ICML 2021
Machine learning › Trustworthy machine learning
robustness
0.512021
CARTL: Cooperative Adversarially-Robust Transfer Learning · ICML 2021
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
robustness transfer
0.512021
CARTL: Cooperative Adversarially-Robust Transfer Learning · ICML 2021
Machine learning › Deep learning architectures and training › normalization
batch normalization
0.112021
CARTL: Cooperative Adversarially-Robust Transfer Learning · ICML 2021

Methods — techniques the papers use, named apart from their topics

non-expansive fine-tuning · 0.5feature distance minimization · 0.5adversarial training · 0.5
YearPublicationVenuePosition
2021 CARTL: Cooperative Adversarially-Robust Transfer Learning
abstract
Transfer learning eases the burden of training a well-performed model from scratch, especially when training data is scarce and computation power is limited. In deep learning, a typical strategy for transfer learning is to freeze the early layers of a pre-trained model and fine-tune the rest of its layers on the target domain. Previous work focuses on the accuracy of the transferred model but neglects the transfer of adversarial robustness. In this work, we first show that transfer learning improves the accuracy on the target domain but degrades the inherited robustness of the target model. To address such a problem, we propose a novel cooperative adversarially-robust transfer learning (CARTL) by pre-training the model via feature distance minimization and fine-tuning the pre-trained model with non-expansive fine-tuning for target domain tasks. Empirical results show that CARTL improves the inherited robustness by about 28% at most compared with the baseline with the same degree of accuracy. Furthermore, we study the relationship between the batch normalization (BN) layers and the robustness in the context of transfer learning, and we reveal that freezing BN layers can further boost the robustness transfer.
Dian Chen 0004, Hongxin Hu, Qian Wang 0002, Yinli Li, Cong Wang 0001, Chao Shen 0001, Qi Li 0002
ICML4