- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper uses downstream-gradient coverage to learn sparse features hierarchically. It evaluates recovery of planted compositional variables in a synthetic model and part-to-object relationships in DINO 3. Main idea is that meaningful features have strong correlation with downstream gradients direction.
Critical strengths
- Elegant and well-motivated objective. I find the proposed loss elegant and intuitive, the backward training procedure makes sense.
- Supporting evidence and various tests: I appreciate the fact that the synthetic experiments include several baselines, supervised controls, and tests that remove gradient pressure during training. The DINO experiments include interventions across 668 linked feature pairs, supporting the functional relevance of the discovered connections.
Critical weaknesses
- The advantage over the closest methods remains unclear. Jacobian SAEs and gradient SAEs already incorporate downstream computation into dictionary learning. While both are mentioned, neither is compared. The authors chose not to use the benchmarks used by prior works and not to adapt prior works to their benchmarks. The overall idea is therefore not justified, because it might be that the existing similar approaches work as well or better. I am very open to raising my rating if comparisons done fairly establish a useful advantage.
- Minor: The synthetic experiments do not isolate the core coverage loss. The toy objective combines coverage with several additional gradient terms, and the removal experiment disables them together. A coverage-only ablation would clarify how much of the feature-recovery improvement comes from the central proposed mechanism. The DINOv3 experiment does use coverage alone, but this does not resolve its contribution to recovery in the synthetic benchmark.
Post rebuttal: My main concerns have been resolved and score is raised to 3.
Questions for authors
- See weakness 1: Other than the actual comparison which is needed, is there a structural advantage in this method over the other two?
4 comments
Response to Reviewer MhKp (2/2)
“A coverage-only ablation would clarify how much of the feature-recovery improvement comes from the central proposed mechanism.”
Fair point. To address this, we retrained the entire backchained sequence with the four auxiliary Jacobian terms removed, keeping the local coverage term (Equation 7) as the only Jacobian pressure. This is the pressure we emphasize in the main text and use in the scaled-up vision experiments. This simpler recipe retained much of the identifiability gains, with Hungarian F1 scores of 0.685, 0.542, and 0.562 at blocks 2, 3 and 4, compared with 0.509, 0.324, and 0.239 for the reconstruction-only control. In these runs, we used the same local coverage and reconstruction weights across all blocks and applied coverage to both the encoder and decoder directions at every block.
We also tested whether the improvement depended on the local coverage weight by training new backchained featurizers with weights of 5, 15, and 50 and found no major difference in the F1 scores (Hungarian F1 varied by at most 0.017 at any block). These results show that substantial feature-recovery gains can be obtained in this synthetic testbed with local coverage. We will include these ablation results and clarify the role of the auxiliary terms in the revised paper, which was to assess the most optimal recovery in this setup over a broad sweep (the same paradigm that we used for all the featurizers) for a fair comparison.
Thank you for the substantial additional experiments! The new comparisons and coverage-only ablation resolve my main concerns, and the gate-intervention tests further strengthen the paper. I am raising my rating to 3.
Could you also clarify the baselines’ dictionary sizes, sparsity settings and tuning budgets, whether results cover multiple seeds, and whether hyperparams selection and final evaluation used separate data?
Response to Reviewer MhKp
Thank you for your engagement and positive re-evaluation. We really appreciated the time you took to review our work, and we genuinely believe it helped make the paper stronger! We clarify your comments below.
"...the baselines' dictionary sizes, sparsity settings..."
These are given in Table 2 (Appendix B.2). Every baseline has twice as many latents as ground-truth features, which makes the dictionaries overcomplete relative to the 128-dimensional transformer state (expansion factors of 2× to 16× from block 2 to block 5). The sparsity setting is 1.5 times the mean number of active ground-truth features: TopK, BatchTopK, the archetypal SAE and the transcoder use it as their activity budget, matching pursuit uses it as its number of pursuit steps, and JumpReLU learns its thresholds instead. The four additional featurizers in our response (CLT, end-to-end SAE, gradient SAE and Jacobian SAE) use the same widths and budgets as the TopK baseline. The sizes and sparsity of the Jacobian coverage dictionaries and the matched reconstruction-only dictionaries are specified in Table 4 (Appendix C.5).
"...and tuning budgets"
For the baselines, we swept the dictionary width and the sparsity, with up to 15 configurations per method. Figures 12 and 13 show these sweeps, and Figure 14 shows the best configuration of each method at each block (all in Appendix B.4). Even at their best configuration within these sweeps, the baselines reach a Hungarian F1 lower than the Jacobian coverage featurizer at every block. For the four additional function-aware featurizers we kept the widths and budgets of Table 2 (Appendix B.2) and swept the one coefficient that is specific to each method, reporting its best value at each block. For our Jacobian coverage featurizer, the hyperparameters in Table 3 (Appendix C.4) were selected with broader sweeps spanning ranges for all Jacobian terms; nonetheless, the ablation analysis in our previous response shows that most of the gain in identifiability comes from the local jacobian coverage term.
"...whether results cover multiple seeds..."
To address this, we trained the Jacobian coverage and the reconstruction-only featurizers with five new seeds, keeping every setting of the paper the same (the tables in the paper report single runs). Because the Jacobian featurizer is backchained, each seed is a complete new sequence of block 4, block 3 and block 2 featurizers. Across the five seeds the variation is very small: the standard deviation of Hungarian F1 is at most 0.016 for the Jacobian coverage featurizer and at most 0.009 for the reconstruction-only featurizer, at every block. Across all seeds, the Jacobian coverage featurizer beats the reconstruction-only control on identifiability by a wide margin at every block.
"...whether hyperparams selection and final evaluation used separate data?"
All metrics in the paper were computed on 10,000 held-out inputs, generated independently of the training data. We used these inputs to select configurations by Hungarian F1, following the same rule for all the featurizers (Appendices B.4 and C.1). To test whether the final results hold on data that played no part in selection, we generated five fresh sets of 10,000 inputs and scored all featurizers again on each of these sets. Hungarian F1 changed by less than 0.003 in any cell.
Thank you again for these questions.
Response to Reviewer MhKp (1/2)
Thank you for the thoughtful review and the constructive suggestions. We appreciate your positive assessment of the objective and for acknowledging “proposed loss is elegant and intuitive”. Your comments highlighted two important additions: comparisons with the closest function-aware methods and an ablation of the local coverage loss. We have now carried out both experiments and address them below.
We agree that these comparisons were missing. We have extended the comparison to four additional featurizer families: Cross-Layer Transcoders (Ameisen et al., 2025), End-to-end SAEs (Braun et al., 2024), Gradient SAEs (Olmo et al., 2025), and Jacobian SAEs (Farnik et al., 2025). We adapted these methods to our synthetic testbed, where the known intermediate features allow us to measure one-to-one recovery directly. All featurizers are evaluated on the same frozen transformer and evaluation inputs, using the same recovery metrics.These methods incorporate downstream computation in different ways. The results for these featurizers are shown in the table below:
Table. Reconstruction/prediction R^2 and one-to-one Hungarian F1 for the original baselines and additional function-aware featurizers, alongside our Jacobian coverage method.
The structural distinction is that our coverage objective holds the downstream features fixed and asks a selected upstream latent direction to align with each downstream feature’s gradient. We view this constraint as a plausible explanation for the higher one-to-one recovery in our testbed. We will add these comparisons and a dedicated appendix section in the revised paper. Thank you for encouraging us to explore these comparisons.