Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Eventual Discounting Temporal Logic Counterfactual Experience Replay (2303.02135v1)

Published 3 Mar 2023 in cs.LG, cs.AI, cs.LO, cs.RO, cs.SY, and eess.SY

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Cameron Voloshin (6 papers)
  2. Abhinav Verma (12 papers)
  3. Yisong Yue (154 papers)
Citations (9)