arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.06050cs.LG
收藏

顺序滑雪板租赁问题

Sequential Ski Rental Problem

Indian Institute of Technology Madras(印度理工学院马德拉斯分校)

Anant Shah, Arun Rajkumar

摘要:

经典的“买或租”滑雪租赁问题最近被认为是在多个专家(如机器学习算法)建议滑雪季节的长度设置。在这里,强大的算法被开发出来,在对抗性的场景中,这种专家预测是不可用的,具有改进的理论性能。我们考虑这个问题的一个变种,我们称之为“连续滑雪租赁”的问题。在这里,一系列的滑雪租赁问题必须解决在一个在线的方式,购买成本和滑雪季节的长度是未知的学习者。学习者可以接触到两组专家,一组专家建议购买滑雪板的真实成本,另一组专家建议滑雪季节的长度。在专家预测购买成本的某些随机假设下,我们开发了在线算法,并证明了相同的遗憾界。我们的实验评估证实了我们的理论结果。

英文摘要:

The classical 'buy or rent' ski-rental problem was recently considered in the setting where multiple experts (such as Machine Learning algorithms) advice on the length of the ski season. Here, robust algorithms were developed with improved theoretical performance over adversarial scenarios where such expert predictions were unavailable. We consider a variant of this problem which we call the 'sequential ski-rental' problem. Here, a sequence of ski-rental problems has to be solved in an online fashion where both the buy cost and the length of the ski season are unknown to the learner. The learner has access to two sets of experts, one set who advise on the true cost of buying the ski and another set who advise on the length of the ski season. Under certain stochastic assumptions on the experts who predict the buy costs, we develop online algorithms and prove regret bounds for the same. Our experimental evaluations confirm our theoretical results.

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

↑