arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.01702cs.LGcs.AIstat.ML
收藏

超越点击率:多层次反馈的Web链接选择

Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback

The Chinese University of Hong Kong(香港中文大学);Tsinghua University(清华大学)

Kun Chen, Kechao Cai, Longbo Huang, John C. S. Lui

摘要:

网络链接选择问题是从一个大的网络链接池中选择一个小的网络链接子集,并将所选择的链接放置在只能容纳有限数量的链接的网页上,例如,广告、推荐或新闻馈送。尽管长期关注的点击率反映了链接本身的吸引力,但收入只能从点击后的用户行为中获得,例如,在通过推荐链接被引导到产品页面之后购买。因此,网络链接具有固有的\emph{multi-level feedback structure}。有了这个观察,我们考虑上下文无关的网络链接选择问题,其目标是最大化收入,同时确保吸引力不低于一个预设的阈值。该问题的关键挑战在于,每个环节的多级反馈是随机的,并且除非该环节被选择,否则是不可观察的。我们建模这个问题的约束随机多臂强盗制定,并设计了一个有效的链接选择算法,称为约束上界置信算法(\textbf{Con-UCB}),并证明$O(\sqrt{T\ln T})$界的遗憾和违反的吸引力约束。我们进行了广泛的实验在三个真实世界的数据集,并表明,\textbf{Con-UCB}优于国家的最先进的上下文无关的强盗算法的多级反馈结构。

英文摘要:

The web link selection problem is to select a small subset of web links from a large web link pool, and to place the selected links on a web page that can only accommodate a limited number of links, e.g., advertisements, recommendations, or news feeds. Despite the long concerned click-through rate which reflects the attractiveness of the link itself, the revenue can only be obtained from user actions after clicks, e.g., purchasing after being directed to the product pages by recommendation links. Thus, the web links have an intrinsic \emph{multi-level feedback structure}. With this observation, we consider the context-free web link selection problem, where the objective is to maximize revenue while ensuring that the attractiveness is no less than a preset threshold. The key challenge of the problem is that each link's multi-level feedbacks are stochastic, and unobservable unless the link is selected. We model this problem with a constrained stochastic multi-armed bandit formulation, and design an efficient link selection algorithm, called Constrained Upper Confidence Bound algorithm (\textbf{Con-UCB}), and prove $O(\sqrt{T\ln T})$ bounds on both the regret and the violation of the attractiveness constraint. We conduct extensive experiments on three real-world datasets, and show that \textbf{Con-UCB} outperforms state-of-the-art context-free bandit algorithms concerning the multi-level feedback structure.

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

↑