Pith. sign in

REVIEW 2 cited by

Benchmarking Constraint Inference in Inverse Reinforcement Learning

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 2206.09670 v3 pith:AMWIMYAD submitted 2022-06-20 cs.LG

classification cs.LG
keywords icrlconstraintsagentsalgorithmsbenchmarkexpertlearningreinforcement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

When deploying Reinforcement Learning (RL) agents into a physical system, we must ensure that these agents are well aware of the underlying constraints. In many real-world problems, however, the constraints are often hard to specify mathematically and unknown to the RL agents. To tackle these issues, Inverse Constrained Reinforcement Learning (ICRL) empirically estimates constraints from expert demonstrations. As an emerging research topic, ICRL does not have common benchmarks, and previous works tested algorithms under hand-crafted environments with manually-generated expert demonstrations. In this paper, we construct an ICRL benchmark in the context of RL application domains, including robot control, and autonomous driving. For each environment, we design relevant constraints and train expert agents to generate demonstration data. Besides, unlike existing baselines that learn a deterministic constraint, we propose a variational ICRL method to model a posterior distribution of candidate constraints. We conduct extensive experiments on these algorithms under our benchmark and show how they can facilitate studying important research challenges for ICRL. The benchmark, including the instructions for reproducing ICRL algorithms, is available at https://github.com/Guiliang/ICRL-benchmarks-public.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. DRIVE: Dynamic Rule Inference and Verified Evaluation for Constraint-Aware Autonomous Driving

    cs.RO 2025-08 unverdicted novelty 5.0 of 10

    DRIVE uses exponential-family likelihoods to learn soft driving constraints from expert data and injects them into convex optimization, reporting 0.0% constraint violations on inD, highD, and RoundD.

  2. Learning Soft Driving Constraints from Vectorized Scene Embeddings while Imitating Expert Trajectories

    cs.RO 2024-12 conditional novelty 4.0 of 10

    A motion planner that learns soft driving constraints from vectorized scene embeddings improves closed-loop safety and interpretability over a reward-only imitation-learning baseline.

Pith tools