SeterusnyaPanduan seterusnya
Suhu dan Persampelan
AI bahasa
PANDUAN AI Bahasa
Best-of-N is an inference-time selection method: sample multiple outputs and use a scorer or verifier to choose one.
Dengar panduan iniAI-diceritakan · ~2 min
It can improve results when the model sometimes produces a good candidate and the scorer identifies it reliably. More samples cost more generation and can amplify errors in an imperfect scorer.
Best-of-N samples N candidate responses from a model and returns the one with the highest score under a reward model, verifier, or heuristic. Self-consistency is a special case that aggregates final answers by majority vote. If each independent sample has probability p of success and a perfect verifier can recognize success, the chance at least one candidate is correct is 1−(1−p)^N. Real outputs are not necessarily independent and real scorers are imperfect. Research on reward-model overoptimization finds that optimizing against a proxy can eventually reduce gold-standard performance, including in best-of-N selection.
Sampling several math solutions and selecting one that passes a verifier
Generating code candidates and ranking them with unit-test results
Using majority vote when multiple reasoning chains reach the same answer
Comparing quality gains against the additional generated tokens and scorer cost
Inference-time scaling research studies adaptive sample counts, verifiers, and reward-model calibration. The right N depends on the task, sample quality, scorer reliability, and compute budget. Evaluations should report both the selected-answer metric and the added generation/scoring cost.
Newsletter percuma
Tiga cerita AI yang disahkan setiap pagi hari bekerja, ditulis dalam Bahasa Inggeris biasa. Percuma selamanya, tiada iklan.
Satu e-mel setiap hari bekerja. Berhenti melanggan dalam satu klik. Kami tidak pernah menjual atau berkongsi alamat anda.
Uji diri anda
Maklum balas segera pada setiap jawapan, dan sijil yang boleh dikongsi dengan ID yang boleh disahkan sebaik sahaja anda lulus kursus.
Sokong pendidikan AI percuma. AI Understanding ialah pertubuhan bukan keuntungan 501(c)(3) — tiada iklan, tiada bayaran dinding, selamanya. Buat derma
Best-of-N is an inference-time selection method: sample multiple outputs and use a scorer or verifier to choose one. It can improve results when the model sometimes produces a good candidate and the scorer identifies it reliably. More samples cost more generation and can amplify errors in an imperfect scorer.
Best-of-N melukis berbilang jawapan calon dan kemudian menyusunnya semula, mengembalikan jawapan yang mendapat markah tertinggi.
More candidates help only if a good answer sometimes appears and the scorer can recognize it; neither condition is guaranteed.
Pemilihan hanya sebaik penarafan semula; penjaring yang lemah atau berat sebelah boleh memilih jawapan yang salah.
Research measures reward-model overoptimization in best-of-N: selecting extreme proxy scores can eventually lower gold-reward performance.
Ketekalan diri mencontohi banyak rantaian penaakulan dan memilih jawapan akhir yang disetujui oleh kebanyakan rantaian.
Teruskan belajar
Lebih banyak panduan dipilih untuk topik ini
SeterusnyaPanduan seterusnya
Suhu dan Persampelan
AI bahasa