Aussie AI Blog

Reasoning Decoding Algorithms

  • December 29th, 2024
  • by David Spuler, Ph.D.

Reasoning Decoding Algorithms

Reasoning decoding algorithms are the use of modified inference decoding algorithms to mimic multi-step reasoning algorithms, such as Chain-of-Thought. Hence, these are also called "Chain-of-Thought decoding." This is an interesting new area of AI research that aims to achieve the goals of the smart-but-slow "reasoner" models, which use multiple steps of inference computations to achieve advanced problem solving capabilities.

The basic idea is that the multiple alternative pathways that are not taken during decoding are somwhat similar to alternative lines of reasoning. More detailed analysis of these different pathways during the inference decoding phase can achieve reasoning capabilities more extensive than simple decoding algorithms. The advantage of this "reasoning decoding" method is efficiency, because multiple pathways can be examined in a single inference step.

The idea of tracking a "tree" of decoding paths is not new, and is in fact the basis of the "beam search" decoding algorithm. However, the latest research on CoT decoding takes this a step further and attempts to evaluate the correctness of multiple pathways at a higher level.

Here are the latest papers on "CoT decoding" ideas:

  1. Xuezhi Wang, Denny Zhou, 23 May 2024 (v2), Chain-of-Thought Reasoning Without Prompting, https://arxiv.org/abs/2402.10200
  2. xjdr-alt, Dec 2024, entropix: Entropy Based Sampling and Parallel CoT Decoding, https://github.com/xjdr-alt/entropix

Read more about the research on:

Reasoning and CoT Token Efficiency Topics

Blog articles on reasoning efficiency:

More research information on general efficiency optimization techniques for reasoning models:

Efficiency optimizations to Chain-of-Thought include:

More AI Research Topics

Read more about: