skip to main content
10.1145/2348283.2348350acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
research-article

Personalized click shaping through lagrangian duality for online recommendation

Published: 12 August 2012 Publication History

Abstract

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.

References

[1]
D. Agarwal and B.-C. Chen. Regression-based latent factor models. In KDD, 2009.
[2]
D. Agarwal, B.-C. Chen, and P. Elango. Spatio-temporal models for estimating click-through rate. In WWW, 2009.
[3]
D. Agarwal, B.-C. Chen, P. Elango, and et al. Online models for content optimization. In NIPS, 2008.
[4]
D. Agarwal, B.-C. Chen, P. Elango, and X. Wang. Click shaping to optimize multiple objectives. In KDD, 2011.
[5]
P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 2002.
[6]
D. A. Berry and B. Fristedt. Bandit Problems: Sequential Allocation of Experiments. Chapman and Hall, 1985.
[7]
S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
[8]
G. Buscher, L. van Elst, and A. Dengel. Segment-level display time as implicit feedback: a comparison to eye tracking. In SIGIR, 2009.
[9]
Y. Chen, P. Berkhin, B. Anderson, and N. R. Devanur. Real-time bidding algorithms for performance-based display ad allocation. In KDD, 2011.
[10]
A. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In WWW, 2007.
[11]
R. Fain and J. Pederson. Sponsored search: A brief history. Bulletin of American Society of Information and Technology, 2006.
[12]
P. V. Hentenryck and R. Bent. Online Stochastic Combinatorial Optimization. The MIT Press, 2006.
[13]
J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In SIGIR, 1999.
[14]
T. Jambor and J. Wang. Optimizing multiple objectives in collaborative filtering. In RecSys, 2010.
[15]
Y. Koren. Collaborative filtering with temporal dynamics. In KDD, 2009.
[16]
J. Langford and T. Zhang. The epoch-greedy algorithm for contextual multi-armed bandits. In NIPS, 2008.
[17]
L. Li, W. Chu, J. Langford, and R. E. Schapire. A contextual-bandit approach to personalized news article recommendation. In WWW, 2010.
[18]
L. Li, W. Chu, J. Langford, and X. Wang. Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. In WSDM, 2011.
[19]
L. Li, D. Wang, T. Li, D. Knox, and B. Padmanabhan. Scene: a scalable two-stage personalized news recommendation system. In SIGIR, 2011.
[20]
J. Liu, P. Dolan, and E. R. Pedersen. Personalized news recommendation based on click behavior. In IUI, 2010.
[21]
D. Sculley, R. G. Malkin, S. Basu, and R. J. Bayardo. Predicting bounce rates in sponsored search advertisements. In KDD, 2009.
[22]
D. H. Stern, R. Herbrich, and T. Graepel. Matchbox: large scale online bayesian recommendations. In WWW, 2009.
[23]
R. Steuer. Multi-criteria optimization: theory, computation, and application. Wiley, 1986.
[24]
K. M. Svore, M. N. Volkovs, and C. J. C. Burges. Learning to rank with multiple objective functions. In WWW, 2011.
[25]
E. Vee, S. Vassilvitski, and J. Shanmugasundaran. Optimal online assignment with forecasts. In EC, 2010.
[26]
J. Vermorel and M. Mohri. Multi-armed bandit algorithms and empirical evaluation. In ECML, 2005.
[27]
Y. Zhang, J. P. Callan, and T. P. Minka. Novelty and redundancy detection in adaptive filtering. In SIGIR, 2002.

Cited By

View all
  • (2025)Recommending for a Multi-Sided Marketplace: A Multi-Objective Hierarchical ApproachMarketing Science10.1287/mksc.2022.023844:1(1-29)Online publication date: Jan-2025
  • (2023)Understanding the Research Challenges in Low-Resource Language and Linking Bilingual News Articles in Multilingual News ArchiveApplied Sciences10.3390/app1315856613:15(8566)Online publication date: 25-Jul-2023
  • (2023)The Role of Transliterated Words in Linking Bilingual News Articles in an ArchiveApplied Sciences10.3390/app1307443513:7(4435)Online publication date: 31-Mar-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
August 2012
1236 pages
ISBN:9781450314725
DOI:10.1145/2348283
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. click shaping
  2. dual plan
  3. personalization

Qualifiers

  • Research-article

Conference

SIGIR '12
Sponsor:

Acceptance Rates

Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)47
  • Downloads (Last 6 weeks)3
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Recommending for a Multi-Sided Marketplace: A Multi-Objective Hierarchical ApproachMarketing Science10.1287/mksc.2022.023844:1(1-29)Online publication date: Jan-2025
  • (2023)Understanding the Research Challenges in Low-Resource Language and Linking Bilingual News Articles in Multilingual News ArchiveApplied Sciences10.3390/app1315856613:15(8566)Online publication date: 25-Jul-2023
  • (2023)The Role of Transliterated Words in Linking Bilingual News Articles in an ArchiveApplied Sciences10.3390/app1307443513:7(4435)Online publication date: 31-Mar-2023
  • (2022)Recommending for a multi-sided marketplace with heterogeneous contentsProceedings of the 16th ACM Conference on Recommender Systems10.1145/3523227.3547379(456-459)Online publication date: 12-Sep-2022
  • (2021)Algorithmic Balancing of Familiarity, Similarity, & Discovery in Music RecommendationsProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3481893(3996-4005)Online publication date: 26-Oct-2021
  • (2020)ECLIPSEProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3525004(704-714)Online publication date: 13-Jul-2020
  • (2020)Bandit based Optimization of Multiple Objectives on a Music Streaming PlatformProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403374(3224-3233)Online publication date: 23-Aug-2020
  • (2020)Solving Billion-Scale Knapsack ProblemsProceedings of The Web Conference 202010.1145/3366423.3380084(3105-3111)Online publication date: 20-Apr-2020
  • (2020)Sample-Rank: Weak Multi-Objective Recommendations Using Rejection Sampling2020 International Conference on Data Mining Workshops (ICDMW)10.1109/ICDMW51313.2020.00096(683-689)Online publication date: Nov-2020
  • (2020)A Real-Time Whole Page Personalization Framework for E-Commerce2020 IEEE International Conference on Big Data (Big Data)10.1109/BigData50022.2020.9378254(4646-4650)Online publication date: 10-Dec-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media