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

Zhitong Gao

dblp:298/0841 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 3 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
5 papers
Trustworthy machine learning · 46% Transfer learning and domain adaptation · 36% Language models and text generation · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
1.422024
Generalize or Detect? Towards Robust Semantic Segmentation Under Multiple Distribution Shifts · NeurIPS 2024
ATTA: Anomaly-aware Test-Time Adaptation for Out-of-Distribution Detection in Segmentation · NeurIPS 2023
Natural language and speech › Language models and text generation
in-context learning
0.912025
Large (Vision) Language Models are Unsupervised In-Context Learners · ICLR 2025
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised adaptation
0.912025
Large (Vision) Language Models are Unsupervised In-Context Learners · ICLR 2025
Machine learning › Transfer learning and domain adaptation › fine-tuning
unsupervised fine-tuning
0.912025
Large (Vision) Language Models are Unsupervised In-Context Learners · ICLR 2025
Machine learning › Trustworthy machine learning › out-of-distribution generalization
covariate-shift generalization
0.812024
Generalize or Detect? Towards Robust Semantic Segmentation Under Multiple Distribution Shifts · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation
domain generalization
0.812024
Generalize or Detect? Towards Robust Semantic Segmentation Under Multiple Distribution Shifts · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Generalize or Detect? Towards Robust Semantic Segmentation Under Multiple Distribution Shifts · NeurIPS 2024
Computer vision › Segmentation and scene understanding
semantic segmentation
0.812024
Generalize or Detect? Towards Robust Semantic Segmentation Under Multiple Distribution Shifts · NeurIPS 2024
Machine learning › Trustworthy machine learning › uncertainty estimation
aleatoric uncertainty
0.712023
Modeling Multimodal Aleatoric Uncertainty in Segmentation with Mixture of Stochastic Experts · ICLR 2023
Machine learning › Transfer learning and domain adaptation
domain shift
0.712023
ATTA: Anomaly-aware Test-Time Adaptation for Out-of-Distribution Detection in Segmentation · NeurIPS 2023
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.712023
MILD: Modeling the Instance Learning Dynamics for Learning with Noisy Labels · IJCAI 2023
Machine learning › Transfer learning and domain adaptation
test-time adaptation
0.712023
ATTA: Anomaly-aware Test-Time Adaptation for Out-of-Distribution Detection in Segmentation · NeurIPS 2023
Machine learning › Trustworthy machine learning
uncertainty estimation
0.712023
Modeling Multimodal Aleatoric Uncertainty in Segmentation with Mixture of Stochastic Experts · ICLR 2023
Computer vision › Vision and language › vision-language model
vision-language model adaptation
0.312025
Large (Vision) Language Models are Unsupervised In-Context Learners · ICLR 2025

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

