aspireai.
PUBLIC EDITION

Fine-tuning then GRPO on code skeletons cut building-code compliance error by up to 21.3 percent in tree edits and 41.0 percent in token edits, with fewer false positives

AspireAI community · arXiv
LLM approaches to automated code compliance for building regulations are prone to generating incorrect and hallucinated machine-processable rules, which is a costly failure mode when the output is meant to be fed to downstream tooling. This paper introduces a two-stage framework that first uses supervised fine-tuning to instill domain knowledge, then applies Group Relative Policy Optimization to improve the accuracy of the generated intermediate representation, which is a high-level code skeleton rather than final rules. The framework achieved final reductions of up to 21.3 percent in tree edit distance and 41.0 percent in token-level Levenshtein distance against the SFT baselines, and in a zero-shot setting it outperformed leading LLMs on both code structure and semantics when those were evaluated with few-shot prompting, with the GRPO stage also producing a statistically significant reduction in false positives. The limitation is domain transfer: the gains are measured against building regulations, and it is not shown that the same recipe transfers to other compliance domains with different rule structure.
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.