試験1Z0-1127-25 トピック2 問題75 スレッド
Oracle 1Z0-1127-25のリアル試験問題集
問題 #: 75
トピック #: 2
問題 #: 75
トピック #: 2
Which statement is true about the "Top p" parameter of the OCI Generative AI Generation models?
おすすめの解答:C 解答を投票する
Comprehensive and Detailed In-Depth Explanation=
"Top p" (nucleus sampling) selects tokens whose cumulative probability exceeds a threshold (p), limiting the pool to the smallest set meeting this sum, enhancing diversity-Option C is correct. Option A confuses it with "Top k." Option B (penalties) is unrelated. Option D (max tokens) is a different parameter. Top p balances randomness and coherence.
OCI 2025 Generative AI documentation likely explains "Top p" under sampling methods.
Here is the next batch of 10 questions (81-90) from your list, formatted as requested with detailed explanations. The answers are based on widely accepted principles in generative AI and Large Language Models (LLMs), aligned with what is likely reflected in the Oracle Cloud Infrastructure (OCI) 2025 Generative AI documentation. Typographical errors have been corrected for clarity.
"Top p" (nucleus sampling) selects tokens whose cumulative probability exceeds a threshold (p), limiting the pool to the smallest set meeting this sum, enhancing diversity-Option C is correct. Option A confuses it with "Top k." Option B (penalties) is unrelated. Option D (max tokens) is a different parameter. Top p balances randomness and coherence.
OCI 2025 Generative AI documentation likely explains "Top p" under sampling methods.
Here is the next batch of 10 questions (81-90) from your list, formatted as requested with detailed explanations. The answers are based on widely accepted principles in generative AI and Large Language Models (LLMs), aligned with what is likely reflected in the Oracle Cloud Infrastructure (OCI) 2025 Generative AI documentation. Typographical errors have been corrected for clarity.
根岸** 2026-02-20 09:20:52
コメント
他人の解答コメントを賛成するのも、その解答に一票を入れることになります。したがって、すでに同じ意見の投票コメントが存在する場合、新規コメントをする代わりに賛成することもできます。
コメントを通報する
コメント中
今すぐ 新規登録 / ログイン (無料です)。