计算机科学
钥匙(锁)
持续时间(音乐)
推荐系统
领域(数学)
在线算法
人工智能
接口(物质)
运筹学
在线学习
机器学习
政策学习
高效算法
基线(sea)
结构化预测
用户界面
竞争分析
数据科学
作者
Su Jia,Andrew Li,R. Ravi,Nishant Oli,Paul Duff,Ian Anderson
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2026-04-21
标识
DOI:10.1287/opre.2023.0557
摘要
When Thousands of Items Arrive Every Hour: A New Approach to Online Experimentation Researchers have reported a new approach to address a key challenge for online platforms. In a new paper in Operations Research, Jia et al. introduced the Short-lived High-volume Bandits (SLHVB) framework. This models modern platforms where thousands of items—such as ads, stories, or interface designs—arrive each hour but remain available only briefly. The study develops a near-optimal online learning policy that balances exploration and exploitation. Theoretical analysis shows the algorithm achieves nearly the minimal possible loss as the number of user impressions grows. The team tested the policy in a large-scale field experiment with Glance, a leading lock-screen content platform. The policy increased viewing duration by 4.32% and click-through rates by 7.48% compared to the platform’s existing deep-learning-based recommender system.
科研通智能强力驱动
Strongly Powered by AbleSci AI