Demo Data from VLDB 2026 / reviewers in the wild / expert
Yuntong Tian
dblp:237/8531
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0003-4793-6343ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
2 papers |
Transfer learning and domain adaptation · 59% Segmentation and scene understanding · 36% Representation and self-supervised learning · 5% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation › test-time adaptation
continual test-time adaptation |
1.0 | 1 | 2026 | Dual Domain-Attribute Learning Framework With Asynchronous Adapters for Continual Test-Time Adaptation · IEEE Trans. Image Process. 2026 |
Computer vision › Segmentation and scene understanding › semantic segmentation › transfer learning for semantic segmentation
domain adaptive semantic segmentation |
0.8 | 1 | 2024 | Self-Mining the Confident Prototypes for Source-Free Unsupervised Domain Adaptation in Image Segmentation · IEEE Trans. Multim. 2024 |
Computer vision › Segmentation and scene understanding
semantic segmentation |
0.8 | 1 | 2024 | Self-Mining the Confident Prototypes for Source-Free Unsupervised Domain Adaptation in Image Segmentation · IEEE Trans. Multim. 2024 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
source-free domain adaptation |
0.8 | 1 | 2024 | Self-Mining the Confident Prototypes for Source-Free Unsupervised Domain Adaptation in Image Segmentation · IEEE Trans. Multim. 2024 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
0.8 | 1 | 2024 | Self-Mining the Confident Prototypes for Source-Free Unsupervised Domain Adaptation in Image Segmentation · IEEE Trans. Multim. 2024 |
Machine learning › Representation and self-supervised learning
prototype learning |
0.2 | 1 | 2024 | Self-Mining the Confident Prototypes for Source-Free Unsupervised Domain Adaptation in Image Segmentation · IEEE Trans. Multim. 2024 |
Methods — techniques the papers use, named apart from their topics
gradient conflict solver · 1.0attribute memory model · 1.0adapter · 1.0prototype mining · 0.8feature relabelling · 0.8dual-branch collaborative learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Dual Domain-Attribute Learning Framework With Asynchronous Adapters for Continual Test-Time AdaptationabstractContinual test-time domain adaptation (CTTA) aims to adapt a pre-trained source model to a stream of continually evolving unlabeled target domains, facilitating model deployment in dynamic and non-stationary environments. Contemporary works usually encode domain-specific (DS) style information in a domain-agnostic manner, synchronizing with the learning of domain-invariant (DI) semantic information. This scheme forces DS information to be optimized using the weights of the previous domain, corrupted by cross-domain discrepancies, and hence leads to error accumulation and catastrophic forgetting issues. Inspired by the Attribute Memory Model (AMM) in brain neuroscience, we propose a dual domain-attribute learning framework based on independent asynchronous updates, aiming to imitate how brain learns new knowledge without forgetting. Concretely, we explicitly decompose the continual adaptation process into two complementary systems: an event-based learning system (ELS) that captures DS style representations and a knowledge-based learning system (KLS) that concentrates on the DI structural characteristics. The ELS first detects differences in the distribution of data streams, and actively builds an adapter pool for new latent domains. The KLS adopts a cross-domain shared adapter emphasizing general knowledge, and cooperates with the adapter from ELS to jointly guide adaptation. To make DS and DI knowledge collaboratively working, we exploit a gradient conflict solver to ease the conflict between the past and current DI knowledge, realizing a win-win game (i.e., no interference adaptation) across evolving domains. Our framework have been extensively evaluated on four benchmarks and outperformed the state-of-the-art approaches on both segmentation and classification CTTA tasks. Yuntong Tian, Kang Li 0007, Tianyang He, Pheng-Ann Heng, Wei Feng 0005 |
IEEE Trans. Image Process. | 1 |
| 2024 | Self-Mining the Confident Prototypes for Source-Free Unsupervised Domain Adaptation in Image SegmentationabstractThis paper studies a practical Source-free unsupervised domain adaptation (SFUDA) problem, which transfers knowledge of source-trained models to the target domain, without accessing the source data. It has received increasing attention in recent years, while the prior arts focus on designing adaptation strategies, ignoring that different target samples exhibit different transfer abilities on the source model. Additionally, we observe pixel-wise class prediction is typically accompanied by ambiguity issue, i.e., prediction errors often occur between several confusing classes. In this study, we propose a dual-branch collaborative learning framework that aims to achieve reliable knowledge transfer from important samples to the rest by fully mining confident prototypes in the target data. Concretely, we first partition the target data into confident samples and uncertain samples via a new class-ranking reliability score and then utilize the latent features from the confident branch as guidance to promote the learning of the uncertain branch. For ambiguity issue, we propose a feature relabelling module, which exploits reliable prototypes in the mini-batch as well as in the target data to refine labels of uncertain features. We further deploy the proposed framework to commonly used CNN and state-of-the-art Transformer architectures and reveal the potential to promote the generalization ability of backbone models. Experimental results on both natural and medical benchmark datasets verify that our proposed approach exceeds state-of-the-art SFUDA methods with large margins, and achieves comparable performance to existing UDA methods. Yuntong Tian, Huazhu Fu, Lei Zhu 0003, Lequan Yu |
IEEE Trans. Multim. | 1 |