Pith. sign in

REVIEW 1 cited by

Tight Performance Guarantees of Imitator Policies with Continuous Actions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.03922 v1 pith:IRFLYPNI submitted 2022-12-07 cs.LG

classification cs.LG
keywords performancecontinuousactionsguaranteesimitatornoisepolicypractice
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Robust Behavior Cloning Via Global Lipschitz Regularization

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Imposing a global Lipschitz constraint on a behavior cloning policy provides a provable upper bound on worst-case reward loss under bounded state perturbations.

Pith tools