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

Kongcheng Zhang

dblp:383/5121 · DBLP profile ↗
← Back
4ranked-venue papers
1as 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 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Reinforcement learning · 48% Language models and text generation · 36% Multi-agent systems · 12%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model reasoning
1.722025
Consistent Paths Lead to Truth: Self-Rewarding Reinforcement Learning for LLM Reasoning · NeurIPS 2025
SeRL: Self-play Reinforcement Learning for Large Language Models with Limited Data · NeurIPS 2025
Machine learning › Reinforcement learning › exploration
intrinsic motivation
0.912025
Consistent Paths Lead to Truth: Self-Rewarding Reinforcement Learning for LLM Reasoning · NeurIPS 2025
Natural language and speech › Language models and text generation
LLM agents
0.912025
Odyssey : Empowering Minecraft Agents with Open-World Skills · IJCAI 2025
Knowledge, reasoning and agents › Multi-agent systems › intelligent agents
open-world agent
0.912025
Odyssey : Empowering Minecraft Agents with Open-World Skills · IJCAI 2025
Machine learning › Reinforcement learning › reinforcement learning for NLP
reinforcement learning for language models
0.912025
SeRL: Self-play Reinforcement Learning for Large Language Models with Limited Data · NeurIPS 2025
Machine learning › Reinforcement learning › sample efficiency
sample-efficient reinforcement learning
0.912025
SeRL: Self-play Reinforcement Learning for Large Language Models with Limited Data · NeurIPS 2025
Machine learning › Reinforcement learning › multi-agent reinforcement learning › self-play
self-play reinforcement learning
0.912025
SeRL: Self-play Reinforcement Learning for Large Language Models with Limited Data · NeurIPS 2025
Security and privacy of machine learning
red teaming
0.912025
MUSE: MCTS-Driven Red Teaming Framework for Enhanced Multi-Turn Dialogue Safety in Large Language Models · EMNLP 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
long-horizon planning
0.312025
Odyssey : Empowering Minecraft Agents with Open-World Skills · IJCAI 2025

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

monte carlo tree search · 1.7skill library · 0.9self-rewarding · 0.9self-instruction · 0.9majority voting · 0.9large language model · 0.9fine-tuning · 0.9curiosity bonus · 0.9consistency-volatility aggregation · 0.9
YearPublicationVenuePosition
2025 MUSE: MCTS-Driven Red Teaming Framework for Enhanced Multi-Turn Dialogue Safety in Large Language Models
abstract
Siyu Yan, Long Zeng, Xuecheng Wu, Chengcheng Han, Kongcheng Zhang, Chong Peng, Xuezhi Cao, Xunliang Cai, Chenjuan Guo. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.
Long Zeng 0004, Chengcheng Han 0004, Kongcheng Zhang, Xuezhi Cao, Chenjuan Guo
EMNLP5
2025 Odyssey : Empowering Minecraft Agents with Open-World Skills
abstract
Recent studies have delved into constructing generalist agents for open-world environments like Minecraft. Despite the encouraging results, existing efforts mainly focus on solving basic programmatic tasks, e.g., material collection and tool-crafting following the Minecraft tech-tree, treating the ObtainDiamond task as the ultimate goal. This limitation stems from the narrowly defined set of actions available to agents, requiring them to learn effective long-horizon strategies from scratch. Consequently, discovering diverse gameplay opportunities in the open world becomes challenging. In this work, we introduce Odyssey, a new framework that empowers Large Language Model (LLM)-based agents with open-world skills to explore the vast Minecraft world. Odyssey comprises three key parts: (1) An interactive agent with an open-world skill library that consists of 40 primitive skills and 183 compositional skills. (2) A fine-tuned LLaMA-3 model trained on a large question-answering dataset with 390k+ instruction entries derived from the Minecraft Wiki. (3) A new agent capability benchmark includes the long-term planning task, the dynamic-immediate planning task, and the autonomous exploration task. Extensive experiments demonstrate that the proposed Odyssey framework can effectively evaluate different capabilities of LLM-based agents. All datasets, model weights, and code are publicly available to motivate future research on more advanced autonomous agent solutions.
Shunyu Liu 0001, Yaoru Li, Kongcheng Zhang, Zhenyu Cui, Wenkai Fang, Yuxuan Zheng, Tongya Zheng, Mingli Song
IJCAI3
2025 SeRL: Self-play Reinforcement Learning for Large Language Models with Limited Data
abstract
Recent advances have demonstrated the effectiveness of Reinforcement Learning (RL) in improving the reasoning capabilities of Large Language Models (LLMs). However, existing works inevitably rely on high-quality instructions and verifiable rewards for effective training, both of which are often difficult to obtain in specialized domains. In this paper, we propose Self-play Reinforcement Learning (SeRL) to bootstrap LLM training with limited initial data. Specifically, SeRL comprises two complementary modules: self-instruction and self-rewarding. The former module generates additional instructions based on the available data at each training step, employing comprehensive online filtering strategies to ensure instruction quality, diversity, and difficulty. The latter module introduces a simple yet effective majority-voting mechanism to estimate response rewards for additional instructions, eliminating the need for external annotations. Finally, SeRL performs conventional RL based on the generated data, facilitating iterative self-play learning. Extensive experiments on various reasoning benchmarks and across different LLM backbones demonstrate that the proposed SeRL yields results superior to its counterparts and achieves performance on par with those obtained by high-quality data with verifiable rewards. Our code is available at https://github.com/wantbook-book/SeRL.
Wenkai Fang, Shunyu Liu 0001, Kongcheng Zhang, Tongya Zheng, Kai-Xuan Chen 0001, Mingli Song, Dacheng Tao
NeurIPS4
2025 Consistent Paths Lead to Truth: Self-Rewarding Reinforcement Learning for LLM Reasoning
abstract
Recent advances of Reinforcement Learning (RL) have highlighted its potential in complex reasoning tasks, yet effective training often relies on external supervision, which limits the broader applicability. In this work, we propose a novel self-rewarding reinforcement learning framework to enhance Large Language Model (LLM) reasoning by leveraging the consistency of intermediate reasoning states across different reasoning trajectories. Our key insight is that correct responses often exhibit consistent trajectory patterns in terms of model likelihood: their intermediate reasoning states tend to converge toward their own final answers (*high consistency*) with minimal deviation toward other candidates (*low volatility*). Inspired by this observation, we introduce CoVo, an intrinsic reward mechanism that integrates ***Co***nsistency and ***Vo***latility via a robust vector-space aggregation strategy, complemented by a curiosity bonus to promote diverse exploration. CoVo enables LLMs to perform RL in a self-rewarding manner, offering a scalable pathway for learning to reason without external supervision. Extensive experiments on diverse reasoning benchmarks show that CoVo achieves performance comparable to or even surpassing supervised RL. Our code is available at https://github.com/sastpg/CoVo.
Kongcheng Zhang, Shunyu Liu 0001, Baisheng Lai, Jieping Ye, Mingli Song, Dacheng Tao
NeurIPS1