arXiv AI By Dominik Drexler, Simon St{\aa}hlberg, Markus Fritzsche, Blai Bonet

Learning How to Search for Plans with Exponentially Less Space

Read the original on arXiv AI →

The paper introduces a method for learning search control policies that dramatically reduce the space required for heuristic plan search. By using an indexical policy with registers and a special choose rule, the approach ensures that every execution is bounded polynomially in the number of objects, allowing a depth‑first procedure to find plans in polynomial space. The learned policies, obtained via a language‑model guided counterexample loop, successfully solve 1,709 of 1,890 IPC 2023 Learning Track tasks and the Autoscale Agile suite, outperforming state‑of‑the‑art planners such as LAMA, BFWS, and Levitron.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 30

Neuro-Symbolic Computer Use: Learning Reusable Policies for Reliable and Efficient Execution

The paper introduces neuro‑symbolic computer use, a method that learns reusable policies to execute recurring computer workflows efficiently. Instead of re‑planning each run, the learned policy encodes stable decisions (ordering, variables, loops, branches) into executable code while delegating observation‑dependent decisions to neural models. Using neuro‑symbolic policy iteration, the approach iteratively refines the policy from a single agent trajectory, diagnoses failures, and revises the code with a coding model, achieving superior Pass^3 scores and significant reductions in per‑run cost and latency on OSWorld‑Verified and ScienceBoard benchmarks.

By Hyewon Suh, Thanh Minh Nguyen, Chih-Lun Lee, Darrow Hartman, Lizhao Liu, Xin Eric Wang, Ang Li, Jiachen Yang
arXiv AI
Oct 27

GADAR: Generalizing Across Domains via Action Ranking for Classical Planning

GADAR (Generalizing Across Domains via Action Ranking) is a learned policy for classical planning that accepts a domain description as input and constructs grounded actions in unseen domains without search. It uses a three‑layer architecture—lifted domain, binding, and chain layers—to embed domain structure, tie action applicability to lifted preconditions, and capture schema dependencies. In zero‑shot experiments across eight benchmark domains, a single GADAR model trained on seven domains solves 58.3% of test instances, matching closely the performance of domain‑specific models and outperforming random choice and a representation lacking the chain layer.

By Rajesh Mangannavar, Pranay Dugar, Prasad Tadepalli
arXiv Machine Learning
Jul 16

Where Should RL Post-Training Compute Go? Model Size, Search, Learning, and Feedback

arXiv:2607. 13389v1 Announce Type: new Abstract: Reinforcement Learning (RL) post-training is increasingly used to adapt foundation models for reasoning, planning, and feedback-driven robot-learning pipelines, but constrained post-training resources are often summarized by a single total FLOP budget.

By Patrick Wilhelm, Odej Kao
arXiv Machine Learning
Jul 31

LM-GRASP: Instance-Specific Language Models for Combinatorial Construction via Online Imitation Learning

arXiv:2607. 28135v1 Announce Type: new Abstract: Machine learning for combinatorial optimization typically relies on neural constructors trained via reinforcement learning on large offline datasets for a fixed problem class-incurring high pretraining costs and generalizing poorly outside the training distribution.

By Mohand Mezmaz, Gr\'egoire Danoy