A ROS1-to-ROS2 migration benchmark says frontier models pass under 11% of tasks, and half of them only fail at runtime
AspireAI community · arXiv
Robotics software migration is a hard case for code models: inter-node coordination, middleware configuration and lifecycle semantics only show up once the migrated nodes are running and talking to each other. ROSTrans draws 108 scaffolded completion tasks from more than 70 open-source ROS1 repositories, and for each one establishes an executable reference - a verified ROS2 implementation, a runtime test suite that launches the nodes and exercises their topics, services, actions and parameters, and a container for reproducibility. Candidates are scored by injecting only their target files into an otherwise fixed copy of the reference package, so a candidate can neither supply nor weaken its own tests. Six frontier LLMs over five generations per task produced pass@1 below 10.9%, with 56.5% of samples building successfully and then failing at runtime and 32.0% failing runtime assertions, an error class no compile-only oracle can catch; execution-guided repair then reached 49.1% and 47.2% for Claude Opus 4.6 and GPT-5.5 after three rounds. The low pass rates reflect how much of ROS correctness is only observable at runtime, which is the benchmark's main argument.
Read the story and explore more from the AspireAI community.
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.