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.
Competitive Algorithms for Multi-Agent Ski-Rental Problems
University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);University of Ottawa(渥太华大学);The Chinese University of Hong Kong(香港中文大学);California Institute of Technology(加州理工学院)
Online Primal-Dual Algorithms with Predictions for Packing Problems
University Paris-Saclay(巴黎萨克雷大学);Sorbonne University(巴黎索邦大学);IBISC(IBISC(需注意:IBISC是巴黎萨克雷大学下属研究机构,此处按原文提取));CNRS(法国国家科学研究中心);LIP6(LIP6(巴黎索邦大学下属实验室,此处按原文提取))
Sequential Skip Prediction with Few-shot in Streamed Music Contents
Seoul National University(首尔国立大学);Institute for Industrial Systems Innovation(工业系统创新研究所);Center for Super Intelligence(超级智能中心);Music and Audio Research Group(音乐与音频研究组)
本文概述了为WSDM Cup 2019 Spotify顺序跳过预测挑战赛(团队名称:mimbres)提交的算法。在挑战中,提供了完整的信息,包括收听会话的前半部分的声学特征和用户交互日志。我们的目标是预测是否会跳过会话后半部分中的单个曲目,仅给定声学特征。我们提出了两种不同的算法,分别基于度量学习和序列学习。实验结果表明,序列学习方法的性能明显优于度量学习方法。此外,我们进行了额外的实验,发现使用完整的用户日志信息可以实现显着的性能增益。