Jun 1, 2025

Judge using SAE Features

Dhruv Yadav

🏆 3rd place by peer review

The key idea of this project was to explore model judgement using

Sparse Autoencoder (SAE) features for mathematical reasoning

tasks involving addition, multiplication, and subtraction operations.

We compared this performance against basic Chain-of-Thought

(CoT) based judgement using routing algorithms deployed by the

Martian SDK.

Our work addresses the Judge Model Development track by

developing a SAE feature-based routing system that achieves

comparable performance to traditional CoT approaches while

providing enhanced interpretability. We demonstrate that SAE

feature analysis can effectively guide model selection for

mathematical reasoning tasks, with our system showing 91%

routing accuracy compared to 98% for traditional CoT methods.

Critically, our SAE-based approach identified 7% of cases where

both models were inadequate based on feature analysis - insights

invisible to traditional routing methods.

This work advances mechanistic interpretability of routing systems

by providing transparent, feature-level explanations for routing

decisions, enabling users to understand why specific models are

chosen for a sample problem of mathematical operations.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow
Arrow
Arrow

Thank you for your submission. This is an interesting paper with some good results.

As you say SAEs give some insights, but have limitations and are costly. It’s hard to know how much to rely on SAE features being accurate representations of the model’s capability.

I liked this project a lot and think it has substantial potential for further development (I realize the hackathon was short). In particular, this expands on the autointerp methods that already exist to get good judge results.

I'd be interested to see further evolutions of this that use attribution graphs (once transcoders are trained for the relevant models). However, when implementing this one must be careful to ensure that the autointerp results (for the individual SAE features) are of sufficiently high quality. Some are vague and underspecified.

Constructive critique:

Strength:

Problem is well defined: can we route based on activating features in a prompt that is an interpretable approach to routing

The experiments are properly designed and executed on!

Shows that SAE feature matching allows a more diverse routing strategy and also that there are cases where neither models are aligned on the task (Cool insight and it relates to fallback mechanisms in routing that are important to report especially in a product setting where a customer would prefer a warning rather than incorrect answers)

Weakness:

Comparing the SAE feature detection approach to simpler baselines would make this investigation complete: e.g, Train linear probes by extracting hidden activations from a chosen model layer for each math prompt, labeling them with interpretable task types (e.g., addition, subtraction), and fitting a logistic regression classifier to predict these labels for use in routing decisions

Strong assumption but fair for the hackathon: For each input query, they assume that the features it would activate in the small (distilled) model for which Neuronpedia has SAEs available for are representative of the reasoning traits that would be activated in the full model.

SAEs are costly to obtain if they are not already available so including that cost in routing makes it a bad routing decision.

Cite this work

@misc {

title={

(HckPrj) Judge using SAE Features

},

author={

Dhruv Yadav

},

date={

6/1/25

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

View All

View All

Feb 2, 2026

Prototyping an Embedded Off-Switch for AI Compute

This project prototypes an embedded off-switch for AI accelerators. The security block requires periodic cryptographic authorization to operate: the chip generates a nonce, an external authority signs it, and the chip verifies the signature before granting time-limited permission. Without valid authorization, outputs are gated to zero. The design was implemented in HardCaml and validated in simulation.

Read More

Feb 2, 2026

Fingerprinting All AI Cluster I/O Without Mutually Trusted Processors

We design and simulate a "border patrol" device for generating cryptographic evidence of data traffic entering and leaving an AI cluster, while eliminating the specific analog and steganographic side-channels that post-hoc verification can not close. The device eliminates the need for any mutually trusted logic, while still meeting the security needs of the prover and verifier.

Read More

Feb 2, 2026

Modelling the impact of verification in cross-border AI training projects

This paper develops a stylized game-theoretic model of cross-border AI training projects in which multiple states jointly train frontier models while retaining national control over compute resources. We focus on decentralized coordination regimes, where actors publicly pledge compute contributions but privately choose actual delivery, creating incentives to free-ride on a shared public good. To address this, the model introduces explicit verification mechanisms, represented as a continuous monitoring intensity that improves the precision of noisy signals about each actor's true compute contribution. Our findings suggest that policymakers designing international AI governance institutions face a commitment problem: half-measures in verification are counterproductive, and effective regimes require either accepting some free-riding or investing substantially in monitoring infrastructure.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.