Fetching the paper…
Reading the bibliography…
Modern online advertising systems inevitably rely on personalization methods, such as click-through rate (CTR) prediction.
Sparse orthogonal variational inference for gaussian processes. In International Conference on Artificial Intelligence and Statistics . 1932–1942
Jiaxin Shi, Michalis Titsias, and Andriy Mnih. 2020 · 1942
Earlier work this paper cites.
Optimal auction design
Roger B Myerson. 1981 · 1981
Earlier work this paper cites.
Exploring versus exploiting when learning user models for text recommendation
Marko Balabanović. 1998 · 1998
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
Peter Auer. 2002 · 2002
Earlier work this paper cites.
Gaussian Processes for Machine Learning
CE. Rasmussen and CKI. Williams. 2006 · 2006
Earlier work this paper cites.
Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords
Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007 · 2007
Earlier work this paper cites.
Computational advertising and recommender systems. In Proceedings of the 2008 ACM conference on Recommender systems . 1–2
Andrei Z Broder. 2008 · 2008
Earlier work this paper cites.
Deep Bayesian Bandits: Exploring in Online Personalized Recommendations
Dalin Guo, Sofia Ira Ktena, Ferenc Huszar, Pranay Kumar Myana, Wenzhe Shi, and Alykhan Tejani. 2020 · 2008
Earlier work this paper cites.
Learning diverse rankings with multi-armed bandits. In Proceedings of the 25th international conference on Machine learning . 784–791
Filip Radlinski, Robert Kleinberg, and Thorsten Joachims. 2008 · 2008
Earlier work this paper cites.
Variational learning of inducing variables in sparse Gaussian processes. In Artificial Intelligence and Statistics . 567–574
Michalis Titsias. 2009 · 2009
Earlier work this paper cites.
Large-scale machine learning with stochastic gradient descent
Léon Bottou. 2010 · 2010
Earlier work this paper cites.
Parametric bandits: The generalized linear case. In Advances in Neural Information Processing Systems . 586–594
Sarah Filippi, Olivier Cappe, Aurélien Garivier, and Csaba Szepesvári. 2010 · 2010
Earlier work this paper cites.
A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th international conference on World wide web . 661–670
Lihong Li, Wei Chu, John Langford, and Robert E Schapire. 2010 · 2010
Earlier work this paper cites.
An empirical evaluation of thompson sampling. In Advances in neural information processing systems . 2249–2257
Olivier Chapelle and Lihong Li. 2011 · 2011
Earlier work this paper cites.
Contextual bandits with linear payoff functions. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics . 208–214
Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire. 2011 · 2011
Earlier work this paper cites.
Practical variational inference for neural networks. In Advances in neural information processing systems . 2348–2356
Alex Graves. 2011 · 2011
Earlier work this paper cites.
Contextual gaussian process bandit optimization. In Advances in neural information processing systems . 2447–2455
Andreas Krause and Cheng S Ong. 2011 · 2011
Earlier work this paper cites.
Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. In Proceedings of the fourth ACM international conference on Web search and data mining . 297–306
Lihong Li, Wei Chu, John Langford, and Xuanhui Wang. 2011 · 2011
Earlier work this paper cites.
Bayesian learning via stochastic gradient Langevin dynamics. In Proceedings of the 28th international conference on machine learning (ICML-11) . 681–688
Max Welling and Yee W Teh. 2011 · 2011
Cited alongside, same era.
Machine learning: a probabilistic perspective
Kevin P Murphy. 2012 · 2012
Cited alongside, same era.
Information-theoretic regret bounds for gaussian process optimization in the bandit setting
Niranjan Srinivas, Andreas Krause, Sham M Kakade, and Matthias W Seeger. 2012 · 2012
Cited alongside, same era.
Gaussian processes for big data
James Hensman, Nicolo Fusi, and Neil D Lawrence. 2013 · 2013
Cited alongside, same era.
Recommendation as link prediction in bipartite graphs: A graph kernel-based machine learning approach
Xin Li and Hsinchun Chen. 2013 · 2013
Cited alongside, same era.
Simple and scalable predictive uncertainty estimation using deep ensembles. In Advances in neural information processing systems . 6402–6413
Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. 2017 · 2017
Later among the works it cites.
Provably optimal algorithms for generalized linear contextual bandits
Lihong Li, Yu Lu, and Dengyong Zhou. 2017 · 2017
Later among the works it cites.
Doubly stochastic variational inference for deep Gaussian processes. In Advances in Neural Information Processing Systems . 4588–4599
Hugh Salimbeni and Marc Deisenroth. 2017 · 2017
Later among the works it cites.
Optimized cost per click in taobao display advertising. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 2191–2200
Han Zhu, Junqi Jin, Chang Tan, Fei Pan, Yifan Zeng, Han Li, and Kun Gai. 2017 · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The nature of statistical learning theory
Vladimir Vapnik. 2013 · 2013
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba. 2014 · 2014
Cited alongside, same era.
Explore-exploit in top-n recommender systems via gaussian processes. In Proceedings of the 8th ACM Conference on Recommender systems . 225–232
Hastagiri P Vanchinathan, Isidor Nikolic, Fabio De Bona, and Andreas Krause. 2014 · 2014
Cited alongside, same era.
Weight uncertainty in neural networks
Charles Blundell, Julien Cornebise, Koray Kavukcuoglu, and Daan Wierstra. 2015 · 2015
Cited alongside, same era.
Scalable variational Gaussian process classification
James Hensman, Alexander Matthews, and Zoubin Ghahramani. 2015 · 2015
Cited alongside, same era.
Image-based recommendations on styles and substitutes. In Proceedings of the 38th international ACM SIGIR conference on research and development in information retrieval . 43–52
Julian McAuley, Christopher Targett, Qinfeng Shi, and Anton Van Den Hengel. 2015 · 2015
Cited alongside, same era.
The racist algorithm
Anupam Chander. 2016 · 2016
Cited alongside, same era.
How algorithmic confounding in recommendation systems increases homogeneity and decreases utility. In Proceedings of the 12th ACM Conference on Recommender Systems . 224–232
Allison JB Chaney, Brandon M Stewart, and Barbara E Engelhardt. 2018 · 2018
Later among the works it cites.
PG-TS: Improved Thompson sampling for logistic contextual bandits. In Advances in neural information processing systems . 4624–4633
Bianca Dumitrascu, Karen Feng, and Barbara Engelhardt. 2018 · 2018
Later among the works it cites.
Explore, exploit, and explain: personalizing explainable recommendations with bandits. In Proceedings of the 12th ACM Conference on Recommender Systems . 31–39
James McInerney, Benjamin Lacker, Samantha Hansen, Karl Higley, Hugues Bouchard, Alois Gruson, and Rishabh Mehrotra. 2018 · 2018
Later among the works it cites.
Reinforcement Learning: An Introduction
R.S. Sutton and A.G. Barto. 2018 · 2018
Later among the works it cites.
Budget constrained bidding by model-free reinforcement learning in display advertising. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management . 1443–1451
Di Wu, Xiujun Chen, Xun Yang, Hao Wang, Qing Tan, Xiaoxun Zhang, Jian Xu, and Kun Gai. 2018 · 2018
Later among the works it cites.
Deep reinforcement learning for sponsored search real-time bidding. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining . 1021–1030
Jun Zhao, Guang Qiu, Ziyu Guan, Wei Zhao, and Xiaofei He. 2018 · 2018
Later among the works it cites.
Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 1059–1068
Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018 · 2018
Later among the works it cites.
Learning tree-based deep model for recommender systems. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 1079–1088
Han Zhu, Xiang Li, Pengye Zhang, Guozheng Li, Jie He, Han Li, and Kun Gai. 2018 · 2018
Later among the works it cites.
Deep session interest network for click-through rate prediction
Yufei Feng, Fuyu Lv, Weichen Shen, Menghan Wang, Fei Sun, Yu Zhu, and Keping Yang. 2019 · 2019
Later among the works it cites.
Deep interest evolution network for click-through rate prediction. In Proceedings of the AAAI conference on artificial intelligence , Vol. 33. 5941–5948
Guorui Zhou, Na Mou, Ying Fan, Qi Pi, Weijie Bian, Chang Zhou, Xiaoqiang Zhu, and Kun Gai. 2019 · 2019
Later among the works it cites.
How good is the bayes posterior in deep neural networks really?
Florian Wenzel, Kevin Roth, Bastiaan S Veeling, Jakub Świątkowski, Linh Tran, Stephan Mandt, Jasper Snoek, Tim Salimans, Rodolphe Jenatton, and Sebastian Nowozin. 2020 · 2020
Closest in time.
Yahoo! webscope program
Yahoo! [n.d.] · 2020
Closest in time.
Learning Optimal Tree Models under Beam Search
Jingwei Zhuo, Ziru Xu, Wei Dai, Han Zhu, Han Li, Jian Xu, and Kun Gai. 2020 · 2020
Closest in time.