EDBT 2026 Demo / reviewers in the wild / expert
Shen Peng
dblp:09/5772
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0002-0967-893XORCID · verified
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 2021Theory of computation · 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 |
Transfer learning and domain adaptation · 46% Vision and language · 46% Representation and self-supervised learning · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language › vision-language model › vision-language model adaptation
CLIP adaptation |
1.0 | 1 | 2026 | TIM++: Transductive Information Maximization for Few-Shot CLIP · AAAI 2026 |
Machine learning › Transfer learning and domain adaptation
few-shot learning |
1.0 | 1 | 2026 | TIM++: Transductive Information Maximization for Few-Shot CLIP · AAAI 2026 |
Machine learning › Transfer learning and domain adaptation › few-shot learning
transductive few-shot learning |
1.0 | 1 | 2026 | TIM++: Transductive Information Maximization for Few-Shot CLIP · AAAI 2026 |
Computer vision › Vision and language
vision-language model |
1.0 | 1 | 2026 | TIM++: Transductive Information Maximization for Few-Shot CLIP · AAAI 2026 |
Machine learning › Representation and self-supervised learning
mutual information maximization |
0.3 | 1 | 2026 | TIM++: Transductive Information Maximization for Few-Shot CLIP · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
prototype initialization · 1.0information maximization · 1.0KL divergence regularization · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | TIM++: Transductive Information Maximization for Few-Shot CLIPabstractTransductive Information Maximization (TIM) is a leading transductive few-shot learning method that maximizes the mutual information between query features and their predicted labels, while incorporating supervision from the support set. However, its potential remains underexplored, primarily due to the limited utilization of textual knowledge provided by vision-language models (VLMs) such as CLIP. To address this, we propose TIM++, an enhanced framework that incorporates both visual and textual information for few-shot CLIP adaptation. Specifically, TIM++ introduces a Kullback-Leibler (KL) divergence-based regularization term that encourages the model’s posterior predictions to align with CLIP’s zero-shot output distribution, especially focusing on the most confident predictions. Additionally, we develop an improved prototype initialization strategy that leverages both support and query features enriched with CLIP-guided semantics. Extensive experiments on 11 public datasets demonstrate that TIM++ consistently outperforms the standard TIM, achieving average accuracy gains of 19.25% and 10.88% in 1-shot and 2-shot settings, respectively. TIM++ also surpasses other existing state-of-the-art methods, establishing a new benchmark for few-shot learning with VLMs. Yingping Li, Yutong Zou, Yunshi Huang, Changzhe Jiao, Shen Peng, Zhang Guo 0001, Shuiping Gou |
AAAI | 6 |
| 2020 | A sparse chance constrained portfolio selection model with multiple constraints
Zhiping Chen 0001, Shen Peng, Abdel Lisser |
J. Glob. Optim. | 2 |