- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies an intriguing possibility: can interventions be identifiable and stable even when the underlying nonnegative sparse code is not unique? Rather than tying the analysis to the output of a particular encoder, the authors work with a fixed decoder and consider all admissible nonnegative -sparse explanations. That framing shift alone is a real strength. The main results are substantial: a signed-circuit characterization of exactly identifiable diagonal interventions, a sharp target-specific stability modulus, and an exact quotient theorem for repeated decoder directions. Beyond these, the paper delivers an certification algorithm on forest Gram graphs, optimal binary selection on positive paths, and a shortest-path formula for attenuation when . Further results establish an unbounded binary-to-continuous collateral ratio on a structured family, coNP-completeness of general certification, and input-specific certificates under dictionary perturbations. On the validation side, the paper runs synthetic checks against exhaustive enumeration, rational counterexample verification, numerical LP comparisons, and 120 whole-input certification instances. This checks implementation consistency and certificate coverage thoroughly, though it stops short of evaluating interventions on trained SAEs.
Critical strengths
-
The paper gives a precise and genuinely useful formulation of intervention ambiguity. The distinction between recovering a unique explanation and determining its intervention is one worth making, and the authors do far more than state it: they connect it to circuit structure, quantitative stability, and computational certification. Of the technical contributions, the budget-preserving forest algorithm and the prescribed-deletion hardness result are the ones I find most compelling. They give the framework real substance and are the main reasons I regard this submission as a borderline case rather than a clear rejection.
-
The treatment of exact certification is careful throughout. Singular states, rational witnesses, and the difference between upper bounds and impossibility certificates are all handled explicitly, which is exactly what one wants to see in this kind of work. The reported exhaustive checks and independent witness verification are appropriate as well. I also appreciate that the authors resist the temptation to read the 43 uncertified robust instances as unstable. Overall, the paper is notably disciplined about what its results do and do not establish.
Critical weaknesses
-
The manuscript does not yet make a sufficiently strong case for the originality of its overall contribution. A substantial part of the framework is assembled from established ingredients: conformal circuit decomposition, Lipschitz extension, duplicate-column aggregation, distance envelopes, and low-dimensional copositive representations. Their application here is certainly useful, but the number of theorems should not be confused with the number of independent advances. As I read it, the strongest novelty is concentrated in the sparsity-budget-aware forest algorithm, the intervention-specific hyperbolic reduction, and the prescribed-deletion hardness result. I was hoping for a sharper comparison with the closest existing results, particularly for the circuit characterization and the structured certification problem. The current positioning leaves me uncertain whether the paper represents a sufficiently substantial advance beyond a careful collection of specialized adaptations, and that uncertainty weighs heavily in my recommendation.
-
The positive results are also too structurally limited, and their usefulness beyond those structures is not sufficiently established. Forest Gram graphs come with strong rank restrictions. The all-sparsity separation construction relies on orthogonal two-dimensional blocks and replicated columns, so its arbitrary overcompleteness and coding nonuniqueness arise primarily from replication. This is a perfectly valid existence result, but it does not touch the difficult higher-order dependencies among distinct directions that actually motivate the SAE setting. The perturbation certificates offer a route beyond exact structure, yet the experiments do not show how tight or scalable those certificates really are. The whole-input suite is small, and it increases reconstruction tolerance together with the perturbation through , so the coverage curve never isolates sensitivity to dictionary perturbation. There is also little empirical information about runtime, rational bit-length growth, or usefulness at larger sparsity budgets. Let me be clear that my concern is not simply the absence of a language-model experiment; a theory paper need not demonstrate steering. What the submission does need is a stronger case that its tractable regimes or transferable certificates illuminate a broader class of problems than the relatively simple constructions currently evaluated. At present, that case is not convincing enough for acceptance.
Questions for authors
-
What are the closest prior results for the circuit characterization and the forest certification algorithm? Which parts require genuinely new arguments, rather than an application of conformal decomposition, kernel preservation, or standard Schur-complement dynamic programming? A precise comparison here could materially change my originality assessment.
-
Do the existing whole-input records contain feasible-pair lower bounds that can be compared with the certified upper bounds? Can the available results indicate whether coverage loss is driven mainly by the perturbation term, the increasing , or conservatism in the amplitude bound? Let me stress that I am asking about evidence already available, not requesting a new experimental suite.
-
Could you identify the existing scripts that check the original stability inequalities independently of the transformed formulations? Are runtime, memory, or rational bit-length measurements available for the submitted implementation, and what is the largest nontrivial instance it has been tested on? This would affect my assessment of the constructive contribution. I should add that broader dictionaries and trained-SAE evaluations would be welcome future work; my questions above concern the strength of the claims and evidence in the present submission.