Discussion
What does the upper confidence bound rule balance in tree search?
Answer: A
The rule adds a term that grows when a move has been tried rarely, so a move with a good average is preferred but one with few samples is not neglected. That is the multi-armed bandit problem transplanted into a tree. Depth against breadth, resources and simulation quality are different trades. Importing a principled solution to exploration from another field, rather than inventing an ad hoc rule, is what gave the method its theoretical footing.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development