Skip to content
From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models episode artwork

May 23, 2025 32 min

From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models

from Best AI papers explained Hosted by Enoch H. Kang

This academic paper explores various methods for improving the text generated by large language models (LLMs) after they have been trained, focusing on inference-time algorithms. It categorizes these techniques into three core areas: token-level generation algorithms that operate on individual tokens, meta-generation algorithms which structure multiple generation steps, and strategies for efficient generation concerning both token cost and speed. The work formalizes the objectives of different generation approaches and discusses how to incorporate external information, such as other models or tools, to enhance output quality. The authors also analyze the cost-performance tradeoffs of these algorithms and highlight future research directions.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models

0:00 32:22

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Best AI papers explained?

This episode is 32 minutes long.

When was this Best AI papers explained episode published?

This episode was published on May 23, 2025.

Can I download this Best AI papers explained episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.