Publications

(* denotes equal contribution, † denotes corresponding author)

RoleWorld: Knowledge Transfer in World Modeling with Functional Role Abstractions
Boyuan Xiao, Pu Wang, Ji Feng, Yao-Xiang Ding
Preprint · arXiv:2610.13172

tl;drKnowledge transfer in world modeling for LLM agents, via functional role abstractions.

We introduce RoleWorld, a symbolic world modeling approach for LLM agents that uses functional role abstractions, i.e., reusable role prototypes with environment-specific parameter values, to represent how objects behave in interactions. From interaction trajectories, a teacher LLM extracts role prototypes and executable transition rules defined over role instances, together with a skill that guides the actor LLM to use role information in decision making. In a target world, the actor works without the teacher: it actively tests role hypotheses through interaction when uncertainty about them affects the current decision, and refines role assignments and parameter estimates online from action feedback, with no LLM parameter updates. Experiments on the MARS benchmark show robust generalization across environments with significantly altered object behavior.

Tree-Guided Identify-Then-Exploit: A Unified Framework of Best Arm Identification and Regret Minimization for Dueling Bandits
Pu Wang, Yao-Xiang Ding
NeurIPS 2026: The Fortieth Annual Conference on Neural Information Processing Systems · arXiv:2606.01799

tl;drA unified framework for best arm identification and weak/strong regret in dueling bandits.

We propose Tree-Guided Identify-Then-Exploit (TG-ITE), the first unified framework for N-armed dueling bandits that handles best arm identification (BAI), weak regret, and strong regret under only the Condorcet-winner assumption. A shared tree-guided identification stage finds a high-confidence incumbent within O(N) comparisons, and objective-specific exploitation strategies then build on this warm start. TG-ITE achieves O(N) sample complexity for BAI without stronger assumptions, gives the first winner-stays-style algorithm with O(N) weak regret, and matches the O(N log T) strong regret of specialized methods. When BAI and weak regret are optimized jointly, it attains O(N) for both, removing the O(log N) suboptimality gap of the existing approach.