← Search

Chengjie Wu

8 accepted papers

2026

OPRIDE: Efficient Offline Preference-based Reinforcement Learning via In-Dataset Exploration

ICLR 2026poster

Preference-based reinforcement learning (PbRL) can help avoid sophisticated reward designs and align better with human intentions, showing great promise in various real-world applications. However, obtaining human feedback for preferences can be expensive and time-consuming, which forms a strong bar…

Cited by 0SourceScholar
2025

Fewer May Be Better: Enhancing Offline Reinforcement Learning with Reduced Dataset

ICLR 2025poster

Research in offline reinforcement learning (RL) marks a paradigm shift in RL. However, a critical yet under-investigated aspect of offline RL is determining the subset of the offline dataset, which is used to improve algorithm performance while accelerating algorithm training. Moreover, the size of…

Cited by 0SourcePDFScholar
2024

Bayesian Design Principles for Offline-to-Online Reinforcement Learning

ICML 2024poster

Offline reinforcement learning (RL) is crucial for real-world applications where exploration can be costly or unsafe. However, offline learned policies are often suboptimal, and further online fine-tuning is required. In this paper, we tackle the fundamental dilemma of offline-to-online fine-tuning:…

2024

Planning, Fast and Slow: Online Reinforcement Learning with Action-Free Offline Data via Multiscale Planners

ICML 2024poster

The surge in volumes of video data offers unprecedented opportunities for advancing reinforcement learning (RL). This growth has motivated the development of passive RL, seeking to convert passive observations into actionable insights. This paper explores the prerequisites and mechanisms through whi…

Cited by 0SourcePDFScholar
2024

Stylized Offline Reinforcement Learning: Extracting Diverse High-Quality Behaviors from Heterogeneous Datasets

ICLR 2024poster

Previous literature on policy diversity in reinforcement learning (RL) either focuses on the online setting or ignores the policy performance. In contrast, offline RL, which aims to learn high-quality policies from batched data, has yet to fully leverage the intrinsic diversity of the offline datase…

Cited by 9SourcePDFScholar
2023

Conservative Offline Policy Adaptation in Multi-Agent Games

NeurIPS 2023poster

Prior research on policy adaptation in multi-agent games has often relied on online interaction with the target agent in training, which can be expensive and impractical in real-world scenarios. Inspired by recent progress in offline reinforcement learn- ing, this paper studies offline policy adapta…

Cited by 2SourcePDFScholar
2022

Safe Opponent-Exploitation Subgame Refinement

NeurIPS 2022accept

In zero-sum games, an NE strategy tends to be overly conservative confronted with opponents of limited rationality, because it does not actively exploit their weaknesses. From another perspective, best responding to an estimated opponent model is vulnerable to estimation errors and lacks safety guar…

Cited by 9SourcePDFScholar
2021

Celebrating Diversity in Shared Multi-Agent Reinforcement Learning

NeurIPS 2021poster

Recently, deep multi-agent reinforcement learning (MARL) has shown the promise to solve complex cooperative tasks. Its success is partly because of parameter sharing among agents. However, such sharing may lead agents to behave similarly and limit their coordination capacity. In this paper, we aim t…

Cited by 189SourcePDFScholar