Saved in:
| Main Authors: | Aichmüller, Michael, Ståhlberg, Simon, Funkquist, Martin, Geffner, Hector |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.18674 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning to Ground Existentially Quantified Goals
by: Funkquist, Martin, et al.
Published: (2024)
by: Funkquist, Martin, et al.
Published: (2024)
Sketch Decompositions for Classical Planning via Deep Reinforcement Learning
by: Aichmüller, Michael, et al.
Published: (2024)
by: Aichmüller, Michael, et al.
Published: (2024)
Learning More Expressive General Policies for Classical Planning Domains
by: Ståhlberg, Simon, et al.
Published: (2024)
by: Ståhlberg, Simon, et al.
Published: (2024)
Learning to Search and Searching to Learn for Generalization in Planning
by: Aichmüller, Michael, et al.
Published: (2026)
by: Aichmüller, Michael, et al.
Published: (2026)
Learning General Policies with Policy Gradient Methods
by: Ståhlberg, Simon, et al.
Published: (2025)
by: Ståhlberg, Simon, et al.
Published: (2025)
Symmetries and Expressive Requirements for Learning General Policies
by: Drexler, Dominik, et al.
Published: (2024)
by: Drexler, Dominik, et al.
Published: (2024)
First-Order Representation Languages for Goal-Conditioned RL
by: Ståhlberg, Simon, et al.
Published: (2025)
by: Ståhlberg, Simon, et al.
Published: (2025)
Learning Generalized Policies for Fully Observable Non-Deterministic Planning Domains
by: Hofmann, Till, et al.
Published: (2024)
by: Hofmann, Till, et al.
Published: (2024)
Learning General Policies From Examples
by: Bonet, Blai, et al.
Published: (2025)
by: Bonet, Blai, et al.
Published: (2025)
Differentiable Learning of Lifted Action Schemas for Classical Planning
by: Reiter, Jonas, et al.
Published: (2026)
by: Reiter, Jonas, et al.
Published: (2026)
On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies
by: Bonet, Blai, et al.
Published: (2024)
by: Bonet, Blai, et al.
Published: (2024)
Learning Lifted STRIPS Models from Action Traces Alone: A Simple, General, and Scalable Solution
by: Gösgens, Jonas, et al.
Published: (2024)
by: Gösgens, Jonas, et al.
Published: (2024)
Learning Lifted Action Models From Traces of Incomplete Actions and States
by: Jansen, Niklas, et al.
Published: (2025)
by: Jansen, Niklas, et al.
Published: (2025)
Learning Lifted Action Models from Traces with Minimal Information About Actions and States
by: Gösgens, Jonas, et al.
Published: (2026)
by: Gösgens, Jonas, et al.
Published: (2026)
Policy Mirror Descent with Lookahead
by: Protopapas, Kimon, et al.
Published: (2024)
by: Protopapas, Kimon, et al.
Published: (2024)
POrTAL: Plan-Orchestrated Tree Assembly for Lookahead
by: Conway, Evan, et al.
Published: (2025)
by: Conway, Evan, et al.
Published: (2025)
Imagine-then-Plan: Agent Learning from Adaptive Lookahead with World Models
by: Liu, Youwei, et al.
Published: (2026)
by: Liu, Youwei, et al.
Published: (2026)
Encoding Reusable Multi-Robot Planning Strategies as Abstract Hypergraphs
by: Elimelech, Khen, et al.
Published: (2024)
by: Elimelech, Khen, et al.
Published: (2024)
Learning with Foresight: Enhancing Neural Routing Policy via Multi-Node Lookahead Prediction
by: Jiang, Xia, et al.
Published: (2026)
by: Jiang, Xia, et al.
Published: (2026)
Policy Gradient with Tree Search: Avoiding Local Optimas through Lookahead
by: Koren, Uri, et al.
Published: (2025)
by: Koren, Uri, et al.
Published: (2025)
Lookahead Counterfactual Fairness
by: Zuo, Zhiqun, et al.
Published: (2024)
by: Zuo, Zhiqun, et al.
Published: (2024)
From Next Token Prediction to (STRIPS) World Models
by: Núñez-Molina, Carlos, et al.
Published: (2025)
by: Núñez-Molina, Carlos, et al.
Published: (2025)
Constrained Decoding with Speculative Lookaheads
by: Nakshatri, Nishanth, et al.
Published: (2024)
by: Nakshatri, Nishanth, et al.
Published: (2024)
ProAct: Agentic Lookahead in Interactive Environments
by: Yu, Yangbin, et al.
Published: (2026)
by: Yu, Yangbin, et al.
Published: (2026)
Learning and Reusing Policy Decompositions for Hierarchical Generalized Planning with LLM Agents
by: Sohrabi, Shirin, et al.
Published: (2026)
by: Sohrabi, Shirin, et al.
Published: (2026)
Lookahead Drifting Model
by: Zhang, Guoqiang, et al.
Published: (2026)
by: Zhang, Guoqiang, et al.
Published: (2026)
Pseudo-Boolean Proof Logging for Optimal Classical Planning
by: Dold, Simon, et al.
Published: (2025)
by: Dold, Simon, et al.
Published: (2025)
Lookahead Pathology in Monte-Carlo Tree Search
by: Nguyen, Khoi P. N., et al.
Published: (2022)
by: Nguyen, Khoi P. N., et al.
Published: (2022)
LLM-Evolved Pattern Generators for Optimal Classical Planning
by: Phung, Windy, et al.
Published: (2026)
by: Phung, Windy, et al.
Published: (2026)
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning
by: Bettker, R. V., et al.
Published: (2022)
by: Bettker, R. V., et al.
Published: (2022)
Predicting Compact Phrasal Rewrites with Large Language Models for ASR Post Editing
by: Zhang, Hao, et al.
Published: (2025)
by: Zhang, Hao, et al.
Published: (2025)
LookaheadKV: Fast and Accurate KV Cache Eviction by Glimpsing into the Future without Generation
by: Ahn, Jinwoo, et al.
Published: (2026)
by: Ahn, Jinwoo, et al.
Published: (2026)
Dynamic-Width Speculative Beam Decoding for Efficient LLM Inference
by: Qin, Zongyue, et al.
Published: (2024)
by: Qin, Zongyue, et al.
Published: (2024)
Learning to Plan Before Answering: Self-Teaching LLMs to Learn Abstract Plans for Problem Solving
by: Zhang, Jin, et al.
Published: (2025)
by: Zhang, Jin, et al.
Published: (2025)
OledFL: Unleashing the Potential of Decentralized Federated Learning via Opposite Lookahead Enhancement
by: Li, Qinglun, et al.
Published: (2024)
by: Li, Qinglun, et al.
Published: (2024)
Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracy
by: Zhao, Yao, et al.
Published: (2023)
by: Zhao, Yao, et al.
Published: (2023)
Learning Abstract World Model for Value-preserving Planning with Options
by: Rodriguez-Sanchez, Rafael, et al.
Published: (2024)
by: Rodriguez-Sanchez, Rafael, et al.
Published: (2024)
On the Diminishing Returns of Width for Continual Learning
by: Guha, Etash, et al.
Published: (2024)
by: Guha, Etash, et al.
Published: (2024)
Lookahead Unmasking Elicits Accurate Decoding in Diffusion Language Models
by: Lee, Sanghyun, et al.
Published: (2025)
by: Lee, Sanghyun, et al.
Published: (2025)
A Note On Lookahead In Real Life And Computing
by: Sharma, Burle, et al.
Published: (2024)
by: Sharma, Burle, et al.
Published: (2024)
Similar Items
-
Learning to Ground Existentially Quantified Goals
by: Funkquist, Martin, et al.
Published: (2024) -
Sketch Decompositions for Classical Planning via Deep Reinforcement Learning
by: Aichmüller, Michael, et al.
Published: (2024) -
Learning More Expressive General Policies for Classical Planning Domains
by: Ståhlberg, Simon, et al.
Published: (2024) -
Learning to Search and Searching to Learn for Generalization in Planning
by: Aichmüller, Michael, et al.
Published: (2026) -
Learning General Policies with Policy Gradient Methods
by: Ståhlberg, Simon, et al.
Published: (2025)