prompt engineering · 0.9uncertainty recalibration · 0.8generative augmentation · 0.8feature alignment · 0.8weibull mixture model · 0.7mixture of stochastic experts · 0.7iterative selection · 0.7global low-level features · 0.7dual-level detection · 0.7dense high-level feature maps · 0.7
YearPublicationVenuePosition
2025 Large (Vision) Language Models are Unsupervised In-Context Learners
abstract
Recent advances in large language and vision-language models have enabled zero-shot inference, allowing models to solve new tasks without task-specific training. Various adaptation techniques such as prompt engineering, In-Context Learning (ICL), and supervised fine-tuning can further enhance the model’s performance on a downstream task, but they require substantial manual effort to construct effective prompts or labeled examples. In this work, we introduce a joint inference framework for fully unsupervised adaptation, eliminating the need for manual prompt engineering and labeled examples. Unlike zero-shot inference, which makes independent predictions, the joint inference makes predictions simultaneously for all inputs in a given task. Since direct joint inference involves computationally expensive optimization, we develop efficient approximation techniques, leading to two unsupervised adaptation methods: unsupervised fine-tuning and unsupervised ICL. We demonstrate the effectiveness of our methods across diverse tasks and models, including language-only Llama-3.1 on natural language processing tasks, reasoning-oriented Qwen2.5-Math on grade school math problems, vision-language OpenFlamingo on vision tasks, and the API-only access GPT-4o model on massive multi-discipline tasks. Our experiments demonstrate substantial improvements over the standard zero-shot approach, including 39% absolute improvement on the challenging GSM8K math reasoning dataset. Remarkably, despite being fully unsupervised, our framework often performs on par with supervised approaches that rely on ground truth labels.
Artyom Gadetsky, Andrei Atanov, Yulun Jiang, Zhitong Gao, Ghazal Hosseini Mighan, Amir Zamir, Maria Brbic
ICLR4
2024 Generalize or Detect? Towards Robust Semantic Segmentation Under Multiple Distribution Shifts
abstract
In open-world scenarios, where both novel classes and domains may exist, an ideal segmentation model should detect anomaly classes for safety and generalize to new domains. However, existing methods often struggle to distinguish between domain-level and semantic-level distribution shifts, leading to poor OOD detection or domain generalization performance. In this work, we aim to equip the model to generalize effectively to covariate-shift regions while precisely identifying semantic-shift regions. To achieve this, we design a novel generative augmentation method to produce coherent images that incorporate both anomaly (or novel) objects and various covariate shifts at both image and object levels. Furthermore, we introduce a training strategy that recalibrates uncertainty specifically for semantic shifts and enhances the feature extractor to align features associated with domain shifts. We validate the effectiveness of our method across benchmarks featuring both semantic and domain shifts. Our method achieves state-of-the-art performance across all benchmarks for both OOD detection and domain generalization. Code is available at https://github.com/gaozhitong/MultiShiftSeg.
Zhitong Gao, Mathieu Salzmann, Xuming He 0001
NeurIPS1
2023 Modeling Multimodal Aleatoric Uncertainty in Segmentation with Mixture of Stochastic Experts
Zhitong Gao, Yucong Chen, Chuyu Zhang, Xuming He 0001
ICLR1
2023 MILD: Modeling the Instance Learning Dynamics for Learning with Noisy Labels
abstract
Despite deep learning has achieved great success, it often relies on a large amount of training data with accurate labels, which are expensive and time-consuming to collect. A prominent direction to reduce the cost is to learn with noisy labels, which are ubiquitous in the real-world applications. A critical challenge for such a learning task is to reduce the effect of network memorization on the falsely-labeled data. In this work, we propose an iterative selection approach based on the Weibull mixture model, which identifies clean data by considering the overall learning dynamics of each data instance. In contrast to the previous small-loss heuristics, we leverage the observation that deep network is easy to memorize and hard to forget clean data. In particular, we measure the difficulty of memorization and forgetting for each instance via the transition times between being misclassified and being memorized in training, and integrate them into a novel metric for selection. Based on the proposed metric, we retain a subset of identified clean data and repeat the selection procedure to iteratively refine the clean subset, which is finally used for model training. To validate our method, we perform extensive experiments on synthetic noisy datasets and real-world web data, and our strategy outperforms existing noisy-label learning methods.
Chuanyang Hu, Shipeng Yan, Zhitong Gao, Xuming He 0001
IJCAI3
2023 ATTA: Anomaly-aware Test-Time Adaptation for Out-of-Distribution Detection in Segmentation
abstract
Recent advancements in dense out-of-distribution (OOD) detection have primarily focused on scenarios where the training and testing datasets share a similar domain, with the assumption that no domain shift exists between them. However, in real-world situations, domain shift often exits and significantly affects the accuracy of existing out-of-distribution (OOD) detection models. In this work, we propose a dual-level OOD detection framework to handle domain shift and semantic shift jointly. The first level distinguishes whether domain shift exists in the image by leveraging global low-level features, while the second level identifies pixels with semantic shift by utilizing dense high-level feature maps. In this way, we can selectively adapt the model to unseen domains as well as enhance model's capacity in detecting novel classes. We validate the efficacy of our proposed method on several OOD segmentation benchmarks, including those with significant domain shifts and those without, observing consistent performance improvements across various baseline models. Code is available at https://github.com/gaozhitong/ATTA.
Zhitong Gao, Shipeng Yan, Xuming He 0001
NeurIPS1
2021 Superpixel-Guided Iterative Learning from Noisy Labels for Medical Image Segmentation
Shuailin Li, Zhitong Gao, Xuming He 0001
MICCAI (1)2