collaborators

12 papers

cs.AI2026

Thinking-Based Non-Thinking: Solving the Reward Hacking Problem in Training Hybrid Reasoning Models via Reinforcement Learning

Siyuan Gan, Jiaheng Liu, Boyan Wang +8

Large reasoning models (LRMs) have attracted much attention due to their exceptional performance. However, their performance mainly stems from thinking, a long Chain of Thought (Co…

cs.LG2026

Tool-Aware Optimization with Entropy Guidance for Efficient Agentic Reinforcement Learning

Hongye Cao, Nuo Yan, Haoyuan Deng +5

Agentic reinforcement learning (RL) equips large language models (LLMs) with tool-use capabilities that substantially improve reasoning on complex tasks. However, integrating exter…

cs.AI2026

Multi-Agent Reinforcement Learning with Communication-Constrained Priors

Guang Yang, Tianpei Yang, Jingwen Qiao +4

Communication is one of the effective means to improve the learning of cooperative policy in multi-agent systems. However, in most real-world scenarios, lossy communication is a pr…

cs.CL2026

SafeDialBench: A Fine-Grained Safety Evaluation Benchmark for Large Language Models in Multi-Turn Dialogues with Diverse Jailbreak Attacks

Hongye Cao, Sijia Jing, Yanming Wang +14

With the rapid advancement of Large Language Models (LLMs), the safety of LLMs has been a critical concern requiring precise assessment. Current benchmarks primarily concentrate on…

cs.AI2026

Efficient Reinforcement Learning with Semantic and Token Entropy for LLM Reasoning

Hongye Cao, Zhixin Bai, Ziyue Peng +5

Reinforcement learning with verifiable rewards (RLVR) has demonstrated superior performance in enhancing the reasoning capability of large language models (LLMs). However, this acc…

cs.LG2025

Faster Game Solving via Asymmetry of Step Sizes

Linjian Meng, Tianpei Yang, Youzhi Zhang +2

Counterfactual Regret Minimization (CFR) algorithms are widely used to compute a Nash equilibrium (NE) in two-player zero-sum imperfect-information extensive-form games (IIGs). Amo…