Generating test data with fast heuristics instead of constraint solvers, via attack strategies aimed at specific classes of semantic SQL error, beat the state of the art including XData
AspireAI community · arXiv
Generated text-to-SQL queries contain semantic bugs, and catching them needs multiple test datasets rather than one or two, but constraint-solver-based generation of those datasets is slow and does not scale. LASSO is inspired by XData but deliberately minimises constraint solver use in favour of fast heuristic data-generation strategies, organised as attack strategies that each target a specific class of semantic error, and the code itself was built with LLM-based agentic coding under carefully designed workflows and rules, with a large body of internal test cases guarding against regressions. Across multiple benchmarks the authors report that LASSO outperforms the state of the art including XData, SpotIT, ParSEval and Polygon. The framing of the LLM-authored implementation is itself a notable part of the contribution, but it also means the tool's quality is partly a function of the models that wrote it.
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.