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

Jan Fong

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

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

Artificial intelligence and machine learning · 1 · 1 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
Vision and language · 50% Learning theory · 25% Transfer learning and domain adaptation · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › domain generalization
cross-dataset generalization
0.912025
A Similarity Paradigm Through Textual Regularization Without Forgetting · AAAI 2025
Machine learning › Learning theory
generalization
0.912025
A Similarity Paradigm Through Textual Regularization Without Forgetting · AAAI 2025
Computer vision › Vision and language › vision-language model
prompt learning
0.912025
A Similarity Paradigm Through Textual Regularization Without Forgetting · AAAI 2025
Computer vision › Vision and language
vision-language model
0.912025
A Similarity Paradigm Through Textual Regularization Without Forgetting · AAAI 2025

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

similarity paradigm · 0.9optimal transport · 0.9adversarial alignment · 0.9
YearPublicationVenuePosition
2025 A Similarity Paradigm Through Textual Regularization Without Forgetting
abstract
Prompt learning has emerged as a promising method for adapting pre-trained visual-language models (VLMs) to a range of downstream tasks. While optimizing the context can be effective for improving performance on specific tasks, it can often lead to poor generalization performance on unseen classes or datasets sampled from different distributions. It may be attributed to the fact that textual prompts tend to overfit downstream data distributions, leading to the forgetting of generalized knowledge derived from hand-crafted prompts. In this paper, we propose a novel method called Similarity Paradigm with Textual Regularization (SPTR) for prompt learning without forgetting. SPTR is a two-pronged design based on hand-crafted prompts that is an inseparable framework. 1) To avoid forgetting general textual knowledge, we introduce the optimal transport as a textual regularization to finely ensure approximation with hand-crafted features and tuning textual features. 2) In order to continuously unleash the general ability of multiple hand-crafted prompts, we propose a similarity paradigm for natural alignment score and adversarial alignment score to improve model robustness for generalization. Both modules share a common objective in addressing generalization issues, aiming to maximize the generalization capability derived from multiple hand-crafted prompts. Four representative tasks (i.e., non-generalization few-shot learning, base-to-novel generalization, cross-dataset generalization, domain generalization) across 11 datasets demonstrate that SPTR outperforms existing prompt learning methods.
Fangming Cui, Jan Fong, Rongfei Zeng, Xinmei Tian 0001, Jun Yu 0002
AAAI2