Search Results for author:
Found 10 papers, 6 papers with code
DecisionNCE: Embodied Multimodal Representations via Implicit Preference Learning
Multimodal pretraining has emerged as an effective strategy for the trinity of goals of representation learning in autonomous robots: 1) extracting both local and global task progression information; 2) enforcing temporal consistency of visual representation; 3) capturing trajectory-level language grounding.
Safe Offline Reinforcement Learning with Feasibility-Guided Diffusion Model
Interestingly, we discover that via reachability analysis of safe-control theory, the hard safety constraint can be equivalently translated to identifying the largest feasible region given the offline dataset.
A Fully Data-Driven Approach for Realistic Traffic Signal Control Using Offline Reinforcement Learning
Specifically, we combine well-established traffic flow theory with machine learning to construct a reward inference model to infer the reward signals from coarse-grained traffic data.
Query-Policy Misalignment in Preference-Based Reinforcement Learning
To unravel this mystery, we identify a long-neglected issue in the query selection schemes of existing PbRL studies: Query-Policy Misalignment.
PROTO: Iterative Policy Regularized Offline-to-Online Reinforcement Learning
Offline-to-online reinforcement learning (RL), by combining the benefits of offline pretraining and online finetuning, promises enhanced sample efficiency and policy performance.
Offline RL with No OOD Actions: In-Sample Learning via Implicit Value Regularization
This gives a deeper understanding of why the in-sample learning paradigm works, i. e., it applies implicit value regularization to the policy.
Mind the Gap: Offline Policy Optimization for Imperfect Rewards
RGM is formulated as a bi-level optimization problem: the upper layer optimizes a reward correction term that performs visitation distribution matching w. r. t.
A Policy-Guided Imitation Approach for Offline Reinforcement Learning
We decompose the conventional reward-maximizing policy in offline RL into a guide-policy and an execute-policy.
When Data Geometry Meets Deep Function: Generalizing Offline Reinforcement Learning
In offline reinforcement learning (RL), one detrimental issue to policy learning is the error accumulation of deep Q function in out-of-distribution (OOD) areas.
Offline Reinforcement Learning with Soft Behavior Regularization
In this work, we start from the performance difference between the learned policy and the behavior policy, we derive a new policy learning objective that can be used in the offline setting, which corresponds to the advantage function value of the behavior policy, multiplying by a state-marginal density ratio.
