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

Junxian Li 0001

dblp:144/3342-1 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0002-0937-9489ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 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
4 papers
Vision and language · 53% Reinforcement learning · 23% Graph learning · 20%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Smart cities and intelligent transportation · 59% Computational science and engineering · 41%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
ChemVLM: Exploring the Power of Multimodal Large Language Models in Chemistry Area · AAAI 2025
Computer vision › Vision and language
multimodal reasoning
0.912025
Critic-V: VLM Critics Help Catch VLM Errors in Multimodal Reasoning · CVPR 2025
Computer vision › Vision and language › multimodal reasoning
vision-language model reasoning
0.912025
Critic-V: VLM Critics Help Catch VLM Errors in Multimodal Reasoning · CVPR 2025
Machine learning › Reinforcement learning
reinforcement learning for control
0.712023
Reinforcement Learning Approaches for Traffic Signal Control under Missing Data · IJCAI 2023
Machine learning › Graph learning › graph neural network › dynamic graph neural network
spatio-temporal graph neural network
0.712023
Uncertainty-aware Traffic Prediction under Missing Data · ICDM 2023
Machine learning › Graph learning › spatio-temporal graph learning
traffic forecasting
0.712023
Uncertainty-aware Traffic Prediction under Missing Data · ICDM 2023
Machine learning › Reinforcement learning › reinforcement learning for control
traffic signal control
0.712023
Reinforcement Learning Approaches for Traffic Signal Control under Missing Data · IJCAI 2023
Smart cities and intelligent transportation
traffic prediction
0.712023
Uncertainty-aware Traffic Prediction under Missing Data · ICDM 2023
Smart cities and intelligent transportation › traffic control
traffic signal control
0.712023
Reinforcement Learning Approaches for Traffic Signal Control under Missing Data · IJCAI 2023
Computational science and engineering
uncertainty quantification
0.712023
Uncertainty-aware Traffic Prediction under Missing Data · ICDM 2023
Natural language and speech › Language models and text generation
preference optimization
0.312025
Critic-V: VLM Critics Help Catch VLM Errors in Multimodal Reasoning · CVPR 2025
Computational science and engineering
chemistry
0.312025
ChemVLM: Exploring the Power of Multimodal Large Language Models in Chemistry Area · AAAI 2025
Internet of things and sensor networks › wireless sensor network
sensor deployment
0.212023
Uncertainty-aware Traffic Prediction under Missing Data · ICDM 2023

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

