aspireai.
PUBLIC EDITION

A 70-game benchmark tests whether AI can discover rules nobody tells it, and the hardest tier still defeats the best agents

AspireAI community · arXiv (cs.AI / cs.LG)
DiG-bench targets discovery - formulating novel generalizations - which almost no AI benchmark probes directly. Each of the 70 games is encoded as a short string with unique transformation rules that must be discovered through interaction and experimentation, and the win conditions for each level are also unknown. Games are provided at seven difficulty tiers: the lowest is routinely solved by multiple models, while the highest challenges the best models running in agentic harnesses. All 70 games were solved by at least one human on first attempt. A subset of 21 games is released publicly and the remainder is held private for secure evaluation. The limitation: because most of the benchmark is private, results cannot be reproduced locally, and discovery inside a game may not transfer to scientific discovery.
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.