AINeutralarXiv – CS AI · 8h ago6/10
🧠
Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
Researchers prove that fixed-budget best-arm identification in bandit problems is no harder than fixed-confidence approaches up to logarithmic factors, introducing FC2FB—a meta-algorithm that converts fixed-confidence algorithms to fixed-budget ones while maintaining optimal sample complexity. This fundamental result establishes a previously unclear relationship between two core machine learning paradigms and enables improved algorithms across multiple problem classes.