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

Jiyang Zheng

dblp:317/1139 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
0009-0002-9140-8791ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
4 papers
Vision and language · 40% Trustworthy machine learning · 20% Generative modeling · 10%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
cross-modal alignment
0.912025
Aligning What Matters: Masked Latent Adaptation for Text-to-Audio-Video Generation · NeurIPS 2025
Machine learning › Trustworthy machine learning
model ranking
0.912025
Ranked from Within: Ranking Large Multimodal Models Without Labels · ICML 2025
Machine learning › Generative modeling
multimodal generation
0.912025
Aligning What Matters: Masked Latent Adaptation for Text-to-Audio-Video Generation · NeurIPS 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
Ranked from Within: Ranking Large Multimodal Models Without Labels · ICML 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Ranked from Within: Ranking Large Multimodal Models Without Labels · ICML 2025
Computer vision › Vision and language › multimodal in-context learning
visual in-context learning
0.912025
Chain-of-Focus Prompting: Leveraging Sequential Visual Cues to Prompt Large Autoregressive Vision Models · ICLR 2025
Computer vision › Vision and language
visual prompting
0.912025
Chain-of-Focus Prompting: Leveraging Sequential Visual Cues to Prompt Large Autoregressive Vision Models · ICLR 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.812024
Enhancing Contrastive Learning for Ordinal Regression via Ordinal Content Preserved Data Augmentation · ICLR 2024
Machine learning › Deep learning architectures and training
data augmentation
0.812024
Enhancing Contrastive Learning for Ordinal Regression via Ordinal Content Preserved Data Augmentation · ICLR 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
ordinal regression
0.812024
Enhancing Contrastive Learning for Ordinal Regression via Ordinal Content Preserved Data Augmentation · ICLR 2024
Natural language and speech › Language models and text generation › prompting
chain-of-thought prompting
0.312025
Chain-of-Focus Prompting: Leveraging Sequential Visual Cues to Prompt Large Autoregressive Vision Models · ICLR 2025

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

