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

Huiyu Yi

dblp:385/4570 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0009-8007-2584ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Learning paradigms · 87% Vision and language · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
0.912025
Multiple Queries with Multiple Keys: A Precise Prompt Matching Paradigm for Prompt-based Continual Learning · ACM Multimedia 2025
Machine learning › Learning paradigms › continual learning
prompt-based continual learning
0.912025
Multiple Queries with Multiple Keys: A Precise Prompt Matching Paradigm for Prompt-based Continual Learning · ACM Multimedia 2025
Computer vision › Vision and language › vision-language model
prompt learning
0.312025
Multiple Queries with Multiple Keys: A Precise Prompt Matching Paradigm for Prompt-based Continual Learning · ACM Multimedia 2025

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

prompt matching · 0.9multiple queries multiple keys · 0.9
YearPublicationVenuePosition
2025 Multiple Queries with Multiple Keys: A Precise Prompt Matching Paradigm for Prompt-based Continual Learning
abstract
Continual learning requires machine learning models to continuously acquire new knowledge in dynamic environments while avoiding the forgetting of previous knowledge. Prompt-based continual learning methods effectively address the issue of catastrophic forgetting through prompt expansion and selection. However, existing approaches often suffer from low accuracy in prompt selection, which can result in the model receiving biased knowledge and making biased predictions. To address this issue, we propose the Multiple Queries with Multiple Keys (MQMK) prompt matching paradigm for precise prompt selection. The goal of MQMK is to select the prompts whose training data distribution most closely matches that of the test sample. Specifically, Multiple Queries enable precise breadth search by introducing task-specific knowledge, while Multiple Keys perform deep search by representing the feature distribution of training samples at a fine-grained level. Each query is designed to perform local matching with a designated task to reduce interference across queries. Experiments show that MQMK enhances the prompt matching rate by over 30\% in challenging scenarios and achieves state-of-the-art performance on three widely adopted continual learning benchmarks. The code is available at https://github.com/DunweiTu/MQMK.
Dunwei Tu, Huiyu Yi, Yuchi Wang, Baile Xu, Jian Zhao 0013, Furao Shen
ACM Multimedia2
2025 Embedding Space Allocation with Angle-Norm Joint Classifiers for few-shot class-incremental learning
Dunwei Tu, Huiyu Yi, Tieyi Zhang, Ruotong Li, Furao Shen, Jian Zhao 0013
Neural Networks2
2024 Few-Shot Class-Incremental Learning with Class Centers and Contrastive Learning for Incremental Vehicle Recognition
abstract
The aim of few-shot class-incremental learning (FSCIL) is to continually classify new classes from limited samples without forgetting previously learned classes. Existing deep learning-based methods for fine-grained vehicle recognition are mostly deployed after a single model training session on a complete, large dataset. However, the real-world scenario involves constant emergence of new vehicle categories with limited labeled data. Retraining models at scale for every new vehicle release becomes impractical and this poses a FSCIL challenge. To address this issue, this paper proposes the Contrastive Center Optimization (CCO) method. Based on an Incremental-frozen framework, CCO prevents the forgetting of previous learning during the incremental sessions. In the base training session, CCO uses contrastive learning after data augmentation to indirectly decrease intra-class distances and increase inter-class distances. Additionally, we apply center loss to further directly optimize intra-class and inter-class distances. This approach not only enhances classification accuracy, but also creates sufficient space for the insertion of new classes. Extensive experiments on two fine-grained vehicle datasets demonstrate that our CCO achieves new state-of-the-art performance, confirming the importance of decreasing intra-class distances and increasing inter-class distances.
Huiyu Yi
IJCNN1