The Scaling Properties of Implicit Deductive Reasoning in Transformers
It is found that in sufficiently deep models with a bidirectional prefix mask, implicit reasoning approaches explicit CoT performance across graph topologies and problem widths, though CoT remains necessary for depth extrapolation.