paper-with-me

홈 › Papers

TOM: Learning Policy-Aware Models for Model-Based Reinforcement Learning via Transition Occupancy Matching

2023-05-22 · Yecheng Jason Ma, Kausik Sivakumar, Jason Yan, Osbert Bastani, Dinesh Jayaraman

Standard model-based reinforcement learning (MBRL) approaches fit a transition model of the environment to all past experience, but this wastes model capacity on data that is irrelevant for policy improvement. We instead propose a new "transition occupancy matching" (TOM) objective for MBRL model learning: a model is good to the extent that the current policy experiences the same distribution of transitions inside the model as in the real environment. We derive TOM directly from a novel lower bound on the standard reinforcement learning objective. To optimize TOM, we show how to reduce it to a form of importance weighted maximum-likelihood estimation, where the automatically computed importance weights identify policy-relevant past experiences from a replay buffer, enabling stable optimization. TOM thus offers a plug-and-play model learning sub-routine that is compatible with any backbone MBRL algorithm. On various Mujoco continuous robotic control tasks, we show that TOM successfully focuses model learning on policy-relevant experience and drives policies faster to higher task rewards than alternative model learning approaches.

📄 PDF Abstract BibTeX arXiv:2305.12663

Code (0)

등록된 구현이 없습니다.

Tasks

Model-based Reinforcement LearningMuJoCoreinforcement-learningReinforcement Learning

Similar Papers 제목 키워드 기반

OMPO: A Unified Framework for RL under Policy and Dynamics Shifts

2024-05-29 · Yu Luo, Tianying Ji, Fuchun Sun, Jianwei Zhang 외

Training reinforcement learning policies using environment interaction data collected from varying policies or dynamics presents a fundamental challenge. Existing works often overlook the distribution discrepancies induc…

Domain AdaptationOpenAI Gym

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs

2024-11-05 · Long-Fei Li, Peng Zhao, Zhi-Hua Zhou

We study episodic linear mixture MDPs with the unknown transition and adversarial rewards under full-information feedback, employing dynamic regret as the performance measure. We start with in-depth analyses of the stren…

global-optimization

Non-Markovian policies occupancy measures

2022-05-27 · Romain Laroche, Remi Tachet des Combes, Jacob Buckman

A central object of study in Reinforcement Learning (RL) is the Markovian policy, in which an agent's actions are chosen from a memoryless probability distribution, conditioned only on its current state. The family of Ma…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Strictly Batch Imitation Learning by Energy-based Distribution Matching

2020-06-25 · NeurIPS 2020 12 · Daniel Jarrett, Ioana Bica, Mihaela van der Schaar

Consider learning a policy purely on the basis of demonstrated behavior -- that is, with no access to reinforcement signals, no knowledge of transition dynamics, and no further interaction with the environment. This *str…

Imitation LearningOff-policy evaluation

Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs

2023-05-15 · Kaixuan Ji, Qingyue Zhao, Jiafan He, Weitong Zhang 외

Recent studies have shown that episodic reinforcement learning (RL) is no harder than bandits when the total reward is bounded by $1$, and proved regret bounds that have a polylogarithmic dependence on the planning horiz…

Open-Ended Question Answeringreinforcement-learningReinforcement LearningReinforcement Learning (RL)