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

Kaizhao Yuan

dblp:301/8355 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 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
3 papers
Reinforcement learning · 47% Transfer learning and domain adaptation · 21% Language models and text generation · 18%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
data augmentation
0.912025
InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct · AAAI 2025
Natural language and speech › Language models and text generation
instruction tuning
0.912025
InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct · AAAI 2025
Program synthesis and code generation
code generation with language models
0.912025
InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct · AAAI 2025
Machine learning › Reinforcement learning › exploration › exploration strategies
conservative exploration
0.812024
OCEAN-MBRL: Offline Conservative Exploration for Model-Based Offline Reinforcement Learning · AAAI 2024
Machine learning › Reinforcement learning › offline reinforcement learning
model-based offline reinforcement learning
0.812024
OCEAN-MBRL: Offline Conservative Exploration for Model-Based Offline Reinforcement Learning · AAAI 2024
Machine learning › Reinforcement learning
offline reinforcement learning
0.812024
OCEAN-MBRL: Offline Conservative Exploration for Model-Based Offline Reinforcement Learning · AAAI 2024
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.712023
Online Prototype Alignment for Few-shot Policy Transfer · ICML 2023
Machine learning › Reinforcement learning › transfer learning in reinforcement learning
policy transfer
0.712023
Online Prototype Alignment for Few-shot Policy Transfer · ICML 2023
Machine learning › Transfer learning and domain adaptation › domain adaptation
reinforcement learning domain adaptation
0.712023
Online Prototype Alignment for Few-shot Policy Transfer · ICML 2023
Natural language and speech › Language models and text generation
code language models
0.312025
InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct · AAAI 2025

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

self-training · 1.7instruction tuning · 1.7uncertainty estimation · 0.8rollout · 0.8conservative constraints · 0.8online prototype alignment · 0.7exploration mechanism · 0.7
YearPublicationVenuePosition
2025 InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct
abstract
Recent advancements in open-source code large language models (LLMs) have been driven by fine-tuning on the data generated from powerful closed-source LLMs, which are expensive to obtain. This paper explores whether it is possible to use a fine-tuned open-source model to generate additional data to augment its instruction-tuning dataset. We make two observations: (1) A code snippet can serve as the response to different instructions. (2) Instruction-tuned code LLMs perform better at translating code into instructions than the reverse. Based on these observations, we propose Inverse-Instruct, a data augmentation technique that uses a fine-tuned LLM to generate additional instructions of code responses from its own training dataset. The additional instruction-response pairs are added to the original dataset, and a stronger code LLM can be obtained by fine-tuning on the augmented dataset. We empirically validate Inverse-Instruct on a range of open-source code models (e.g. CodeLlama-Python and DeepSeek-Coder) and benchmarks (e.g., HumanEval(+), MBPP(+), DS-1000 and MultiPL-E), showing it consistently improves the base models.
Yewen Pu, Lingzhe Gao, Ziyuan Nan, Kaizhao Yuan, Rui Zhang 0040, Xishan Zhang, Zidong Du, Qi Guo 0001, Dawei Yin 0001, Xing Hu 0001, Yunji Chen
AAAI9
2025 Morphology generalizable reinforcement learning via multi-level graph features
Yansong Pan, Rui Zhang 0040, Jiaming Guo, Shaohui Peng, Kaizhao Yuan, Yunkai Gao 0001, Siming Lan, Ruizhi Chen, Ling Li 0001, Xing Hu 0001, Zidong Du, Xin Zhang 0062, Wei Li 0008, Qi Guo 0001, Yunji Chen
Neurocomputing6
2024 OCEAN-MBRL: Offline Conservative Exploration for Model-Based Offline Reinforcement Learning
abstract
Model-based offline reinforcement learning (RL) algorithms have emerged as a promising paradigm for offline RL. These algorithms usually learn a dynamics model from a static dataset of transitions, use the model to generate synthetic trajectories, and perform conservative policy optimization within these trajectories. However, our observations indicate that policy optimization methods used in these model-based offline RL algorithms are not effective at exploring the learned model and induce biased exploration, which ultimately impairs the performance of the algorithm. To address this issue, we propose Offline Conservative ExplorAtioN (OCEAN), a novel rollout approach to model-based offline RL. In our method, we incorporate additional exploration techniques and introduce three conservative constraints based on uncertainty estimation to mitigate the potential impact of significant dynamic errors resulting from exploratory transitions. Our work is a plug-in method and can be combined with classical model-based RL algorithms, such as MOPO, COMBO, and RAMBO. Experiment results of our method on the D4RL MuJoCo benchmark show that OCEAN significantly improves the performance of existing algorithms.
Rui Zhang 0040, Qi Yi, Yunkai Gao 0001, Jiaming Guo, Shaohui Peng, Siming Lan, Husheng Han, Yansong Pan, Kaizhao Yuan, Pengwei Jin, Ruizhi Chen, Yunji Chen, Ling Li 0001
AAAI10
2023 Online Prototype Alignment for Few-shot Policy Transfer
abstract
Domain adaptation in RL mainly deals with the changes of observation when transferring the policy to a new environment. Many traditional approaches of domain adaptation in RL manage to learn a mapping function between the source and target domain in explicit or implicit ways. However, they typically require access to abundant data from the target domain. Besides, they often rely on visual clues to learn the mapping function and may fail when the source domain looks quite different from the target domain. To address these problems, in this paper, we propose a novel framework Online Prototype Alignment (OPA) to learn the mapping function based on the functional similarity of elements and is able to achieve few-shot policy transfer within only several episodes. The key insight of OPA is to introduce an exploration mechanism that can interact with the unseen elements of the target domain in an efficient and purposeful manner, and then connect them with the seen elements in the source domain according to their functionalities (instead of visual clues). Experimental results show that when the target domain looks visually different from the source domain, OPA can achieve better transfer performance even with much fewer samples from the target domain, outperforming prior methods.
Qi Yi, Rui Zhang 0040, Shaohui Peng, Jiaming Guo, Yunkai Gao 0001, Kaizhao Yuan, Ruizhi Chen, Siming Lan, Xing Hu 0001, Zidong Du, Xishan Zhang, Qi Guo 0001, Yunji Chen
ICML6