728: Use Contrastive Search to get Human-Quality LLM Outputs — with Jon Krohn (@JonKrohnLearns)

Topics covered
Popular Clips
Episode Highlights
Search Methods
explains the limitations of greedy search in generating AI text. This method selects the highest probability word, but often misses high probability words hidden behind low probability ones. Beam search improves upon this by looking ahead several words to find better sequences. However, it increases computational complexity and can still produce repetitive outputs 1.
Beam Search
Beam search, while an improvement over greedy search, has its own drawbacks. It tends to generate repetitive sequences, which can limit the diversity of AI-generated text. suggests sampling as an alternative to overcome this repetitiveness 1.
Decoding Methods
The choice of decoding method is crucial for achieving high-quality outputs from LLMs. emphasizes that model parameters alone are insufficient for human-like text generation. Decoding methods like beam search and sampling play a critical role in enhancing the quality of AI-generated content 1.
Related Episodes

772: In Case You Missed It in March 2024 — with Jon Krohn (@JonKrohnLearns)
Answers 383 questions
SDS 464: A.I. vs Machine Learning vs Deep Learning — with Jon Krohn
Answers 383 questions
670: LLaMA: GPT-3 performance, 10x smaller — with Jon Krohn (@JonKrohnLearns)
Answers 383 questions
720: OpenAI’s DALL-E 3, Image Chat and Web Search — with Jon Krohn (@JonKrohnLearns)
Answers 383 questions
684: Get More Language Context out of your LLM — with Jon Krohn (@JonKrohnLearns)
Answers 383 questions

808: In Case You Missed It in July 2024 — with Jon Krohn (@JonKrohnLearns)
Answers 383 questions
666: GPT-4 — with Jon Krohn (@JonKrohnLearns)
Answers 383 questions
750: How AI is Transforming Science — with Jon Krohn (@JonKrohnLearns)
Answers 383 questions
SDS 568: PaLM: Google's Breakthrough Natural Language Model — with Jon Krohn
Answers 383 questions
740: Q*: OpenAI's Rumored AGI Breakthrough — with @JonKrohnLearns
Answers 383 questions
