← Search

Yi-Chen Li

18 accepted papers

2026

ADM-v2: Pursuing Full-Horizon Roll-out in Dynamics Models for Offline Policy Learning and Evaluation

ICLR 2026poster

Model-based methods for offline Reinforcement Learning transfer extensive policy exploration and evaluation to data-driven dynamics models, effectively saving real-world samples in the offline setting. We expect the dynamics model to allow the policy to roll out full-horizon episodes, which is cruci…

Cited by 0SourcecodeScholar
2026

Multi-agent In-context Coordination via Decentralized Memory Retrieval

AAAI 2026technical

Large transformer models, trained on diverse datasets, have demonstrated impressive few-shot performance on previously unseen tasks without requiring parameter updates. This capability has also been explored in Reinforcement Learning (RL), where agents interact with the environment to retrieve conte

Cited by 0SourcePDFScholar
2026

Non-Adversarial Imitation Learning Provably Free of Compounding Errors: The Role of Bellman Constraints

ICML 2026poster

Adversarial imitation learning (AIL) achieves high-quality imitation by mitigating compounding errors in behavioral cloning (BC), but often exhibits training instability due to adversarial optimization. To avoid this issue, a class of non-adversarial Q-based imitation learning (IL) methods, represen…

Cited by 0SourceScholar
2026

Provably Efficient Policy-Reward Co-Pretraining for Adversarial Imitation Learning

ICML 2026poster

Adversarial imitation learning (AIL) demonstrates superior expert sample efficiency compared to behavioral cloning (BC), yet requires substantial online environment interaction. While recent empirical work has explored initializing AIL algorithms with BC-pretrained policies to address this limitatio…

Cited by 0SourceScholar
2026

REAR: Test-time Preference Realignment through Reward Decomposition

ICML 2026poster

Aligning large language models (LLMs) with diverse user preferences is a critical yet challenging task. While post-training methods can adapt models to specific needs, they often require costly data curation and additional training. Test-time scaling (TTS) presents an efficient, training-free altern…

Cited by 0SourceScholar
2026

Towards Complete Multi-Agent Coordination Policy Learning via Denoising Maximum Entropy Optimization

ICML 2026poster

Parameter sharing is a widely used technique in Multi-Agent Reinforcement Learning (MARL) that enhances sample efficiency by equipping agents with a unified policy. While effective in homogeneous settings, it often struggles in heterogeneous environments where agents possess diverse capabilities. Co…

Cited by 0SourceScholar
2025

Any-step Dynamics Model Improves Future Predictions for Online and Offline Reinforcement Learning

ICLR 2025poster

Model-based methods in reinforcement learning offer a promising approach to enhance data efficiency by facilitating policy exploration within a dynamics model. However, accurately predicting sequential steps in the dynamics model remains a challenge due to the bootstrapping prediction, which attribu…

2025

Controlling Large Language Model with Latent Action

ICML 2025poster

Adapting Large Language Models (LLMs) to downstream tasks using Reinforcement Learning (RL) has proven to be an effective approach. However, LLMs do not inherently define the structure of an agent for RL training, particularly in terms of specifying the action space. This paper studies learning a co…

Cited by 0SourcePDFScholar
2025

Learning to Reuse Policies in State Evolvable Environments

ICML 2025poster

The policy trained via reinforcement learning (RL) makes decisions based on sensor-derived state features. It is common for state features to evolve for reasons such as periodic sensor maintenance or the addition of new sensors for performance improvement. The deployed policy fails in new state spac…

Cited by 0SourcePDFScholar
2025

Multi-Agent Imitation by Learning and Sampling from Factorized Soft Q-Function

NeurIPS 2025poster

Learning from multi-agent expert demonstrations, known as Multi-Agent Imitation Learning (MAIL), provides a promising approach to sequential decision-making. However, existing MAIL methods including Behavior Cloning (BC) and Adversarial Imitation Learning (AIL) face significant challenges: BC suffer…

Cited by 0SourcecodeScholar
2025

Q-Adapter: Customizing Pre-trained LLMs to New Preferences with Forgetting Mitigation

ICLR 2025poster

Large Language Models (LLMs), trained on a large amount of corpus, have demonstrated remarkable abilities. However, it may not be sufficient to directly apply open-source LLMs like Llama to certain real-world scenarios, since most of them are trained for \emph{general} purposes. Thus, the demands fo…

2024

Continual Multi-Objective Reinforcement Learning via Reward Model Rehearsal

IJCAI 2024poster

Multi-objective reinforcement learning (MORL) approaches address real-world problems with multiple objectives by learning policies maximizing returns weighted by different user preferences. Typical methods assume the objectives remain unchanged throughout the agent's lifetime. However, in some real-…

Cited by 0SourcePDFScholar
2024

Debiased Offline Representation Learning for Fast Online Adaptation in Non-stationary Dynamics

ICML 2024poster

Developing policies that can adapt to non-stationary environments is essential for real-world reinforcement learning applications. Nevertheless, learning such adaptable policies in offline settings, with only a limited set of pre-collected trajectories, presents significant challenges. A key difficu…

2024

Deep Demonstration Tracing: Learning Generalizable Imitator Policy for Runtime Imitation from a Single Demonstration

ICML 2024poster

One-shot imitation learning (OSIL) is to learn an imitator agent that can execute multiple tasks with only a single demonstration. In real-world scenario, the environment is dynamic, e.g., unexpected changes can occur after demonstration. Thus, achieving generalization of the imitator agent is cruci…

2023

Discovering Generalizable Multi-agent Coordination Skills from Multi-task Offline Data

ICLR 2023poster

Cooperative multi-agent reinforcement learning (MARL) faces the challenge of adapting to multiple tasks with varying agents and targets. Previous multi-task MARL approaches require costly interactions to simultaneously learn or fine-tune policies in different tasks. However, the situation that an ag…

Cited by 31SourcePDFScholar
2023

Learning Generalizable Batch Active Learning Strategies via Deep Q-networks (Student Abstract)

AAAI 2023technical

To handle a large amount of unlabeled data, batch active learning (BAL) queries humans for the labels of a batch of the most valuable data points at every round. Most current BAL strategies are based on human-designed heuristics, such as uncertainty sampling or mutual information maximization. Howev…

Cited by 0SourcePDFScholar
2023

Policy Regularization with Dataset Constraint for Offline Reinforcement Learning

ICML 2023poster

We consider the problem of learning the best possible policy from a fixed dataset, known as offline Reinforcement Learning (RL). A common taxonomy of existing offline RL works is policy regularization, which typically constrains the learned policy by distribution or support of the behavior policy. H…