arborist

Tree search for hyperparameter optimization
Linear Hill Climbing autoresearch
0.2312
Best F1
0
Experiments
0
Improvements
Tree Search arborist
0.0000
Best F1
0
Experiments
0
Branches
VS
Kept improvement
Discarded
Running best

Linear search makes one change at a time, keeping improvements and discarding the rest. It converges fast but gets trapped in local optima. Tree search branches into multiple directions simultaneously, using UCB to balance exploration and exploitation. Same budget. Different topology. Better results.