0


并行随机时长实验的预算优化

Budgeted Optimization with Concurrent Stochastic-Duration Experiments
课程网址: http://videolectures.net/nips2011_azimi_experiments/  
主讲教师: Javad Azimi
开课单位: 俄勒冈州立大学
开课时间: 2012-01-19
课程语种: 英语
中文简介:
预算优化涉及通过在智能选择的输入处请求有限数量的功能评估来优化评估成本高的未知功能。典型的问题公式假设实验是一次一个地选择,实验总数有限,但未能捕捉到许多现实世界问题的重要方面。本文定义了一个新的问题公式,具有以下重要的扩展:1)允许并发实验; 2)允许随机实验持续时间; 3)对实验总数和总实验时间都施加约束。我们开发了离线和在线算法,用于在此新设置中选择并行实验,并提供许多优化基准的实验结果。结果表明,与天然基线相比,我们的算法产生了高效的时间表。
课程简介: Budgeted optimization involves optimizing an unknown function that is costly to evaluate by requesting a limited number of function evaluations at intelligently selected inputs. Typical problem formulations assume that experiments are selected one at a time with a limited total number of experiments, which fail to capture important aspects of many real-world problems. This paper defines a novel problem formulation with the following important extensions: 1) allowing for concurrent experiments; 2) allowing for stochastic experiment durations; and 3) placing constraints on both the total number of experiments and the total experimental time. We develop both offline and online algorithms for selecting concurrent experiments in this new setting and provide experimental results on a number of optimization benchmarks. The results show that our algorithms produce highly effective schedules compared to natural baselines.
关 键 词: 预算优化; 智能选择; 在线算法
课程来源: 视频讲座网
最后编审: 2019-07-26:cwx
阅读次数: 35