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

Yan Shen 0002

dblp:23/5178-2 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0001-9550-7004ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

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
Learning paradigms · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › continual learning
class-incremental learning
0.712023
Progressive Voronoi Diagram Subdivision Enables Accurate Data-free Class-Incremental Learning · ICLR 2023
Machine learning › Learning paradigms › continual learning › class-incremental learning
data-free class-incremental learning
0.712023
Progressive Voronoi Diagram Subdivision Enables Accurate Data-free Class-Incremental Learning · ICLR 2023

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

voronoi diagram subdivision · 0.7
YearPublicationVenuePosition
2024 Continual Domain Adversarial Adaptation via Double-Head Discriminators
abstract
Domain adversarial adaptation in a continual setting poses significant challenges due to the limitations of accessing previous source domain data. Despite extensive research in continual learning, adversarial adaptation cannot be effectively accomplished using only a small number of stored source domain data, a standard setting in memory replay approaches. This limitation arises from the erroneous empirical estimation of $\mathcal{H}$-divergence with few source domain samples. To tackle this problem, we propose a double-head discriminator algorithm by introducing an addition source-only domain discriminator trained solely on the source learning phase. We prove that by introducing a pre-trained source-only domain discriminator, the empirical estimation error of $\mathcal{H}$-divergence related adversarial loss is reduced from the source domain side. Further experiments on existing domain adaptation benchmarks show that our proposed algorithm achieves more than 2$%$ improvement on all categories of target domain adaptation tasks while significantly mitigating the forgetting of the source domain.
Yan Shen 0002, Zhanghexuan Ji, Chunwei Ma, Mingchen Gao
AISTATS1
2023 Progressive Voronoi Diagram Subdivision Enables Accurate Data-free Class-Incremental Learning
Chunwei Ma, Zhanghexuan Ji, Ziyun Huang 0001, Yan Shen 0002, Mingchen Gao, Jinhui Xu 0001
ICLR4
2022 Meta-learning without data via Wasserstein distributionally-robust model fusion
abstract
Existing meta-learning works assume that each task has available training and testing data. However, there are many available pre-trained models without accessing their training data in practice. We often need a single model to solve different tasks simultaneously as this is much more convenient to deploy the models. Our work aims to meta-learn a model initialization from these pre-trained models without using corresponding training data. We name this challenging problem setting as Data-Free Learning To Learn (DFL2L). We propose a distributionally robust optimization (DRO) framework to learn a black-box model to fuse and compress all the pre-trained models into a single network to address this problem. To encourage good generalization to the unseen new tasks, the proposed DRO framework diversifies the learned task embedding associated with each pre-trained model to cover the diversity in the underlying training task distributions. A model initialization is sampled from the black-box network during meta-testing as the meta learned initialization. Extensive experiments on offline and online DFL2L settings and several real image datasets demonstrate the effectiveness of the proposed methods.
Zhenyi Wang 0001, Xiaoyang Wang 0001, Li Shen 0008, Qiuling Suo, Kaiqiang Song, Dong Yu 0001, Yan Shen 0002, Mingchen Gao
UAI7
2019 Scribble-Based Hierarchical Weakly Supervised Learning for Brain Tumor Segmentation
Zhanghexuan Ji, Yan Shen 0002, Chunwei Ma, Mingchen Gao
MICCAI (3)2