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

Guowei Xu 0001

dblp:11/7718-1 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
6 papers
Reinforcement learning · 48% Language models and text generation · 19% Vision and language · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › deep reinforcement learning
visual reinforcement learning
1.622025
MENTOR: Mixture-of-Experts Network with Task-Oriented Perturbation for Visual Reinforcement Learning · ICML 2025
DrM: Mastering Visual Reinforcement Learning through Dormant Ratio Minimization · ICLR 2024
Natural language and speech › Language models and text generation
chain-of-thought reasoning
0.912025
LlaVA-CoT: Let Vision Language Models Reason Step-By-Step · ICCV 2025
Machine learning › Optimization for machine learning › optimization
meta-optimization
0.912025
metaTextGrad: Automatically optimizing language model optimizers · NeurIPS 2025
Computer vision › Vision and language
multimodal reasoning
0.912025
LlaVA-CoT: Let Vision Language Models Reason Step-By-Step · ICCV 2025
Natural language and speech › Language models and text generation › prompting › prompt engineering
prompt optimization
0.912025
metaTextGrad: Automatically optimizing language model optimizers · NeurIPS 2025
Machine learning › Reinforcement learning › deep reinforcement learning › visual reinforcement learning
sample-efficient visual RL
0.912025
MENTOR: Mixture-of-Experts Network with Task-Oriented Perturbation for Visual Reinforcement Learning · ICML 2025
Natural language and speech › Language models and text generation
step-by-step reasoning
0.912025
LlaVA-CoT: Let Vision Language Models Reason Step-By-Step · ICCV 2025
Computer vision › Vision and language
vision-language model
0.912025
LlaVA-CoT: Let Vision Language Models Reason Step-By-Step · ICCV 2025
Robotics › Robot manipulation › object manipulation
visual robotic manipulation
0.912025
MENTOR: Mixture-of-Experts Network with Task-Oriented Perturbation for Visual Reinforcement Learning · ICML 2025
Machine learning › Reinforcement learning
actor-critic methods
0.812024
ACE: Off-Policy Actor-Critic with Causality-Aware Entropy Regularization · ICML 2024
Machine learning › Reinforcement learning › regularization for reinforcement learning
entropy regularization
0.812024
ACE: Off-Policy Actor-Critic with Causality-Aware Entropy Regularization · ICML 2024
Machine learning › Reinforcement learning
exploration
0.812024
ACE: Off-Policy Actor-Critic with Causality-Aware Entropy Regularization · ICML 2024
Machine learning › Reinforcement learning › exploration
exploration-exploitation tradeoff
0.812024
DrM: Mastering Visual Reinforcement Learning through Dormant Ratio Minimization · ICLR 2024
Machine learning › Reinforcement learning › actor-critic methods
off-policy actor-critic
0.812024
ACE: Off-Policy Actor-Critic with Causality-Aware Entropy Regularization · ICML 2024
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning
0.712023
Can Pre-Trained Text-to-Image Models Generate Visual Goals for Reinforcement Learning? · NeurIPS 2023
Robotics › Motion planning and robot control
robot learning
0.712023
Can Pre-Trained Text-to-Image Models Generate Visual Goals for Reinforcement Learning? · NeurIPS 2023
Natural language and speech › Language models and text generation
LLM agents
0.312025
metaTextGrad: Automatically optimizing language model optimizers · NeurIPS 2025
Machine learning › Deep learning architectures and training
mixture of experts
0.312025
MENTOR: Mixture-of-Experts Network with Task-Oriented Perturbation for Visual Reinforcement Learning · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.212024
ACE: Off-Policy Actor-Critic with Causality-Aware Entropy Regularization · ICML 2024
Machine learning › Reinforcement learning
continuous control
0.212024
DrM: Mastering Visual Reinforcement Learning through Dormant Ratio Minimization · ICLR 2024
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.212023
Can Pre-Trained Text-to-Image Models Generate Visual Goals for Reinforcement Learning? · NeurIPS 2023

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

