Personalized click shaping through lagrangian duality for online recommendation

Online content recommendation aims to identify trendy articles in a continuously changing dynamic content pool. Most of existing works rely on online user feedback, notably clicks, as the objective and maximize it by showing articles with highest click-through rates. Recently, click shaping was introduced to incorporate multiple objectives in a constrained optimization framework. The work showed that significant tradeoff among the competing objectives can be observed and thus it is important to consider multiple objectives. However, the proposed click shaping approach is segment-based and can only work with a few non-overlapping user segments. It remains a challenge of how to enable deep personalization in click shaping. In this paper, we tackle the challenge by proposing personalized click shaping. The main idea is to work with the Lagrangian duality formulation and explore strong convexity to connect dual and primal solutions. We show that our formulation not only allows efficient conversion from dual to primal for online personalized serving, but also enables us to solve the optimization faster by approximation. We conduct extensive experiments on a large real data set and our experimental results show that the personalized click shaping can significantly outperform the segmented one, while achieving the same ability to balance competing objectives.

[1]  Deepak Agarwal,et al.  Spatio-temporal models for estimating click-through rate , 2009, WWW '09.

[2]  Wei Chu,et al.  A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.

[3]  Balaji Padmanabhan,et al.  SCENE: a scalable two-stage personalized news recommendation system , 2011, SIGIR.

[4]  Jiahui Liu,et al.  Personalized news recommendation based on click behavior , 2010, IUI '10.

[5]  D. Sculley,et al.  Predicting bounce rates in sponsored search advertisements , 2009, KDD.

[6]  Abhinandan Das,et al.  Google news personalization: scalable online collaborative filtering , 2007, WWW '07.

[7]  P. W. Jones,et al.  Bandit Problems, Sequential Allocation of Experiments , 1987 .

[8]  Maksims Volkovs,et al.  Learning to rank with multiple objective functions , 2011, WWW.

[9]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[10]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[11]  Jun Wang,et al.  Optimizing multiple objectives in collaborative filtering , 2010, RecSys '10.

[12]  Wei Chu,et al.  Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms , 2010, WSDM '11.

[13]  Nikhil R. Devanur,et al.  Real-time bidding algorithms for performance-based display ad allocation , 2011, KDD.

[14]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[15]  Yehuda Koren,et al.  Collaborative filtering with temporal dynamics , 2009, KDD.

[16]  John Riedl,et al.  An algorithmic framework for performing collaborative filtering , 1999, SIGIR '99.

[17]  Deepak Agarwal,et al.  Online Models for Content Optimization , 2008, NIPS.

[18]  Mehryar Mohri,et al.  Multi-armed Bandit Algorithms and Empirical Evaluation , 2005, ECML.

[19]  Yi Zhang,et al.  Novelty and redundancy detection in adaptive filtering , 2002, SIGIR '02.

[20]  Daniel C. Fain,et al.  Sponsored search: A brief history , 2006 .

[21]  Deepak Agarwal,et al.  Click shaping to optimize multiple objectives , 2011, KDD.

[22]  Andreas Dengel,et al.  Segment-level display time as implicit feedback: a comparison to eye tracking , 2009, SIGIR.

[23]  Sergei Vassilvitskii,et al.  Optimal online assignment with forecasts , 2010, EC '10.

[24]  J. Langford,et al.  The Epoch-Greedy algorithm for contextual multi-armed bandits , 2007, NIPS 2007.

[25]  Deepak Agarwal,et al.  Regression-based latent factor models , 2009, KDD.

[26]  Thore Graepel,et al.  WWW 2009 MADRID! Track: Data Mining / Session: Statistical Methods Matchbox: Large Scale Online Bayesian Recommendations , 2022 .

[27]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.