Tight Performance Guarantees of Imitator Policies with Continuous Actions

Behavioral Cloning (BC) aims at learning a policy that mimics the behavior demonstrated by an expert. The current theoretical understanding of BC is limited to the case of finite actions. In this paper, we study BC with the goal of providing theoretical guarantees on the performance of the imitator...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Maran, Davide, Metelli, Alberto Maria, Restelli, Marcello
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 Maran, Davide
Metelli, Alberto Maria
Restelli, Marcello
description Behavioral Cloning (BC) aims at learning a policy that mimics the behavior demonstrated by an expert. The current theoretical understanding of BC is limited to the case of finite actions. In this paper, we study BC with the goal of providing theoretical guarantees on the performance of the imitator policy in the case of continuous actions. We start by deriving a novel bound on the performance gap based on Wasserstein distance, applicable for continuous-action experts, holding under the assumption that the value function is Lipschitz continuous. Since this latter condition is hardy fulfilled in practice, even for Lipschitz Markov Decision Processes and policies, we propose a relaxed setting, proving that value function is always Holder continuous. This result is of independent interest and allows obtaining in BC a general bound for the performance of the imitator policy. Finally, we analyze noise injection, a common practice in which the expert action is executed in the environment after the application of a noise kernel. We show that this practice allows deriving stronger performance guarantees, at the price of a bias due to the noise addition.
doi_str_mv 10.48550/arxiv.2212.03922
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2212_03922</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2212_03922</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-4075f5fbdd64b90d4c113c97bafb917f67e376085ddd1fdd3750ee28adb2cbfd3</originalsourceid><addsrcrecordid>eNotz71OwzAYhWEvHVDLBTDhG0jwTxwnYxVBiVSJDtmjz_5saqmJkePwc_dAYTrSOxzpIeSOs7JqlGIPkD7DeykEFyWTrRA3pB_C6znTk0s-pglm6-hhhQRzdm6h0dN-ChlyTPQUL8GGn_gR8pl2cc5hXuO60L3NIc7Ljmw8XBZ3-79bMjw9Dt1zcXw59N3-WECtRVExrbzyBrGuTMuwspxL22oD3rRc-1o7qWvWKETkHlFqxZwTDaAR1niUW3L_d3u1jG8pTJC-xl_TeDXJb2ZLSH8</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Tight Performance Guarantees of Imitator Policies with Continuous Actions</title><source>arXiv.org</source><creator>Maran, Davide ; Metelli, Alberto Maria ; Restelli, Marcello</creator><creatorcontrib>Maran, Davide ; Metelli, Alberto Maria ; Restelli, Marcello</creatorcontrib><description>Behavioral Cloning (BC) aims at learning a policy that mimics the behavior demonstrated by an expert. The current theoretical understanding of BC is limited to the case of finite actions. In this paper, we study BC with the goal of providing theoretical guarantees on the performance of the imitator policy in the case of continuous actions. We start by deriving a novel bound on the performance gap based on Wasserstein distance, applicable for continuous-action experts, holding under the assumption that the value function is Lipschitz continuous. Since this latter condition is hardy fulfilled in practice, even for Lipschitz Markov Decision Processes and policies, we propose a relaxed setting, proving that value function is always Holder continuous. This result is of independent interest and allows obtaining in BC a general bound for the performance of the imitator policy. Finally, we analyze noise injection, a common practice in which the expert action is executed in the environment after the application of a noise kernel. We show that this practice allows deriving stronger performance guarantees, at the price of a bias due to the noise addition.</description><identifier>DOI: 10.48550/arxiv.2212.03922</identifier><language>eng</language><subject>Computer Science - Learning</subject><creationdate>2022-12</creationdate><rights>http://creativecommons.org/licenses/by/4.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,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2212.03922$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2212.03922$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Maran, Davide</creatorcontrib><creatorcontrib>Metelli, Alberto Maria</creatorcontrib><creatorcontrib>Restelli, Marcello</creatorcontrib><title>Tight Performance Guarantees of Imitator Policies with Continuous Actions</title><description>Behavioral Cloning (BC) aims at learning a policy that mimics the behavior demonstrated by an expert. The current theoretical understanding of BC is limited to the case of finite actions. In this paper, we study BC with the goal of providing theoretical guarantees on the performance of the imitator policy in the case of continuous actions. We start by deriving a novel bound on the performance gap based on Wasserstein distance, applicable for continuous-action experts, holding under the assumption that the value function is Lipschitz continuous. Since this latter condition is hardy fulfilled in practice, even for Lipschitz Markov Decision Processes and policies, we propose a relaxed setting, proving that value function is always Holder continuous. This result is of independent interest and allows obtaining in BC a general bound for the performance of the imitator policy. Finally, we analyze noise injection, a common practice in which the expert action is executed in the environment after the application of a noise kernel. We show that this practice allows deriving stronger performance guarantees, at the price of a bias due to the noise addition.</description><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAYhWEvHVDLBTDhG0jwTxwnYxVBiVSJDtmjz_5saqmJkePwc_dAYTrSOxzpIeSOs7JqlGIPkD7DeykEFyWTrRA3pB_C6znTk0s-pglm6-hhhQRzdm6h0dN-ChlyTPQUL8GGn_gR8pl2cc5hXuO60L3NIc7Ljmw8XBZ3-79bMjw9Dt1zcXw59N3-WECtRVExrbzyBrGuTMuwspxL22oD3rRc-1o7qWvWKETkHlFqxZwTDaAR1niUW3L_d3u1jG8pTJC-xl_TeDXJb2ZLSH8</recordid><startdate>20221207</startdate><enddate>20221207</enddate><creator>Maran, Davide</creator><creator>Metelli, Alberto Maria</creator><creator>Restelli, Marcello</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20221207</creationdate><title>Tight Performance Guarantees of Imitator Policies with Continuous Actions</title><author>Maran, Davide ; Metelli, Alberto Maria ; Restelli, Marcello</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-4075f5fbdd64b90d4c113c97bafb917f67e376085ddd1fdd3750ee28adb2cbfd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Maran, Davide</creatorcontrib><creatorcontrib>Metelli, Alberto Maria</creatorcontrib><creatorcontrib>Restelli, Marcello</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Maran, Davide</au><au>Metelli, Alberto Maria</au><au>Restelli, Marcello</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Tight Performance Guarantees of Imitator Policies with Continuous Actions</atitle><date>2022-12-07</date><risdate>2022</risdate><abstract>Behavioral Cloning (BC) aims at learning a policy that mimics the behavior demonstrated by an expert. The current theoretical understanding of BC is limited to the case of finite actions. In this paper, we study BC with the goal of providing theoretical guarantees on the performance of the imitator policy in the case of continuous actions. We start by deriving a novel bound on the performance gap based on Wasserstein distance, applicable for continuous-action experts, holding under the assumption that the value function is Lipschitz continuous. Since this latter condition is hardy fulfilled in practice, even for Lipschitz Markov Decision Processes and policies, we propose a relaxed setting, proving that value function is always Holder continuous. This result is of independent interest and allows obtaining in BC a general bound for the performance of the imitator policy. Finally, we analyze noise injection, a common practice in which the expert action is executed in the environment after the application of a noise kernel. We show that this practice allows deriving stronger performance guarantees, at the price of a bias due to the noise addition.</abstract><doi>10.48550/arxiv.2212.03922</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2212.03922
ispartof
issn
language eng
recordid cdi_arxiv_primary_2212_03922
source arXiv.org
subjects Computer Science - Learning
title Tight Performance Guarantees of Imitator Policies with Continuous Actions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T12%3A26%3A30IST&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=Tight%20Performance%20Guarantees%20of%20Imitator%20Policies%20with%20Continuous%20Actions&rft.au=Maran,%20Davide&rft.date=2022-12-07&rft_id=info:doi/10.48550/arxiv.2212.03922&rft_dat=%3Carxiv_GOX%3E2212_03922%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