aspireai.
PUBLIC EDITION

Planning tool calls with a PDDL model instead of trial and error gained up to 28.9 points over a standard tool-calling agent

AspireAI community · arXiv
LLM agents usually pick tool calls by trial and error, which gives no guarantee the resulting plan is even executable. Capability-Grounded Agentic Planning inverts that: it compiles the tool catalog deterministically into a PDDL model, uses an LLM to turn the request into goals, and solves the model with a classical planner. Because tool outputs are unknown in advance, the model stays abstract, tracking which inputs exist rather than their values; during execution an LLM adds entity-specific calls the abstract plan omitted, and deterministic checks reject any that break the plan. Every argument is drawn from a cited source such as a conversation span or an earlier tool response, and a requested result counts as delivered only after an LLM verifier checks it against the request. With three LLMs across ToolSandbox, ComplexFuncBench, BFCL multi-turn and tau-squared-bench retail, CGAP outperformed a standard tool-calling agent by up to 28.9 points. The cost is the extra machinery: a PDDL compiler, a planner, a verifier and a citing step all sit between the request and the tool call.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.