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

Kangrui Wang

dblp:216/9159 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
8since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 9 · 2 first-author · 7 since 2021Computer networks · 1 · 1 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
9 papers
Reinforcement learning · 18% Multi-agent systems · 14% Knowledge representation and reasoning · 13%
Theoretical computer science
1 paper
Approximation and online algorithms · 87% Mathematical optimization · 13%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational social science and digital humanities · 45% Smart cities and intelligent transportation · 45% Environmental and earth informatics · 10%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › autonomous agents
embodied agent
1.622025
EmbodiedBench: Comprehensive Benchmarking Multi-modal Large Language Models for Vision-Driven Embodied Agents · ICML 2025
Embodied Agent Interface: Benchmarking LLMs for Embodied Decision Making · NeurIPS 2024
Knowledge, reasoning and agents › Multi-agent systems › multimodal agent
vision-language model agent
1.122025
EmbodiedBench: Comprehensive Benchmarking Multi-modal Large Language Models for Vision-Driven Embodied Agents · ICML 2025
VAGEN: Reinforcing World Model Reasoning for Multi-Turn VLM Agents · NeurIPS 2025
Robotics › Motion planning and robot control
robot learning
1.012026
WorldAgen: Unified State-Action Prediction with Test-Time World Model Training · AAAI 2026
Machine learning › Transfer learning and domain adaptation
test-time adaptation
1.012026
WorldAgen: Unified State-Action Prediction with Test-Time World Model Training · AAAI 2026
Machine learning › Transfer learning and domain adaptation › test-time adaptation
test-time training
1.012026
WorldAgen: Unified State-Action Prediction with Test-Time World Model Training · AAAI 2026
Robotics › Robot manipulation › embodied foundation models
vision-language-action model
1.012026
WorldAgen: Unified State-Action Prediction with Test-Time World Model Training · AAAI 2026
Machine learning › Reinforcement learning › model-based reinforcement learning
world model
1.012026
WorldAgen: Unified State-Action Prediction with Test-Time World Model Training · AAAI 2026
Machine learning › Reinforcement learning › value function estimation
advantage estimation
0.912025
VAGEN: Reinforcing World Model Reasoning for Multi-Turn VLM Agents · NeurIPS 2025
Machine learning › Reinforcement learning › multi-agent reinforcement learning
credit assignment
0.912025
VAGEN: Reinforcing World Model Reasoning for Multi-Turn VLM Agents · NeurIPS 2025
Robotics › Robot navigation and mapping
embodied navigation
0.912025
EmbodiedBench: Comprehensive Benchmarking Multi-modal Large Language Models for Vision-Driven Embodied Agents · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.822020
Non-separable Non-stationary random fields · ICML 2020
Multi-resolution Multi-task Gaussian Processes · NeurIPS 2019
Natural language and speech › Language models and text generation
large language model evaluation
0.812024
Embodied Agent Interface: Benchmarking LLMs for Embodied Decision Making · NeurIPS 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
abductive reasoning
0.712023
Language Models Can Improve Event Prediction by Few-Shot Abductive Reasoning · NeurIPS 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
concept learning
0.712023
Towards the Difficulty for a Deep Neural Network to Learn Concepts of Different Complexities · NeurIPS 2023
Natural language and speech › Information extraction and text analysis › event analysis
event prediction
0.712023
Language Models Can Improve Event Prediction by Few-Shot Abductive Reasoning · NeurIPS 2023
Machine learning › Trustworthy machine learning
interpretability
0.712023
Towards the Difficulty for a Deep Neural Network to Learn Concepts of Different Complexities · NeurIPS 2023
Natural language and speech › Language models and text generation
large language model
0.712023
Language Models Can Improve Event Prediction by Few-Shot Abductive Reasoning · NeurIPS 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic-based reasoning
0.712023
Explicit Planning Helps Language Models in Logical Reasoning · EMNLP 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic-based reasoning
multi-step logical reasoning
0.712023
Explicit Planning Helps Language Models in Logical Reasoning · EMNLP 2023
Computational social science and digital humanities › social computing › crowdsourcing
spatial crowdsourcing
0.512021
An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing · IEEE Trans. Mob. Comput. 2021
Smart cities and intelligent transportation
task assignment
0.512021
An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing · IEEE Trans. Mob. Comput. 2021
Approximation and online algorithms
approximation algorithms
0.512021
An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing · IEEE Trans. Mob. Comput. 2021
Approximation and online algorithms › approximation algorithms
constant-factor approximation
0.512021
An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing · IEEE Trans. Mob. Comput. 2021
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
multi-output gaussian process
0.412019
Multi-resolution Multi-task Gaussian Processes · NeurIPS 2019
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process › hierarchical gaussian process
multiresolution gaussian processes
0.412019
Multi-resolution Multi-task Gaussian Processes · NeurIPS 2019
Robotics › Motion planning and robot control › robot learning
embodied manipulation
0.312025
EmbodiedBench: Comprehensive Benchmarking Multi-modal Large Language Models for Vision-Driven Embodied Agents · ICML 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process
0.312025
VAGEN: Reinforcing World Model Reasoning for Multi-Turn VLM Agents · NeurIPS 2025
Natural language and speech › Language models and text generation › prompting
chain-of-thought prompting
0.212023
Explicit Planning Helps Language Models in Logical Reasoning · EMNLP 2023
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
kernel design
0.112020
Non-separable Non-stationary random fields · ICML 2020
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.112019
Multi-resolution Multi-task Gaussian Processes · NeurIPS 2019

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

