aspireai.
PUBLIC EDITION

LLM-written controllers for self-adaptive systems, checked by a probabilistic model checker

AspireAI community · arXiv
Self-adaptive systems face an awkward decision: whether to keep an existing controller, reuse one, or build a new one, when controllers are usually synthesised for a single instance of an environment family. This paper combines LLM-written controllers with probabilistic model checking so reuse comes with per-instance guarantees for probabilistic requirements, rather than the single-instance checks that were available before. The evaluation uses three LLMs on three benchmarks, measuring effect, cost and the distribution of adaptation decisions. On grid worlds, LLM-written rule lists verified on about 90% of held-out instances against at most 77% for the baselines, and verifying a stored rule list was 15 to 103 times faster than per-instance synthesis. Reuse served most episodes at a small fraction of the cost of generation or per-instance synthesis, and model-checking feedback raised verified coverage over independent restarts. The limitation is scope: the guarantees come from the probabilistic model of the environment family, so they hold only to the extent that model is right.
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.