reinforcement learning · 2.2uncertainty quantification · 2.0probabilistic prediction · 2.0graph neural network · 2.0multimodal pretraining · 1.7state imputation · 1.3reward imputation · 1.3direct preference optimization · 0.9actor-critic · 0.9
YearPublicationVenuePosition
2025 ChemVLM: Exploring the Power of Multimodal Large Language Models in Chemistry Area
abstract
Large Language Models (LLMs) have achieved remarkable success and have been applied across various scientific fields, including chemistry. However, many chemical tasks require the processing of visual information, which cannot be successfully handled by existing chemical LLMs. This brings a growing need for models capable of integrating multimodal information in the chemical domain. In this paper, we introduce ChemVLM, an open-source chemical multimodal large language model specifically designed for chemical applications. ChemVLM is trained on a carefully curated bilingual multimodal dataset that enhances its ability to understand both textual and visual chemical information, including molecular structures, reactions, and chemistry examination questions. We develop three datasets for comprehensive evaluation, tailored to Chemical Optical Character Recognition (OCR), Multimodal Chemical Reasoning (MMCR), and Multimodal Molecule Understanding tasks. We benchmark ChemVLM against a range of open-source and proprietary multimodal large language models on various tasks. Experimental results demonstrate that ChemVLM achieves competitive performance across all evaluated tasks.
Junxian Li 0001, Di Zhang 0026, Xunzhi Wang, Zeying Hao, Jingdi Lei, Cai Zhou, Wei Liu 0123, Yaotian Yang, Xinrui Xiong, Weiyun Wang, Zhe Chen 0013, Wenhai Wang, Wei Li 0076, Mao Su, Shufei Zhang, Wanli Ouyang, Dongzhan Zhou
AAAI1
2025 Critic-V: VLM Critics Help Catch VLM Errors in Multimodal Reasoning
abstract
Vision-language models (VLMs) have shown remarkable advancements in multimodal reasoning tasks. However, they still often generate inaccurate or irrelevant responses due to issues like hallucinated image understandings or unrefined reasoning paths. To address these challenges, we introduce Critic-V, a novel framework inspired by the Actor-Critic paradigm to boost the reasoning capability of VLMs. This framework decouples the reasoning process and critic process by integrating two independent components: the Reasoner, which generates reasoning paths based on visual and textual inputs, and the Critic, which provides constructive critique to refine these paths. In this approach, the Reasoner generates reasoning responses according to text prompts, which can evolve iteratively as a policy based on feedback from the Critic. This interaction process was theoretically driven by a reinforcement learning framework where the Critic offers natural language critiques instead of scalar rewards, enabling more nuanced feedback to boost the Reasoner’s capability on complex reasoning tasks. The Critic model is trained using Direct Preference Optimization (DPO), leveraging a preference dataset of critiques ranked by Rule-based Reward (RBR) to enhance its critic capabilities. Evaluation results show that the Critic-V framework significantly outperforms existing methods, including GPT-4V, on 5 out of 8 benchmarks, especially regarding reasoning accuracy and efficiency. Combining a dynamic text-based policy for the Reasoner and constructive feedback from the preference-optimized Critic enables a more reliable and context-sensitive multimodal reasoning process. Our approach provides a promising solution to enhance the reliability of VLMs, improving their performance in real-world reasoning-heavy multimodal applications such as autonomous driving and embodied intelligence. Our data and code are released at https://github.com/kyrieLei/Critic-V.
Di Zhang 0026, Jingdi Lei, Junxian Li 0001, Xunzhi Wang, Zonglin Yang 0001, Jiatong Li 0003, Weida Wang, Suorong Yang, Peng Ye 0006, Wanli Ouyang, Dongzhan Zhou
CVPR3
2023 Uncertainty-aware Traffic Prediction under Missing Data
abstract
Traffic prediction is a crucial topic because of its broad scope of applications in the transportation domain. Though recent studies have achieved promising results, most of them cannot adequately deal with positions with no historical data, which is common due to limited resources in real life. Apart from this, the lack of uncertainty measurements also makes current models unable to manage risks, especially for the downstream tasks involving decision-making. Inspired by the previous inductive graph neural network, we proposed an uncertainty-aware framework to 1) extend prediction to locations with no historical records and significantly extend spatial coverage of prediction while reducing sensor deployment and 2) generate probabilistic prediction with uncertainty quantification to help the risk management. The experiment results show that our method achieved promising results on prediction tasks, and the uncertainty quantification gives consistent results that highly correlate with the locations with and without historical data. We also show that our model could help support sensor deployment tasks in the transportation field to achieve higher accuracy with a limited sensor deployment budget.
Junxian Li 0001, Zhiming Liang, Guanjie Zheng, Bin Shi 0003, Hua Wei 0001
ICDM2
2023 Reinforcement Learning Approaches for Traffic Signal Control under Missing Data
abstract
The emergence of reinforcement learning (RL) methods in traffic signal control (TSC) tasks has achieved promising results. Most RL approaches require the observation of the environment for the agent to decide which action is optimal for a long-term reward. However, in real-world urban scenarios, missing observation of traffic states may frequently occur due to the lack of sensors, which makes existing RL methods inapplicable on road networks with missing observation. In this work, we aim to control the traffic signals in a real-world setting, where some of the intersections in the road network are not installed with sensors and thus with no direct observations around them. To the best of our knowledge, we are the first to use RL methods to tackle the TSC problem in this real-world setting. Specifically, we propose two solutions: 1) imputes the traffic states to enable adaptive control. 2) imputes both states and rewards to enable adaptive control and the training of RL agents. Through extensive experiments on both synthetic and real-world road network traffic, we reveal that our method outperforms conventional approaches and performs consistently with different missing rates. We also investigate how missing data influences the performance of our model.
Junxian Li 0001, Bin Shi 0003, Hua Wei 0001
IJCAI2