finding
active
finding:identity-of-first-argument-algorithm-iia-consistently-hovers-around-50-for-all-alignment-map-types-on-hierarchical-equality-taskIdentity of first argument algorithm IIA consistently hovers around 50% for all alignment map types on hierarchical equality task
Exception to the general trend; attributed to insufficient RevNet capacity rather than algorithm not being implemented
Source paper
extracted_from(2025) · Sutter, Denis · Minder, Julian · Hofmann, Thomas · Pimentel, Tiago
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Demonstrates that high IIA can be obtained even when model cannot solve the task
- Replicates Geiger et al. 2024b pattern of layer-dependent IIA degradation with linear maps
- Best localist alignment achieves IIA of 0.73 on hierarchical equality Both Equality Relations in Layer 1finding0.807Shows localist alignment fails to capture the distributed structure found by DAS.
- Brute-force search achieves best IIA of 0.60 on hierarchical equality Both Equality Relations in Layer 1finding0.774DAS substantially outperforms brute-force search (1.00 vs 0.60 IIA) on the hierarchical equality task.
- Key empirical result: non-linear maps overcome linear maps' failure in deeper layers
- Authors connect their finding to the prior probing literature debate
- DAS achieves 100% IIA on hierarchical equality task with |N|=16, intervention size 8, Layer 1finding0.754DAS discovers a perfect alignment between the feed-forward network and the Both Equality Relations high-level model.
- Confirms theorem's existence proof holds but practical learnability fails with insufficient RevNet capacity