Kuiz berkaitan panduan · Sederhana Tahap

Kuiz Persampelan dan Penarafan Semula Best-of-N

Fahami pemilihan best-of-N, had penjaring, kos masa inferens dan andaian kebarangkalian di sebalik pensampelan lebih banyak calon.

Laluan panduan yang berkaitanBest Of N Persampelan Dan Kedudukan Semula
soalan 1 daripada 8

Apakah idea teras persampelan N terbaik?

Pratonton setiap soalan8 soalan

Jawapan dan penjelasan muncul semasa anda mengambil kuiz.

  1. Apakah idea teras persampelan N terbaik?
    • Hasilkan N keluaran calon dan pilih yang terbaik dengan penjaring
    • Latih model N kali dan purata pemberat
    • Gunakan hanya output pertama yang dihasilkan oleh model
    • Kurangkan perbendaharaan kata kepada N token
  2. When is best-of-N most likely to help?
    • When every output is equally good
    • When the model sometimes samples a correct candidate and a reliable verifier can identify it
    • When the task has no way to assess candidates
    • When sampling is disabled
  3. Apakah yang paling menentukan sama ada best-of-N sebenarnya meningkatkan hasil?
    • Warna antara muka pengguna
    • Panjang gesaan sahaja
    • Kualiti dan keteguhan penjaring atau pengesah
    • Saiz perbendaharaan kata model
  4. What can happen when N becomes large and the reward model is an imperfect proxy?
    • The model’s tokenizer is removed
    • The model forgets its training weights
    • All candidates become identical
    • Selection can favor outputs that exploit scorer errors and reduce true quality
  5. Strategi penarafan semula mudah manakah yang juga dikenali sebagai ketekalan diri?
    • Majoriti mengundi antara sampel jawapan
    • Memilih jawapan terpanjang
    • Memilih sampel rawak
    • Sentiasa mengambil keluaran kebarangkalian terendah
  6. What mainly drives the generation cost of best-of-N?
    • Only the number of vocabulary entries
    • The total amount of text generated across the sampled candidates
    • The user interface color
    • The number of model training runs
  7. If each independent sample succeeds with probability p and a perfect verifier picks any success, what is the chance at least one of N samples succeeds?
    • p/N
    • N−p
    • 1−(1−p)^N
    • 1−p^N
  8. Which assumption is needed for the simple 1−(1−p)^N success formula?
    • Every response has a different length
    • The model is retrained after each sample
    • The reward model has no parameters
    • The candidate samples are independent and the verifier recognizes success perfectly