Pith. sign in

REVIEW 1 cited by

Toward Computationally Efficient Inverse Reinforcement Learning via Reward Shaping

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 2312.09983 v2 pith:MU6G4R27 submitted 2023-12-15 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords computationallylearningreinforcementefficientinverserewardshapingwork
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Inverse reinforcement learning (IRL) is computationally challenging, with common approaches requiring the solution of multiple reinforcement learning (RL) sub-problems. This work motivates the use of potential-based reward shaping to reduce the computational burden of each RL sub-problem. This work serves as a proof-of-concept and we hope will inspire future developments towards computationally efficient IRL.

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. Bootstrapped Reward Shaping

    cs.LG 2025-01 conditional novelty 6.0 of 10

    Using the agent's current value estimate as a potential-based shaping function converges in tabular RL and accelerates DQN on Atari.

Pith tools