vision-language model · 0.9task-oriented perturbation · 0.9mixture of experts · 0.9meta structure optimization · 0.9meta prompt optimization · 0.9model-free reinforcement learning · 0.8dormant ratio minimization · 0.8dormancy-guided reset · 0.8causality-aware entropy regularization · 0.8goal discriminator · 0.7
YearPublicationVenuePosition
2025 LlaVA-CoT: Let Vision Language Models Reason Step-By-Step
Guowei Xu 0001, Peng Jin 0001, Ziang Wu, Yibing Song, Lichao Sun 0001, Li Yuan 0007
ICCV1
2025 MENTOR: Mixture-of-Experts Network with Task-Oriented Perturbation for Visual Reinforcement Learning
abstract
Visual deep reinforcement learning (RL) enables robots to acquire skills from visual input for unstructured tasks. However, current algorithms suffer from low sample efficiency, limiting their practical applicability. In this work, we present MENTOR, a method that improves both the *architecture* and *optimization* of RL agents. Specifically, MENTOR replaces the standard multi-layer perceptron (MLP) with a mixture-of-experts (MoE) backbone and introduces a task-oriented perturbation mechanism. MENTOR outperforms state-of-the-art methods across three simulation benchmarks and achieves an average of 83\% success rate on three challenging real-world robotic manipulation tasks, significantly surpassing the 32% success rate of the strongest existing model-free visual RL algorithm. These results underscore the importance of sample efficiency in advancing visual RL for real-world robotics. Experimental videos are available at https://suninghuang19.github.io/mentor_page/.
Suning Huang, Zheyu Aqa Zhang, Tianhai Liang, Zhehao Kou, Chenhao Lu, Guowei Xu 0001, Zhengrong Xue, Huazhe Xu
ICML7
2025 metaTextGrad: Automatically optimizing language model optimizers
abstract
Large language models (LLMs) are increasingly used in learning algorithms, evaluations, and optimization tasks. Recent studies have shown that using LLM-based optimizers to automatically optimize model prompts, demonstrations, predictions themselves, or other components can significantly enhance the performance of AI systems, as demonstrated by frameworks such as DSPy and TextGrad. However, optimizers built on language models themselves are usually designed by humans with manual design choices; optimizers themselves are not optimized. Moreover, these optimizers are general purpose by design, to be useful to a broad audience, and are not tailored for specific tasks. To address these challenges, we propose metaTextGrad, which focuses on designing a meta-optimizer to further enhance existing optimizers and align them to be good optimizers for a given task. Our approach consists of two key components: a meta prompt optimizer and a meta structure optimizer. The combination of these two significantly improves performance across multiple benchmarks, achieving an average absolute performance improvement of up to 6% compared to the best baseline.
Guowei Xu 0001, Mert Yüksekgönül, Carlos Guestrin, James Zou 0001
NeurIPS1
2024 DrM: Mastering Visual Reinforcement Learning through Dormant Ratio Minimization
abstract
Visual reinforcement learning (RL) has shown promise in continuous control tasks. Despite its progress, current algorithms are still unsatisfactory in virtually every aspect of the performance such as sample efficiency, asymptotic performance, and their robustness to the choice of random seeds. In this paper, we identify a major shortcoming in existing visual RL methods that is the agents often exhibit sustained inactivity during early training, thereby limiting their ability to explore effectively. Expanding upon this crucial observation, we additionally unveil a significant correlation between the agents' inclination towards motorically inactive exploration and the absence of neuronal activity within their policy networks. To quantify this inactivity, we adopt dormant ratio as a metric to measure inactivity in the RL agent's network. Empirically, we also recognize that the dormant ratio can act as a standalone indicator of an agent's activity level, regardless of the received reward signals. Leveraging the aforementioned insights, we introduce DrM, a method that uses three core mechanisms to guide agents' exploration-exploitation trade-offs by actively minimizing the dormant ratio. Experiments demonstrate that DrM achieves significant improvements in sample efficiency and asymptotic performance with no broken seeds (76 seeds in total) across three continuous control benchmark environments, including DeepMind Control Suite, MetaWorld, and Adroit. Most importantly, DrM is the first model-free algorithm that consistently solves tasks in both the Dog and Manipulator domains from the DeepMind Control Suite as well as three dexterous hand manipulation tasks without demonstrations in Adroit, all based on pixel observations.
Guowei Xu 0001, Ruijie Zheng, Yongyuan Liang, Zhecheng Yuan, Tianying Ji, Yu Luo 0021, Xiaoyu Liu 0003, Pu Hua, Shuzhen Li, Yanjie Ze, Hal Daumé III, Furong Huang, Huazhe Xu
ICLR1
2024 ACE: Off-Policy Actor-Critic with Causality-Aware Entropy Regularization
abstract
The varying significance of distinct primitive behaviors during the policy learning process has been overlooked by prior model-free RL algorithms. Leveraging this insight, we explore the causal relationship between different action dimensions and rewards to evaluate the significance of various primitive behaviors during training. We introduce a causality-aware entropy term that effectively identifies and prioritizes actions with high potential impacts for efficient exploration. Furthermore, to prevent excessive focus on specific primitive behaviors, we analyze the gradient dormancy phenomenon and introduce a dormancy-guided reset mechanism to further enhance the efficacy of our method. Our proposed algorithm, ACE: Off-policy Actor-critic with Causality-aware Entropy regularization, demonstrates a substantial performance advantage across 29 diverse continuous control tasks spanning 7 domains compared to model-free RL baselines, which underscores the effectiveness, versatility, and efficient sample efficiency of our approach. Benchmark results and videos are available at https://ace-rl.github.io/.
Tianying Ji, Yongyuan Liang, Yan Zeng 0002, Yu Luo 0021, Guowei Xu 0001, Ruijie Zheng, Furong Huang, Fuchun Sun 0001, Huazhe Xu
ICML5
2023 Can Pre-Trained Text-to-Image Models Generate Visual Goals for Reinforcement Learning?
abstract
Pre-trained text-to-image generative models can produce diverse, semantically rich, and realistic images from natural language descriptions. Compared with language, images usually convey information with more details and less ambiguity. In this study, we propose Learning from the Void (LfVoid), a method that leverages the power of pre-trained text-to-image models and advanced image editing techniques to guide robot learning. Given natural language instructions, LfVoid can edit the original observations to obtain goal images, such as "wiping" a stain off a table. Subsequently, LfVoid trains an ensembled goal discriminator on the generated image to provide reward signals for a reinforcement learning agent, guiding it to achieve the goal. The ability of LfVoid to learn with zero in-domain training on expert demonstrations or true goal observations (the void) is attributed to the utilization of knowledge from web-scale generative models. We evaluate LfVoid across three simulated tasks and validate its feasibility in the corresponding real-world scenarios. In addition, we offer insights into the key considerations for the effective integration of visual generative models into robot learning workflows. We posit that our work represents an initial step towards the broader application of pre-trained visual generative models in the robotics field. Our project page: https://lfvoid-rl.github.io/.
Jialu Gao, Kaizhe Hu, Guowei Xu 0001, Huazhe Xu
NeurIPS3