Research map / Reinforcement learning / Policy gradient and actor-critic
Policy Optimization with Linear Temporal Logic Constraints
Cameron Voloshin, Hoang Minh Le, Swarat Chaudhuri, Yisong Yue
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use LCP instead of LCRL or shaped LCRL | Pacman · Pacman | probability of satisfying the LTL specification | Improved |
| Use LCP instead of standard LCRL | Discretized Mountain Car · Discretized Mountain Car | probability of satisfying the LTL specification | Improved |
| Use shaped LCRL instead of standard LCRL | Discretized Mountain Car · Discretized Mountain Car | probability of satisfying the LTL specification | Improved |
| Use LCP instead of standard LCRL | Pacman · Pacman | probability of satisfying the LTL specification | Improved |
| Run LCP with 11 samples per state-action pair rather than the theoretical guarantee of approximately 350 | LCP · Pacman | samples per (s,a) pair to find a good policy: ≈350 -> 11 | Improved |
Closest papers by meaning
- DeepLTL: Learning to Efficiently Satisfy Complex LTL Specifications for Multi-Task RL (ICLR 2025 · similarity 0.88)
- TGPO: Temporal Grounded Policy Optimization for Signal Temporal Logic Tasks (NeurIPS 2026 · similarity 0.87)
- Reinforcement Learning with LTL and $\omega$-Regular Objectives via Optimality-Preserving Translation to Average Rewards (NeurIPS 2024 · similarity 0.87)
- One Subgoal at a Time: Zero-Shot Generalization to Arbitrary Linear Temporal Logic Requirements in Multi-Task Reinforcement Learning (NeurIPS 2025 · similarity 0.87)
- Regret-Free Reinforcement Learning for Temporal Logic Specifications (ICML 2025 · similarity 0.86)
- Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time (NeurIPS 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
