What is the key difference between beam search and greedy...

Technology & Computers

What is the key difference between beam search and greedy decoding?

Choose the correct answer

A. Beam search considers multiple candidate sequences B. Beam search always selects a random token C. Greedy decoding maintains multiple candidate sequences D. Greedy decoding requires quantization

Discussion

0 comments

Want to join the discussion?

Please sign in to post a comment.

Comments

0 comments

Loading discussion...

← Back to Search Browse Technology & Computers

Search Wikique

Categories

General Knowledge 4 Questions

Competitive Exams 5 Questions

History & Geography 99 Questions

Entrance Exams 4 Questions

Technology & Computers 316 Questions

Aptitude & Reasoning 4 Questions

Languages & Literature 43 Questions

Professional & Career 37 Questions

Lifestyle, Culture & Trivia 4 Questions

Sports & Entertainment 43 Questions

Business, Finance & Economics 4 Questions

Current Affairs 26 Questions

Question (ID - Q-qoie7z8uo1wgg84)