benchmarking · 1.6world modeling · 1.0transformer · 1.0test-time training · 1.0partition and shifting · 1.0greedy algorithm · 1.0reward shaping · 0.9reinforcement learning · 0.9bi-level general advantage estimation · 0.9error taxonomy · 0.8language model · 0.7explicit planning · 0.7variational approximation · 0.4deep gaussian processes · 0.4composite likelihood · 0.4
YearPublicationVenuePosition
2026 WorldAgen: Unified State-Action Prediction with Test-Time World Model Training
abstract
How can vision-language-action (VLA) models adapt to new environments where world dynamics shift? While recent research has combined world modeling and action prediction to improve VLA performance, existing methods largely rely on pretraining in static datasets, without mechanisms for active adaptation to new environments. As a result, these models often fail to generalize when deployed in unseen scenarios with novel object configurations or dynamics. We present WorldAgen, a unified framework that jointly learns world modeling and action prediction while enabling test-time training (TTT) to adapt to new environments. WorldAgen employs a shared Transformer backbone with two heads: (1) a world-model head that predicts future states from past state-action trajectories, and (2) an agent-model head that predicts actions conditioned on task instructions. During test time, WorldAgen samples exploratory actions, collects ground-truth state transitions, and performs lightweight TTT updates to refine its world model. This adaptation improves the model's understanding to the environments and leads to more accurate action predictions. Experiments on the CALVIN and LIBERO benchmarks demonstrate that our baseline model achieves comparable, and in some cases superior, performance to current state-of-the-art approaches. Moreover, with TTT on a small number of samples, our method surpasses existing state-of-the-art models, highlighting the effectiveness of adapting world models at inference time.
Chi Wan, Kangrui Wang, Pingyue Zhang, Manling Li
AAAI2
2025 EmbodiedBench: Comprehensive Benchmarking Multi-modal Large Language Models for Vision-Driven Embodied Agents
abstract
Leveraging Multi-modal Large Language Models (MLLMs) to create embodied agents offers a promising avenue for tackling real-world tasks. While language-centric embodied agents have garnered substantial attention, MLLM-based embodied agents remain underexplored due to the lack of comprehensive evaluation frameworks. To bridge this gap, we introduce EmbodiedBench, an extensive benchmark designed to evaluate vision-driven embodied agents. EmbodiedBench features: (1) a diverse set of 1,128 testing tasks across four environments, ranging from high-level semantic tasks (e.g., household) to low-level tasks involving atomic actions (e.g., navigation and manipulation); and (2) six meticulously curated subsets evaluating essential agent capabilities like commonsense reasoning, complex instruction understanding, spatial awareness, visual perception, and long-term planning. Through extensive experiments, we evaluated 24 leading proprietary and open-source MLLMs within EmbodiedBench. Our findings reveal that: MLLMs excel at high-level tasks but struggle with low-level manipulation, with the best model, GPT-4o, scoring only $28.9\%$ on average. EmbodiedBench provides a multifaceted standardized evaluation platform that not only highlights existing challenges but also offers valuable insights to advance MLLM-based embodied agents. Our code and dataset are available at [https://embodiedbench.github.io](https://embodiedbench.github.io).
Rui Yang 0010, Hanyang Chen, Mark Zhao, Cheng Qian 0008, Kangrui Wang, Qineng Wang, Teja Venkat Koripella, Marziyeh Movahedi, Manling Li, Heng Ji 0001, Huan Zhang 0001, Tong Zhang 0001
ICML6
2025 VAGEN: Reinforcing World Model Reasoning for Multi-Turn VLM Agents
abstract
A major challenge in training VLM agents, compared to LLM agents, is that states shift from simple texts to complex visual observations, which introduces partial observability and demands robust world modeling. We ask: can VLM agents build internal world models through explicit visual state reasoning? In this work, we architecturally enforce and reward VLM agent’s reasoning process via reinforcement learning (RL), formulating the problem as a Partially Observable Markov Decision Process (POMDP). We demonstrate that structuring agent’s reasoning into StateEstimation (“what is the current state?”) and TransitionModeling (“what is next?”) is critical by studying five reasoning strategies. Investigating how agents should ground visual states and represent these internal beliefs, we reveal the optimal representations are task-dependent: Natural Language excels at capturing semantic relationships for general tasks, while Structured formats are essential for high-precision manipulation. These insights motivate our approach to reward shaping and credit assignment. We leverage a WorldModeling Reward to densely rewards the agent’s turn-by-turn state predictions, while our Bi-Level General Advantage Estimation (Bi-Level GAE) enables turn-aware credit assignment. Through such world model reasoning, we enable a 3B model to achieve performance of 0.82 on a set of five diverse agent tasks, nearly 3× improvement over its untrained counterpart (0.21) and surpassing proprietary reasoning models like GPT-5 (0.75), Gemini 2.5 Pro (0.67) and Claude 4.5 (0.62). All experiments are supported by our VAGEN framework, a scalable system for training and analyzing multi-turn VLM agents across diverse visual environments
Kangrui Wang, Pingyue Zhang, Zihan Wang 0008, Yaning Gao, Qineng Wang, Hanyang Chen, Zhengyuan Yang, Ranjay Krishna, Jiajun Wu 0001, Li Fei-Fei 0001, Yejin Choi 0001, Manling Li
NeurIPS1
2024 Embodied Agent Interface: Benchmarking LLMs for Embodied Decision Making
abstract
We aim to evaluate Large Language Models (LLMs) for embodied decision making. While a significant body of work has been leveraging LLMs for decision making in embodied environments, we still lack a systematic understanding of their performance because they are usually applied in different domains, for different purposes, and built based on different inputs and outputs. Furthermore, existing evaluations tend to rely solely on a final success rate, making it difficult to pinpoint what ability is missing in LLMs and where the problem lies, which in turn blocks embodied agents from leveraging LLMs effectively and selectively. To address these limitations, we propose a generalized interface (Embodied Agent Interface) that supports the formalization of various types of tasks and input-output specifications of LLM-based modules. Specifically, it allows us to unify 1) a broad set of embodied decision-making tasks involving both state and temporally extended goals, 2) four commonly-used LLM-based modules for decision making: goal interpretation, subgoal decomposition, action sequencing, and transition modeling, and 3) a collection of fine-grained metrics that break down evaluation into error types, such as hallucination errors, affordance errors, and various types of planning errors. Overall, our benchmark offers a comprehensive assessment of LLMs’ performance for different subtasks, pinpointing the strengths and weaknesses in LLM-powered embodied AI systems and providing insights into the effective and selective use of LLMs in embodied decision making.
Manling Li, Qineng Wang, Kangrui Wang, Sanjana Srivastava, Cem Gökmen, Li Erran Li, Percy Liang, Li Fei-Fei 0001, Jiayuan Mao, Jiajun Wu 0001
NeurIPS4
2023 Explicit Planning Helps Language Models in Logical Reasoning
abstract
Language models have been shown to perform remarkably well on a wide range of natural language processing tasks.In this paper, we propose LEAP, a novel system that uses language models to perform multi-step logical reasoning and incorporates explicit planning into the inference procedure.Explicit planning enables the system to make more informed reasoning decisions at each step by looking ahead into their future effects.Moreover, we propose a training strategy that safeguards the planning process from being led astray by spurious features.Our full system significantly outperforms other competing methods on multiple standard datasets.When using small T5 models as its core selection and deduction components, our system performs competitively compared to GPT-3 despite having only about 1B parameters (i.e., 175 times smaller than GPT-3).When using GPT-3.5, it significantly outperforms chain-of-thought prompting on the challenging PrOntoQA dataset.We have conducted extensive empirical studies to demonstrate that explicit planning plays a crucial role in the system's performance.
Hongyu Zhao 0006, Kangrui Wang, Mo Yu, Hongyuan Mei
EMNLP2
2023 Towards the Difficulty for a Deep Neural Network to Learn Concepts of Different Complexities
abstract
This paper theoretically explains the intuition that simple concepts are more likely to be learned by deep neural networks (DNNs) than complex concepts. In fact, recent studies have observed [24, 15] and proved [26] the emergence of interactive concepts in a DNN, i.e., it is proven that a DNN usually only encodes a small number of interactive concepts, and can be considered to use their interaction effects to compute inference scores. Each interactive concept is encoded by the DNN to represent the collaboration between a set of input variables. Therefore, in this study, we aim to theoretically explain that interactive concepts involving more input variables (i.e., more complex concepts) are more difficult to learn. Our finding clarifies the exact conceptual complexity that boosts the learning difficulty.
Dongrui Liu, Huiqi Deng, Xu Cheng 0005, Qihan Ren, Kangrui Wang, Quanshi Zhang
NeurIPS5
2023 Language Models Can Improve Event Prediction by Few-Shot Abductive Reasoning
abstract
Large language models have shown astonishing performance on a wide range of reasoning tasks. In this paper, we investigate whether they could reason about real-world events and help improve the prediction performance of event sequence models. We design LAMP, a framework that integrates a large language model in event prediction. Particularly, the language model performs abductive reasoning to assist an event sequence model: the event model proposes predictions on future events given the past; instructed by a few expert-annotated demonstrations, the language model learns to suggest possible causes for each proposal; a search module finds out the previous events that match the causes; a scoring function learns to examine whether the retrieved events could actually cause the proposal. Through extensive experiments on several challenging real-world datasets, we demonstrate that our framework---thanks to the reasoning capabilities of large language models---could significantly outperform the state-of-the-art event sequence models.
Xiaoming Shi 0001, Siqiao Xue, Kangrui Wang, Fan Zhou 0012, James Y. Zhang, Jun Zhou 0011, Chenhao Tan, Hongyuan Mei
NeurIPS3
2021 An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing
abstract
Spatial crowdsourcing, a human-centric compelling paradigm in performing spatial tasks, has drawn rising attention. Task assignment is of paramount importance in spatial crowdsourcing. Existing studies often use heuristics of various kinds to solve task assignment problems. These schemes usually only apply some specific cases, once the environment changes, the efficiency of the algorithms is significantly reduced. In this paper, we first introduce a taxonomy of task assignment in spatial crowdsourcing. Next, we design an approximation algorithm and get an efficient solution for the important problem, namely, Bounded and Heterogeneous Task Assignment (BHTA), such that the sum of the rewards of workers is maximized subject to multiple constraints. We prove that the BHTA problem is NP-hard. Subsequently, we propose a constant-ratio approximation algorithm based on partition and shifting method to achieve the assignment solution. To meet with the workers' dynamism, we further devise a greedy algorithm and provide theoretical guarantee. Experiments on synthetic and real datasets demonstrate the efficiency of our strategy over previous methods. So far as we know, this paper is the first attempt to give a constant-ratio approximation for such task assignment problems in spatial crowdsourcing.
Shahzad Sarwar Bhatti, Kangrui Wang, Xiaofeng Gao 0001, Fan Wu 0006, Guihai Chen
IEEE Trans. Mob. Comput.3
2020 Non-separable Non-stationary random fields
abstract
We describe a framework for constructing nonstationary nonseparable random fields based on an infinite mixture of convolved stochastic processes. When the mixing process is stationary but the convolution function is nonstationary we arrive at nonseparable kernels with constant non-separability that are available in closed form. When the mixing is nonstationary and the convolution function is stationary we arrive at nonseparable random fields that have varying nonseparability and better preserve local structure. These fields have natural interpretations through the spectral representation of stochastic differential equations (SDEs) and are demonstrated on a range of synthetic benchmarks and spatio-temporal applications in geostatistics and machine learning. We show how a single Gaussian process (GP) with these random fields can computationally and statistically outperform both separable and existing nonstationary nonseparable approaches such as treed GPs and deep GP constructions.
Kangrui Wang, Oliver Hamelijnck, Theodoros Damoulas, Mark F. J. Steel
ICML1
2019 Multi-resolution Multi-task Gaussian Processes
abstract
We consider evidence integration from potentially dependent observation processes under varying spatio-temporal sampling resolutions and noise levels. We offer a multi-resolution multi-task (MRGP) framework that allows for both inter-task and intra-task multi-resolution and multi-fidelity. We develop shallow Gaussian Process (GP) mixtures that approximate the difficult to estimate joint likelihood with a composite one and deep GP constructions that naturally handle biases. In doing so, we generalize existing approaches and offer information-theoretic corrections and efficient variational approximations. We demonstrate the competitiveness of MRGPs on synthetic settings and on the challenging problem of hyper-local estimation of air pollution levels across London from multiple sensing modalities operating at disparate spatio-temporal resolutions.
Oliver Hamelijnck, Theodoros Damoulas, Kangrui Wang, Mark A. Girolami
NeurIPS3