arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.04376stat.MLcs.LGmath.OC
收藏

一种自适应随机最优化资源分配算法

An adaptive stochastic optimization algorithm for resource allocation

CMLA, ENS Cachan CNRS, Université Paris-Saclay(巴黎萨克雷大学法国国家科学研究中心卡尚高等师范学校计算数学与应用实验室);CREST, ENSAE(法国国立统计与经济管理学院经济与统计研究中心);Criteo AI Lab(Criteo人工智能实验室)

Xavier Fontaine, Shie Mannor, Vianney Perchet

摘要:

我们考虑经典的顺序资源分配问题,决策者必须反复划分几个资源之间的预算,每个资源的收益递减。这可以被重新定义为一个特定的随机最优化问题,其目标是最大化累积奖励,或者等价地最小化遗憾。我们构造了一个算法,是{ \em自适应}的问题的复杂性,表示在资源的回报率的规律性,衡量的指数在Eschojasiewicz不等式(或其通用的参数)。我们的参数无关算法恢复强凹函数的最优速率和多臂强盗的经典快速速率(线性奖励函数)。此外,该算法改进了现有的结果随机最优化在这种遗憾最小化设置为中间的情况下。

英文摘要:

We consider the classical problem of sequential resource allocation where a decision maker must repeatedly divide a budget between several resources, each with diminishing returns. This can be recast as a specific stochastic optimization problem where the objective is to maximize the cumulative reward, or equivalently to minimize the regret. We construct an algorithm that is {\em adaptive} to the complexity of the problem, expressed in term of the regularity of the returns of the resources, measured by the exponent in the Łojasiewicz inequality (or by their universal concavity parameter). Our parameter-independent algorithm recovers the optimal rates for strongly-concave functions and the classical fast rates of multi-armed bandit (for linear reward functions). Moreover, the algorithm improves existing results on stochastic optimization in this regret minimization setting for intermediate cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