aspireai.
PUBLIC EDITION

A planner that picks its own engine from the semantics of the task solved more problems than any single specialist planner, and handled 17 PDDL features where no competitor handled more than 8

AspireAI community · arXiv
Each PDDL planner covers a slice of the language - numeric resources, durative actions, time windows, continuous change - so choosing one means inheriting its gaps. Kairos instead profiles each task, picks from five engines, and schedules them under one shared time and memory budget, checking every candidate plan with a validator independent of the planner that produced it. On 1,756 tasks from nine comparative suites it solves more tasks at the full limits than the strongest evaluated planner of each suite, with the largest differences on numeric, temporal, PDDL3 and PDDL+ planning, and it solves the most tasks at both 100 milliseconds and 1 second. A further 450 feature-oriented tasks and 26 single-feature probes show Kairos handling all seventeen features probed, where no other planner evaluated handles more than eight. The validation layer runs at 1.4 ms median per plan against VAL's 3.0 ms. The authors are honest about the weak spot: on classical planning against LAMA the gain is within the noise at 30 seconds, and a trace of every disagreement with VAL ends in a PDDL+ convention or a documented VAL defect. Planner and benchmark are open source.
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.