Fast distributed bandits for online recommendation systems-Reference-Cited by-同舟云学术

Fast distributed bandits for online recommendation systems

Published:2020-06-29 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM International Conference on Supercomputing
language:
Short-container-title:

Author:

Mahadik Kanak¹,Wu Qingyun²,Li Shuai³,Sabne Amit⁴

Affiliation:

1. Adobe Research

2. University of Virginia

3. Cambridge University, Cambridge, United Kingdom

4. Google Brain

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3392717.3392748

Reference45 articles.

1. Yasin Abbasi-Yadkori Dávid Pál and Csaba Szepesvári. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312--2320. Yasin Abbasi-Yadkori Dávid Pál and Csaba Szepesvári. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312--2320.

2. Automated web usage data mining and recommendation system using K-Nearest Neighbor (KNN) classification method

3. TiVo

4. Amazon. 2017. Amazon EC2 C5 Instances. (2017). https://aws.amazon.com/ec2/instance-types/c5/ Amazon. 2017. Amazon EC2 C5 Instances. (2017). https://aws.amazon.com/ec2/instance-types/c5/

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access Costs;Proceedings of the ACM Web Conference 2024;2024-05-13

2. Non-Stationary Linear Bandits With Dimensionality Reduction for Large-Scale Recommender Systems;IEEE Open Journal of Signal Processing;2024

3. Time Series Clustering for Enhanced Dynamic Allocation in A/B Testing;Lecture Notes in Computer Science;2024

4. Online $$\textrm{L}^{\natural }$$-Convex Minimization;Lecture Notes in Computer Science;2024

5. Cross-region building counting in satellite imagery using counting consistency;Neural Computing and Applications;2023-08-15