Pith. sign in

REVIEW 1 cited by

Eventual Discounting Temporal Logic Counterfactual Experience Replay

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 2303.02135 v1 pith:LAXPVFJX submitted 2023-03-03 cs.LG cs.AIcs.LOcs.ROcs.SYeess.SY

classification cs.LGcs.AIcs.LOcs.ROcs.SYeess.SY
keywords counterfactualexperiencereplaydevelopdiscountingeventualfindlogic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Linear temporal logic (LTL) offers a simplified way of specifying tasks for policy optimization that may otherwise be difficult to describe with scalar reward functions. However, the standard RL framework can be too myopic to find maximally LTL satisfying policies. This paper makes two contributions. First, we develop a new value-function based proxy, using a technique we call eventual discounting, under which one can find policies that satisfy the LTL specification with highest achievable probability. Second, we develop a new experience replay method for generating off-policy data from on-policy rollouts via counterfactual reasoning on different ways of satisfying the LTL specification. Our experiments, conducted in both discrete and continuous state-action spaces, confirm the effectiveness of our counterfactual experience replay approach.

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. Automata-Conditioned Cooperative Multi-Agent Reinforcement Learning

    cs.MA 2025-11 conditional novelty 6.0 of 10

    ACC-MARL trains decentralized multi-agent policies that solve many automaton-specified cooperative tasks at once, with a proof of optimality for the Markovian reformulation and value-based task assignment.

Pith tools