- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper introduces effective interference to capture feature interactions, which comes from both feature geometry and code statistics. Theoretically, under fixed support assumption, this paper presents code-optimality condition and encoder consistency identity. Also, this paper analyzes four controlled cases: constrained local orthogonalization, conditional bias compensation, encoder-gain adaptations, and encoder-decoder duality. Empirical results on controlled SAE training examines theoretical results.
Critical strengths
None.
Critical weaknesses
-
The theoretical contributions are limited. Proposition 4.1 is a direct least-square optimality result. Proposition 4.2 is simply an algebraic identity. Proposition 4.3 requires very strong assumptions including only two active features, which significantly weakens the implications.
-
The four mechanisms discussed in Section 4 are weakly connected to full training. Routes I, II, III, IV relies on different restricted setups. However, the paper does not provide how these mechanisms will take effect and interact with each other in full training.
-
The empirical results are not convincing and requires further explanation. For instance:
-
In figure 2, the empirical result of increases and decreases from peak cannot directly reflects selective orthogonalization of co-active pairs, since the statistics is summed up over , and rely on multiple variables without explicit control.
-
In line 374, "large " and "near zero" are unspecified. Additionally, in figure 3, the vertical axis and color scale are both logarithmic, which makes it very difficult to assess the claims. More detailed criteria and quantitative results are necessary.
-
Questions for authors
Please refer to the weaknesses part.
-
Could the authors explain the role of two active features in the proof of Proposition 4.3? Is it possible to generalize Proposition 4.3 to arbitrary size of ?
-
Could the authors further explain the implications from figure 2, and provide detailed quantitative analysis regarding figure 3?
6 comments
Addressing W2
[W2 - Role of the Four Routes]
Thank you for raising this point. The routes are controlled architectural limits of a common encoder-consistency balance, not mutually exclusive mechanisms or successive training phases. We analyze them separately to isolate their roles, while all permitted parameters can adapt jointly during training.
The settings are composable and partly nested. The tied baseline is a special case of both the bias and gain settings. The gain setting is an aligned-direction special case of our untied model, provided the bias constraints match. Thus, geometric adaptation can coexist with bias compensation or gain adaptation, and untied encoders permit both norm and directional changes. Bias remains an independent choice; the settings can be a nested sequence or an independent addition. The tied-with-bias setting therefore combines Routes I and II, and both can operate during training. In this setting, the bias is zero at initialization, so the local orthogonalization mechanism of Route I initially takes effect. As the bias adapts to the interference pattern, Route II allows more effective interference. This helps explain why the settings in Figure 6 show different levels of effective interference. Proposition F.1 in the appendix also combines Routes I and III. Route IV implicitly includes Route III because encoder weights are not normalized in the untied setting.
Evidence under full training. Our ablations jointly train all permitted parameters using minibatch Adam and changing supports. Within each SAE family, adding bias, gain, or independent encoder directions can retain positively aligned, co-active decoder features, reflected in the rightward extension of the inference heatmaps in Figure 3 and the aggregate differences in Figure 6. These comparisons test the effect of making mechanisms available, not uniquely attributing each interaction to one route. These choices also occur in practical SAEs: Cunningham et al. (2024) use tied weights with bias, while Gao et al. (2025) use separate encoder and decoder weights. We have also added an analysis of independently trained SAEBench models in the appendix to examine these mechanisms in SAEs used in practice, providing complementary evidence of substantial effective interference beyond our controlled recipe.
Addressing W3/Q2
Elaborating Figure 2
The reviewer’s comment is addressable by clarification. Figure 2 does not aim to directly provide numerical analyses for Proposition 4.3 (we have clarified it in the caption and color in the text). Figure 2 provides intuition on what happens to effective interference during training. This directly relates to the reconstruction analysis in Eq. (3.3):
=\sum_{i\ne j}(\rho_{ij}M_{ij}\pi_{ij})^2.$$ This is a weighted measure of orthogonalization: each pair’s correlation $\rho_{ij}$ is weighted by its co-activation magnitude $M_{ij}$ and co-activation probability $\pi_{ij}$. Equivalently, after normalization, the sum can be viewed as a weighted average of $\rho_{ij}^2$, with larger weights assigned to pairs that co-activate more strongly or more often. The decrease of effective interference, hence, relates to the active support in each iteration of the training (the setting used by Proposition 4.3 and Proposition G.1): the message of the proposition is that under some conditions (see the Propositions) the SAE pushes the __high co-active__ pairs to be more orthogonal (or similar statement on the Gram deviation error). This is a local orthogonalization on the active pairs, not a global orthogonalization. We have conveyed this in Figure 2 such that this means the rho becomes small on pairs that matter, and might be small on unrelated non co-activated pairs. So the unweighted correlation statistic, by contrast, treats all pairs equally may go up while what the network is concerned for is $I_{ij}$. We have included the above elaborations in the main text now, and also refer the reader to Figure 8 in the appendix. The figure illustrates why the weighted and unweighted statistics can move in different directions, and that the density of the point with high effective interference (high $\pi_{ij} M_{ij}$ and high $\rho_{ij}$ are those that move toward lower the interference. Particularly, those that keep their code overlap $\pi_{ij} M_{ij}$ high, end of having very low $\rho_{ij}$. We show that at initialization, the values of $\rho_{ij}$ are more concentrated around zero due to the random initialization. As training progresses, their overall range widens, explaining the increase in the unweighted statistic. This is what one sees by projecting all the points in Figure 8 onto the (x)-axis, which represents $\rho_{ij}$, while ignoring the (y)-axis, which represents the code statistics $M_{ij}\pi_{ij}$. Once the (y)-axis is taken into account, we observe that the correlations do not widen for all pairs. Pairs with higher $M_{ij}\pi_{ij}$, $\rho_{ij}$ instead shrinks relative to initialization while lower one widens. The pairs with higher $M_{ij}\pi_{ij}$ contribute most strongly to $\sum_{i\ne j}(\rho_{ij}M_{ij}\pi_{ij})^2$, so their behaviour captures the selective orthogonalization mechanism behind the decrease in this statistic which comes from the reconstruction (Eq 3.3). We hope this clarifies the distinction between global and selective orthogonalization. We now explain these intuitions from Figure 8 in the main manuscript. Finally, we would be happy to address the reviewer’s concern about multiple variables further if they specify which variables or controls they have in mind. **Elaborating Figure 3** Below, we elaborate how to interpret Figure 3. We have revised line 374 to describe the distributional trend more precisely: >“In the tied, normalized, bias-free model, the distribution of $\rho_{ij}$ narrows symmetrically around zero as $\pi_{ij}M_{ij}$ increases. Adding bias, encoder gain, or untying breaks this symmetry, shifting pairs toward positive $\rho_{ij}$ and retaining constructive interference.” Throughout, “large” and “small” describe relative values within the joint interference profile ($\rho_{ij}$ versus $\pi_{ij}M_{ij}$). Similarly, “near zero” describes concentration around $\rho_{ij}=0$. For example, “large $\rho_{ij}$” refers to pairs with relatively high positive geometric alignment among the displayed pairs. These are qualitative descriptions rather than fixed numerical thresholds. Figure 3 uses a logarithmic vertical axis because the co-activation-weighted magnitude $\pi_{ij} M_{ij}$ spans several orders of magnitude, and a logarithmic color scale because the bin counts do as well. It shows the distribution of feature pairs. To help the reader understand these colorbars, we have added the linear scale colormap in Figure 22. We note that beyond these distributional figures on the interference, we have quantitative metrics. Figure 6 shows quantitative aggregate summaries of constructive, destructive, and net interference; this figure is modified now with error bars on runs over three independent seeds. Moreover, Figure 13 contains quantitative results on the interference profile ($\pi_{ij}$, $M_{ij}$, $\rho_{ij}$); the figure illustrates the interference profile across support size $k$ and dictionary width $p$.
Addressing W1/Q1
We appreciate the time the reviewer spent on our paper and we address their concerns below.
[W1/Q1]
We agree that Proposition 4.1 is a standard fixed-support least-squares condition and Proposition 4.2 is an algebraic consistency identity. Indeed, their role is to establish the reference condition and common balance underlying the architectural analysis, rather than to constitute standalone theoretical novelties. We also agree that the original two-feature result alone does not characterize practical SAE training. Hence, we have added a new analyses (Propositions and Corollaries) on general-support Gram dynamics (<2<k<p, Appendix G) and bias/gain learning dynamics (Appendices H and I) that go beyond encoder consistency and do not assume per-input code optimality.
Clarifying the role of Propositions 4.1–4.2. Proposition 4.1 supplies an ideal code-optimality target, not a condition automatically satisfied by an amortized encoder. Proposition 4.2 identifies how encoder gain, incoming cross-talk, bias, and residual coupling jointly balance on an active region. Its value is in distinguishing which mechanisms different architectures can use; the identity alone does not establish that optimization learns a particular mechanism. The new results address this distinction directly. Beyond two active features: general-support Gram dynamics. Our analyses consider the full active-support Gram deviation ΔS=∥DS⊤DS−Ik∥F2,∣S∣=k. For tied, unit-norm, bias-free weights, let G=DS⊤DS, K=G−Ik, and C=N1∑nzSn(zSn)⊤ for a batch sharing support S. Our new fixed-support Gram-dynamics proposition gives, for a gradient step followed by column normalization,
ΔS+−ΔS=−8ηΦS+O(η2),ΦS=tr(K2C)−∑i∈S(K2)ii(KC)ii.
This identity holds for k>2 and accounts for interactions among all active features. The first term is nonnegative; the second is a signed correction from column normalization. Hence, ΦS>0 guarantees a decrease for sufficiently small, support-preserving steps. When ΔS>0, a sufficient condition is q<λ, where λ=λmin(CS) and q=∥diag(KC)∥∞. Intuitively, sufficiently varied code amplitudes provide excitation that dominates the normalization correction. These are sufficient conditions, not assumptions we claim every trained support satisfies (See Appendix G for formal proof).
Sensitivity to support changes. Fixing the support is a local condition for the analyzed update, not a claim that an input retains its support throughout training. For a finite batch away from selection boundaries, sufficiently small parameter changes preserve the active affine branches. As training progresses, supports may change between iterations and are therefore not restricted to a predefined set throughout training. Such local analyses are related to support-consistency arguments in sparse coding and autoencoder theory, including analyses of alternating-minimization schemes (Arora et al., 2015; Chatterji & Bartlett, 2017; Nguyen et al., 2019).
Fixing the support is therefore an analytical device for studying local gradient dynamics and stationarity conditions, rather than a constraint imposed on training. Across examples and iterations, overlapping and changing supports couple updates through shared dictionary atoms. Thus, features are not confined to permanently isolated subdictionaries: the local analysis holds the support fixed for the update being studied, while training remains free to select different supports subsequently. This distinction explains how local mechanisms can inform our interpretation of training without providing a guarantee across support transitions.
Deviations from code optimality. The encoder-consistency identity itself is exact on the active affine region; approximate code optimality enters when residual-coupling terms are dropped. The new Gram, bias, and gain gradient analyses are derived directly from reconstruction loss and do not assume DS⊤r=0. Hence, our dynamic analyses do not use per-input code optimality.
It is important to note that sparse-coding analyses often separate inference with a fixed dictionary from dictionary learning, examining how inference accuracy affects learning. SAEs amortize inference through a shared encoder; Proposition 4.1 therefore provides an ideal fixed-support code-optimality reference, not a condition guaranteed by end-to-end training. Figure 2C shows that the gap, E∣DS⊤r∣2, decreases but remains nonzero, helping assess approximations based on this condition without establishing exact per-input optimality or convergence of alternating minimization.