Model-based Trajectory Stitching for Improved Offline Reinforcement Learning

In many real-world applications, collecting large and high-quality datasets may be too costly or impractical. Offline reinforcement learning (RL) aims to infer an optimal decision-making policy from a fixed set of data. Getting the most information from historical data is then vital for good perform...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hepburn, Charles A, Montana, Giovanni
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Hepburn, Charles A
Montana, Giovanni
description In many real-world applications, collecting large and high-quality datasets may be too costly or impractical. Offline reinforcement learning (RL) aims to infer an optimal decision-making policy from a fixed set of data. Getting the most information from historical data is then vital for good performance once the policy is deployed. We propose a model-based data augmentation strategy, Trajectory Stitching (TS), to improve the quality of sub-optimal historical trajectories. TS introduces unseen actions joining previously disconnected states: using a probabilistic notion of state reachability, it effectively `stitches' together parts of the historical demonstrations to generate new, higher quality ones. A stitching event consists of a transition between a pair of observed states through a synthetic and highly probable action. New actions are introduced only when they are expected to be beneficial, according to an estimated state-value function. We show that using this data augmentation strategy jointly with behavioural cloning (BC) leads to improvements over the behaviour-cloned policy from the original dataset. Improving over the BC policy could then be used as a launchpad for online RL through planning and demonstration-guided RL.
doi_str_mv 10.48550/arxiv.2211.11603
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2211_11603</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2211_11603</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-8000abac08b67bf1863018fb31f0fc4f620f85208420fe9ea58dd2c721bc9e3a3</originalsourceid><addsrcrecordid>eNotj8tOwzAQRb1hgQofwAr_QMLYThx3iSoelYIqleyjsTMDRnlUblTRvycUVvdK9-hKR4g7BXnhyhIeMH3HU661UrlSFsy1qN-mjvrM45E62ST8ojBP6Szf5ziHzzh-SJ6S3A6HNJ0WYsfcx5HknuK4DIEGGmdZE6ZxYW_EFWN_pNv_XInm-anZvGb17mW7eawztJXJHACgxwDO28qzctaAcuyNYuBQsNXArtTgiqXQmrB0XadDpZUPazJoVuL-7_ai0x5SHDCd21-t9qJlfgAW7Uhy</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Model-based Trajectory Stitching for Improved Offline Reinforcement Learning</title><source>arXiv.org</source><creator>Hepburn, Charles A ; Montana, Giovanni</creator><creatorcontrib>Hepburn, Charles A ; Montana, Giovanni</creatorcontrib><description>In many real-world applications, collecting large and high-quality datasets may be too costly or impractical. Offline reinforcement learning (RL) aims to infer an optimal decision-making policy from a fixed set of data. Getting the most information from historical data is then vital for good performance once the policy is deployed. We propose a model-based data augmentation strategy, Trajectory Stitching (TS), to improve the quality of sub-optimal historical trajectories. TS introduces unseen actions joining previously disconnected states: using a probabilistic notion of state reachability, it effectively `stitches' together parts of the historical demonstrations to generate new, higher quality ones. A stitching event consists of a transition between a pair of observed states through a synthetic and highly probable action. New actions are introduced only when they are expected to be beneficial, according to an estimated state-value function. We show that using this data augmentation strategy jointly with behavioural cloning (BC) leads to improvements over the behaviour-cloned policy from the original dataset. Improving over the BC policy could then be used as a launchpad for online RL through planning and demonstration-guided RL.</description><identifier>DOI: 10.48550/arxiv.2211.11603</identifier><language>eng</language><subject>Computer Science - Learning ; Statistics - Machine Learning</subject><creationdate>2022-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2211.11603$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2211.11603$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Hepburn, Charles A</creatorcontrib><creatorcontrib>Montana, Giovanni</creatorcontrib><title>Model-based Trajectory Stitching for Improved Offline Reinforcement Learning</title><description>In many real-world applications, collecting large and high-quality datasets may be too costly or impractical. Offline reinforcement learning (RL) aims to infer an optimal decision-making policy from a fixed set of data. Getting the most information from historical data is then vital for good performance once the policy is deployed. We propose a model-based data augmentation strategy, Trajectory Stitching (TS), to improve the quality of sub-optimal historical trajectories. TS introduces unseen actions joining previously disconnected states: using a probabilistic notion of state reachability, it effectively `stitches' together parts of the historical demonstrations to generate new, higher quality ones. A stitching event consists of a transition between a pair of observed states through a synthetic and highly probable action. New actions are introduced only when they are expected to be beneficial, according to an estimated state-value function. We show that using this data augmentation strategy jointly with behavioural cloning (BC) leads to improvements over the behaviour-cloned policy from the original dataset. Improving over the BC policy could then be used as a launchpad for online RL through planning and demonstration-guided RL.</description><subject>Computer Science - Learning</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAQRb1hgQofwAr_QMLYThx3iSoelYIqleyjsTMDRnlUblTRvycUVvdK9-hKR4g7BXnhyhIeMH3HU661UrlSFsy1qN-mjvrM45E62ST8ojBP6Szf5ziHzzh-SJ6S3A6HNJ0WYsfcx5HknuK4DIEGGmdZE6ZxYW_EFWN_pNv_XInm-anZvGb17mW7eawztJXJHACgxwDO28qzctaAcuyNYuBQsNXArtTgiqXQmrB0XadDpZUPazJoVuL-7_ai0x5SHDCd21-t9qJlfgAW7Uhy</recordid><startdate>20221121</startdate><enddate>20221121</enddate><creator>Hepburn, Charles A</creator><creator>Montana, Giovanni</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20221121</creationdate><title>Model-based Trajectory Stitching for Improved Offline Reinforcement Learning</title><author>Hepburn, Charles A ; Montana, Giovanni</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-8000abac08b67bf1863018fb31f0fc4f620f85208420fe9ea58dd2c721bc9e3a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Learning</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Hepburn, Charles A</creatorcontrib><creatorcontrib>Montana, Giovanni</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hepburn, Charles A</au><au>Montana, Giovanni</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Model-based Trajectory Stitching for Improved Offline Reinforcement Learning</atitle><date>2022-11-21</date><risdate>2022</risdate><abstract>In many real-world applications, collecting large and high-quality datasets may be too costly or impractical. Offline reinforcement learning (RL) aims to infer an optimal decision-making policy from a fixed set of data. Getting the most information from historical data is then vital for good performance once the policy is deployed. We propose a model-based data augmentation strategy, Trajectory Stitching (TS), to improve the quality of sub-optimal historical trajectories. TS introduces unseen actions joining previously disconnected states: using a probabilistic notion of state reachability, it effectively `stitches' together parts of the historical demonstrations to generate new, higher quality ones. A stitching event consists of a transition between a pair of observed states through a synthetic and highly probable action. New actions are introduced only when they are expected to be beneficial, according to an estimated state-value function. We show that using this data augmentation strategy jointly with behavioural cloning (BC) leads to improvements over the behaviour-cloned policy from the original dataset. Improving over the BC policy could then be used as a launchpad for online RL through planning and demonstration-guided RL.</abstract><doi>10.48550/arxiv.2211.11603</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2211.11603
ispartof
issn
language eng
recordid cdi_arxiv_primary_2211_11603
source arXiv.org
subjects Computer Science - Learning
Statistics - Machine Learning
title Model-based Trajectory Stitching for Improved Offline Reinforcement Learning
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T20%3A03%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Model-based%20Trajectory%20Stitching%20for%20Improved%20Offline%20Reinforcement%20Learning&rft.au=Hepburn,%20Charles%20A&rft.date=2022-11-21&rft_id=info:doi/10.48550/arxiv.2211.11603&rft_dat=%3Carxiv_GOX%3E2211_11603%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true