Visualizing a core idea

Do the recurrent iterations stand for reasoning?

Throughout the paper, the authors frame depth recurrence as a mechanism for implicit latent reasoning. Computational depth should then reflect the complexity of the required reasoning, rather than improving accuracy.

This is reflected in their design choices:

  • Training data - composed of relatively heavy reasoning domains.
  • Training mechanisms - randomizing the depth, decoupling it from the direct accuracy metrics.

Here I visualize 3 points from the paper emphasizing the depth as a reasoning mechanism:

1. “the recurrent model outperforms its baseline with an especially pronounced advantage on harder tasks”

(5.3 Where does recurrence help most?)

Figure 7 shows that tasks that require more reasoning take more iterations to saturate the performance. Tables 1 and 4 include similar relevant evaluations that can be visualised in a similar plot:

relative_comparison_plot

Blue shades are simple tasks, and green shades are tasks requiring more reasoning. Reading the text, I was expecting the trends to show a later convergence for reasoning demanding tasks than the simple ones, but this is not as convincing.

2. “when more context is given, the model can reason about more information in context,…, mirroring generalization improvements shown for recurrence”

(Recurrence and Context)

In Figure 9 they show that as the model gets more shots (examples of the task), the accuracy saturates later, maybe indicating the model uses the examples as part of a complex reasoning. Table 4 compares closed book to open book tasks, in a similar context of open book allowing the preference reasoning over memorization.

closed_vs_open_with_difference Score shows performance (%). The model improves in an open-book scenario, showing similar improvement to other open source models.

3. “…the model exiting earlier on high school mathematics, but taking on average 3.5 steps more on moral scenarios”

(6.1. Zero-Shot Adaptive Compute at Test-Time)

Using the model for adaptive compute, they use a convergence metric to allow early exit. The idea is that simpler tasks, that require less reasoning, should converge and exit earlier. Figure 10 shows the distribution of steps to exit on different tasks, where simple tasks like high school math exit earlier than heavy reasoning tasks like moral scenarios.

Focusing on the peak of the density functions, it’s simpler to see that Continuous Chain-of-Thought (6.3) has little contribution, but the effect of the task domain is clear. early_exit




Enjoy Reading This Article?

Here are some more articles you might like to read next:

  • Critique: Parameter-efficient, but is it compute-efficient?
  • Reproducing the exit rule and the latent trajectories on Huginn-0125
  • Learning about Information Bottleneck
  • Key points regarding Latenct reasoning
  • A better graph instead of Table 4