arXiv (Cornell University) · 2015 · 133 citations · 24 references
ComputingComputer ScienceAlgorithmsMachine LearningOptimizationBayesian InferenceBayesian LearningBayesian StatisticsDimensionality ReductionOptimization For Machine LearningReinforcement LearningBandit AlgorithmsBayesian BanditsBayesian OptimizationOptimization For High-dimensional DataRegret Optimization
Bayesian Optimisation (BO) is a technique used in optimising a $D$-dimensional function which is typically expensive to evaluate. While there have been many successes for BO in low dimensions, scaling it to high dimensions has been notoriously difficult. Existing literature on the topic are under very restrictive settings. In this paper, we identify two key challenges in this endeavour. We tackle these challenges by assuming an additive structure for the function. This setting is substantially more expressive and contains a richer class of functions than previous work. We prove that, for additive functions the regret has only linear dependence on $D$ even though the function depends on all $D$ dimensions. We also demonstrate several other statistical and computational benefits in our framework. Via synthetic examples, a scientific simulation and a face detection problem we demonstrate that our method outperforms naive BO on additive functions and on several examples where the function is not additive.
24
Rapid object detection using a boosted cascade of simple features
Paul Viola, Michael Jones · 2005 · 18.2K citations
Eric Brochu, Vlad M. Cora, Nando de Freitas · arXiv (Cornell University) · 2010 · 2.2K citations · Full text
James Bergstra, Daniel Yamins, David Cox · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · 2013 · 1.6K citations · Full text