Xuanle Zhao

dblp:357/5625 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 4 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 · 42% Reinforcement learning · 21% Efficient and distributed learning · 14%
Software engineering, system software, and programming languages
2 papers
Program synthesis and code generation · 64% Empirical software engineering · 36%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › document understanding
scientific document understanding
1.012026
AutoReproduce: Automatic AI Experiment Reproduction with Paper Lineage · ACL (1) 2026
Machine learning › Efficient and distributed learning › model compression › token compression
visual token reduction
1.012026
TinyChemVL: Advancing Chemical Vision-Language Models via Efficient Visual Token Reduction and Complex Reaction Tasks · AAAI 2026
Empirical software engineering
reproducibility
1.012026
AutoReproduce: Automatic AI Experiment Reproduction with Paper Lineage · ACL (1) 2026
Computer vision › Vision and language › vision-language model › multimodal large language model › chart understanding
chart-to-code generation
0.912025
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation · ACL (1) 2025
Computer vision › Vision and language › vision-language model › multimodal large language model
chart understanding
0.912025
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation · ACL (1) 2025
Program synthesis and code generation
code generation with language models
0.912025
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation · ACL (1) 2025
Program synthesis and code generation › code generation with language models
multimodal code generation
0.912025
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation · ACL (1) 2025
Machine learning › Reinforcement learning
model-free reinforcement learning
0.712023
ODE-based Recurrent Model-free Reinforcement Learning for POMDPs · NeurIPS 2023
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations
0.712023
ODE-based Recurrent Model-free Reinforcement Learning for POMDPs · NeurIPS 2023
Machine learning › Reinforcement learning
partially observable reinforcement learning
0.712023
ODE-based Recurrent Model-free Reinforcement Learning for POMDPs · NeurIPS 2023
Bioinformatics and computational biology › molecular informatics › cheminformatics
chemical reaction prediction
0.312026
TinyChemVL: Advancing Chemical Vision-Language Models via Efficient Visual Token Reduction and Complex Reaction Tasks · AAAI 2026
Computer vision › Vision and language › vision-language model
multimodal large language model
0.312025
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation · ACL (1) 2025

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

vision-language model · 2.0paper lineage analysis · 2.0snippet-of-thought · 1.7instruction tuning · 1.7code language models · 0.9code language model · 0.9recurrent policies · 0.7neural ODE · 0.7
YearPublicationVenuePosition
2026 TinyChemVL: Advancing Chemical Vision-Language Models via Efficient Visual Token Reduction and Complex Reaction Tasks
abstract
While Vision Language Models (VLMs) have demonstrated remarkable capabilities in general visual understanding, their application in the chemical domain has been limited, with previous works predominantly focusing on text and thus overlooking critical visual information, such as molecular structures. Current approaches that directly adopt standard VLMs for chemical tasks suffer from two primary issues: (i) computational inefficiency of processing entire chemical images with non-informative backgrounds. (ii) a narrow scope on molecular-level tasks that restricts progress in chemical reasoning. In this work, we propose TinyChemVL, an efficient and powerful chemical VLM that leverages visual token reduction and reaction-level tasks to improve model efficiency and reasoning capacity. Also, we propose ChemRxn-V, a reaction-level benchmark for assessing vision-based reaction recognition and prediction tasks. Directly predicting reaction products from molecular images poses a non-trivial challenge, as it requires models to integrate both recognition and reasoning capacities. Our results demonstrate that, with only 4B parameters, TinyChemVL achieves superior performance on both molecular and reaction tasks, while also demonstrating faster inference and training speeds compared to existing models. Notably, TinyChemVL outperforms ChemVLM while utilizing only 1/16th of the visual tokens. This work builds efficient yet powerful VLMs for chemical domains by co-designing model architecture and task complexity.
Xuanle Zhao, Shuxin Zeng, Xinyuan Cai, Duzhen Zhang, Xiuyi Chen, Bo Xu 0002
AAAI1
2026 AutoReproduce: Automatic AI Experiment Reproduction with Paper Lineage
abstract
Xuanle Zhao, Zilin Sang, Yuxuan Li, Qi Shi, Weilun Zhao, Shuo Wang, Duzhen Zhang, Xu Han, Zhiyuan Liu, Maosong Sun. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Xuanle Zhao, Zilin Sang, Qi Shi 0002, Wei-Lun Zhao, Shuo Wang 0013, Duzhen Zhang, Xu Han 0007, Zhiyuan Liu 0001, Maosong Sun 0001
ACL (1)1
2025 ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation
abstract
Multimodal Large Language Models (MLLMs) have demonstrated remarkable capabilities in chart understanding tasks.However, interpreting charts with textual descriptions often leads to information loss, as it fails to fully capture the dense information embedded in charts.In contrast, parsing charts into code provides lossless representations that can effectively contain all critical details.Although existing open-source MLLMs have achieved success in chart understanding tasks, they still face two major challenges when applied to chart-to-code tasks: (1) Low executability and poor restoration of chart details in the generated code and (2) Lack of large-scale and diverse training data.To address these challenges, we propose ChartCoder, the first dedicated chart-to-code MLLM, which leverages Code LLMs as the language backbone to enhance the executability of the generated code.Furthermore, we introduce Chart2Code-160k, the first large-scale and diverse dataset for chartto-code generation, and propose the Snippetof-Thought (SoT) method, which transforms direct chart-to-code generation data into stepby-step generation.Experiments demonstrate that ChartCoder, with only 7B parameters, surpasses existing open-source MLLMs on chartto-code benchmarks, achieving superior chart restoration and code excitability.Our code is available at https://github.com/thunlp/ ChartCoder.89 seed code with 27 chart types Available functions and parameters
Xuanle Zhao, Xianzhen Luo, Qi Shi 0002, Chi Chen 0005, Shuo Wang 0013, Zhiyuan Liu 0001, Maosong Sun 0001
ACL (1)1
2023 ODE-based Recurrent Model-free Reinforcement Learning for POMDPs
abstract
Neural ordinary differential equations (ODEs) are widely recognized as the standard for modeling physical mechanisms, which help to perform approximate inference in unknown physical or biological environments. In partially observable (PO) environments, how to infer unseen information from raw observations puzzled the agents. By using a recurrent policy with a compact context, context-based reinforcement learning provides a flexible way to extract unobservable information from historical transitions. To help the agent extract more dynamics-related information, we present a novel ODE-based recurrent model combines with model-free reinforcement learning (RL) framework to solve partially observable Markov decision processes (POMDPs). We experimentally demonstrate the efficacy of our methods across various PO continuous control and meta-RL tasks. Furthermore, our experiments illustrate that our method is robust against irregular observations, owing to the ability of ODEs to model irregularly-sampled time series.
Xuanle Zhao, Duzhen Zhang, Liyuan Han, Tielin Zhang, Bo Xu 0002
NeurIPS1