uncertainty-based ranking · 0.9softmax distributions · 0.9saliency-based prompting · 0.9learnable masking · 0.9in-context learning · 0.9diffusion model · 0.9generative data augmentation · 0.8contrastive learning · 0.8
YearPublicationVenuePosition
2025 Chain-of-Focus Prompting: Leveraging Sequential Visual Cues to Prompt Large Autoregressive Vision Models
abstract
In-context learning (ICL) has revolutionized natural language processing by enabling models to adapt to diverse tasks with only a few illustrative examples. However, the exploration of ICL within the field of computer vision remains limited. Inspired by Chain-of-Thought (CoT) prompting in the language domain, we propose Chain-of-Focus (CoF) Prompting, which enhances vision models by enabling step-by-step visual comprehension. CoF Prompting addresses the challenges of absent logical structure in visual data by generating intermediate reasoning steps through visual saliency. Moreover, it provides a solution for creating tailored prompts from visual inputs by selecting contextually informative prompts based on query similarity and target richness. The significance of CoF prompting is demonstrated by the recent introduction of Large Autoregressive Vision Models (LAVMs), which predict downstream targets via in-context learning with pure visual inputs. By integrating intermediate reasoning steps into visual prompts and effectively selecting the informative ones, the LAVMs are capable of generating significantly better inferences. Extensive experiments on downstream visual understanding tasks validate the effectiveness of our proposed method for visual in-context learning.
Jiyang Zheng, Jialiang Shen, Yu Yao 0005, Yang Yang 0002, Dadong Wang, Tongliang Liu
ICLR1
2025 Ranked from Within: Ranking Large Multimodal Models Without Labels
abstract
Can the relative performance of a pre-trained large multimodal model (LMM) be predicted without access to labels? As LMMs proliferate, it becomes increasingly important to develop efficient ways to choose between them when faced with new data or tasks. The usual approach does the equivalent of giving the models an exam and marking them. We opt to avoid marking and the associated labor of determining the ground-truth answers. Instead, we explore other signals elicited and ascertain how well the models know their own limits, evaluating the effectiveness of these signals at unsupervised model ranking. We evaluate 47 state-of-the-art LMMs (e.g., LLaVA) across 9 visual question answering benchmarks, analyzing how well uncertainty-based metrics can predict relative model performance. Our findings show that uncertainty scores derived from softmax distributions provide a robust and consistent basis for ranking models across various tasks. This facilitates the ranking of LMMs on unlabeled data, providing a practical approach for selecting models for diverse target domains without requiring manual annotation.
Weijie Tu, Weijian Deng, Dylan Campbell, Yu Yao 0005, Jiyang Zheng, Tom Gedeon, Tongliang Liu
ICML5
2025 Aligning What Matters: Masked Latent Adaptation for Text-to-Audio-Video Generation
abstract
Text-to-Audio-Video (T2AV) generation aims to produce temporally and semantically aligned visual and auditory content from natural language descriptions. While recent progress in text-to-audio and text-to-video models has improved generation quality within each modality, jointly modeling them remains challenging due to incomplete and asymmetric correspondence: audio often reflects only a subset of the visual scene, and vice versa. Naively enforcing full alignment introduces semantic noise and temporal mismatches. To address this, we propose a novel framework that performs selective cross-modal alignment through a learnable masking mechanism, enabling the model to isolate and align only the shared latent components relevant to both modalities. This mechanism is integrated into an adaptation module that interfaces with pretrained encoders and decoders from latent video and audio diffusion models, preserving their generative capacity with reduced training overhead. Theoretically, we show that our masked objective provably recovers the minimal set of shared latent variables across modalities. Empirically, our method achieves state-of-the-art performance on standard T2AV benchmarks, demonstrating significant improvements in audiovisual synchronization and semantic consistency.
Jiyang Zheng, Siqi Pan, Yu Yao 0005, Zhaoqing Wang, Dadong Wang, Tongliang Liu
NeurIPS1
2024 Enhancing Contrastive Learning for Ordinal Regression via Ordinal Content Preserved Data Augmentation
abstract
Contrastive learning, while highly effective for a lot of tasks, shows limited improvement in ordinal regression. We find that the limitation comes from the predefined strong data augmentations employed in contrastive learning. Intuitively, for ordinal regression datasets, the discriminative information (ordinal content information) contained in instances is subtle. The strong augmentations can easily overshadow or diminish this ordinal content information. As a result, when contrastive learning is used to extract common features between weakly and strongly augmented images, the derived features often lack this essential ordinal content, rendering them less useful in training models for ordinal regression. To improve contrastive learning's utility for ordinal regression, we propose a novel augmentation method to replace the predefined strong argumentation based on the principle of minimal change. Our method is designed in a generative manner that can effectively generate images with different styles but contains desired ordinal content information. Extensive experiments validate the effectiveness of our proposed method, which serves as a plug-and-play solution and consistently improves the performance of existing state-of-the-art methods in ordinal regression tasks.
Jiyang Zheng, Yu Yao 0005, Bo Han 0003, Dadong Wang, Tongliang Liu
ICLR1
2024 GOSS: towards generalized open-set semantic segmentation
abstract
Abstract In this paper, we extend Open-set Semantic Segmentation (OSS) into a new image segmentation task called Generalized Open-set Semantic Segmentation (GOSS). Previously, with well-known OSS, the intelligent agents only detect unknown regions without further processing, limiting their perception capacity of the environment. It stands to reason that further analysis of the detected unknown pixels would be beneficial for agents’ decision-making. Therefore, we propose GOSS, which holistically unifies the abilities of two well-defined segmentation tasks, i.e. OSS and generic segmentation. Specifically, GOSS classifies pixels as belonging to known classes, and clusters (or groups) of pixels of unknown class are labelled as such. We propose a metric that balances the pixel classification and clustering aspects to evaluate this newly expanded task. Moreover, we build benchmark tests on existing datasets and propose neural architectures as baselines. Our experiments on multiple benchmarks demonstrate the effectiveness of our baselines. Code is made available at https://github.com/JHome1/GOSS_Segmentor .
Weihao Li 0005, Junlin Han, Jiyang Zheng, Pengfei Fang, Mehrtash Harandi, Lars Petersson
Vis. Comput.4
2024 Publisher Correction: GOSS: towards generalized open-set semantic segmentation
Weihao Li 0005, Junlin Han, Jiyang Zheng, Pengfei Fang, Mehrtash Harandi, Lars Petersson
Vis. Comput.4