Learn PromptingPrompt Engineering Guide
😃 Basics
💼 Applications
🧙♂️ Intermediate
🧠 Advanced
Special Topics
🌱 New Techniques
🤖 Agents
⚖️ Reliability
🖼️ Image Prompting
🔓 Prompt Hacking
🔨 Tooling
💪 Prompt Tuning
🗂️ RAG
🎲 Miscellaneous
Models
📝 Language Models
Resources
📙 Vocabulary Resource
📚 Bibliography
📦 Prompted Products
🛸 Additional Resources
🔥 Hot Topics
✨ Credits
Definition of Greedy Decoding
A stategy utilized by a Large Language Model when generating sequences which selects the the token with the highest probability from the probability distribution without considering future tokens.
For more definitions, view the full list.
Copyright © 2024 Learn Prompting.