On twelve code-optimization tasks, no fixed search structure wins on efficiency, and fluid—a UCB portfolio over hill-climbing chains—nearly matches a per-task oracle on AUC of the reward frontier.
Optimal Speedup of Las Vegas Algo- rithms.Information Processing Letters, 47(4):173–180, 1993
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficiency Matters in Autonomous Research
On twelve code-optimization tasks, no fixed search structure wins on efficiency, and fluid—a UCB portfolio over hill-climbing chains—nearly matches a per-task oracle on AUC of the reward frontier.