quote
active
quote:you-can-literally-read-meaningful-algorithms-off-of-the-weights

"You can literally read meaningful algorithms off of the weights."

Load-bearing claim about the tractability of circuit analysis; central thesis of Claim 2

Source paper

extracted_from
Zoom In: An Introduction to Circuits
(2020) · Chris Olah · Nick Cammarata · Ludwig Schubert · Gabriel Goh +2

Neighborhood — ranked by edge-count

Claims (1)

claim

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.