IDEAS home Printed from https://ideas.repec.org/a/inm/ormksc/v44y2025i5p995-1016.html

LOLA: LLM-Assisted Online Learning Algorithm for Content Experiments

Author

Listed:
  • Zikun Ye

    (University of Washington, Seattle, Washington 98195)

  • Hema Yoganarasimhan

    (University of Washington, Seattle, Washington 98195)

  • Yufeng Zheng

    (University of Toronto, Toronto, Ontario M5S 1A1, Canada)

Abstract

Modern media firms require automated and efficient methods to identify content that is most engaging and appealing to users. Leveraging a large-scale data set from Upworthy (a news publisher), which includes 17,681 headline A/B tests, we first investigate the ability of three pure–large language model (LLM) approaches to identify the catchiest headline: prompt-based methods, embedding-based methods, and fine-tuned open-source LLMs. Prompt-based approaches perform poorly, while both OpenAI embedding–based models and the fine-tuned Llama-3-8B achieve marginally higher accuracy than random predictions. In sum, none of the pure LLM–based methods can predict the best-performing headline with high accuracy. We then introduce the LLM-assisted online learning algorithm (LOLA), a novel framework that integrates LLMs with adaptive experimentation to optimize content delivery. LOLA combines the best pure-LLM approach with the upper confidence bound algorithm to allocate traffic and maximize clicks adaptively. Our numerical experiments on Upworthy data show that LOLA outperforms the standard A/B test method (the current status quo at Upworthy), pure bandit algorithms, and pure-LLM approaches, particularly in scenarios with limited experimental traffic. Our approach is scalable and applicable to content experiments across various settings where firms seek to optimize user engagement, including digital advertising and social media recommendations.

Suggested Citation

  • Zikun Ye & Hema Yoganarasimhan & Yufeng Zheng, 2025. "LOLA: LLM-Assisted Online Learning Algorithm for Content Experiments," Marketing Science, INFORMS, vol. 44(5), pages 995-1016, September.
  • Handle: RePEc:inm:ormksc:v:44:y:2025:i:5:p:995-1016
    DOI: 10.1287/mksc.2024.0990
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mksc.2024.0990
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mksc.2024.0990?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Eric M. Schwartz & Eric T. Bradlow & Peter S. Fader, 2017. "Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments," Marketing Science, INFORMS, vol. 36(4), pages 500-522, July.
    2. Lalit Jain & Zhaoqi Li & Erfan Loghmani & Blake Mason & Hema Yoganarasimhan, 2024. "Effective Adaptive Exploration of Prices and Promotions in Choice-Based Demand Models," Marketing Science, INFORMS, vol. 43(5), pages 1002-1030, September.
    3. Hema Yoganarasimhan & Irina Iakovetskaia, 2024. "From Feeds to Inboxes: A Comparative Study of Polarization in Facebook and Email News Sharing," Management Science, INFORMS, vol. 70(9), pages 6461-6472, September.
    4. Hema Yoganarasimhan, 2020. "Search Personalization Using Machine Learning," Management Science, INFORMS, vol. 66(3), pages 1045-1070, March.
    5. Peiyao Li & Noah Castelo & Zsolt Katona & Miklos Sarvary, 2024. "Frontiers: Determining the Validity of Large Language Models for Automated Perceptual Analysis," Marketing Science, INFORMS, vol. 43(2), pages 254-266, March.
    6. Omid Rafieian & Hema Yoganarasimhan, 2021. "Targeting and Privacy in Mobile Advertising," Marketing Science, INFORMS, vol. 40(2), pages 193-218, March.
    7. Kanishka Misra & Eric M. Schwartz & Jacob Abernethy, 2019. "Dynamic Online Pricing with Incomplete Information Using Multiarmed Bandit Experiments," Marketing Science, INFORMS, vol. 38(2), pages 226-252, March.
    8. Nicolás Aramayo & Mario Schiappacasse & Marcel Goic, 2023. "A Multiarmed Bandit Approach for House Ads Recommendations," Marketing Science, INFORMS, vol. 42(2), pages 271-292, March.
    9. Daniel Russo & Benjamin Van Roy, 2014. "Learning to Optimize via Posterior Sampling," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1221-1243, November.
    10. David Simchi-Levi & Yunzong Xu, 2022. "Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability," Mathematics of Operations Research, INFORMS, vol. 47(3), pages 1904-1931, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hongshen Sun & Juanjuan Zhang, 2025. "From Model Choice to Model Belief: Establishing a New Measure for LLM-Based Research," Papers 2512.23184, arXiv.org.
    2. George Gui & Seungwoo Kim, 2025. "Leveraging LLMs to Improve Experimental Design: A Generative Stratification Approach," Papers 2509.25709, arXiv.org.
    3. Herhausen, Dennis & Ludwig, Stephan & Abedin, Ehsan & Haque, Nasim Ul & de Jong, David, 2025. "From words to insights: Text analysis in business research," Journal of Business Research, Elsevier, vol. 198(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lalit Jain & Zhaoqi Li & Erfan Loghmani & Blake Mason & Hema Yoganarasimhan, 2024. "Effective Adaptive Exploration of Prices and Promotions in Choice-Based Demand Models," Marketing Science, INFORMS, vol. 43(5), pages 1002-1030, September.
    2. Pengjie Zhou & Haoyu Wei & Huiming Zhang, 2024. "Selective Reviews of Bandit Problems in AI via a Statistical View," Papers 2412.02251, arXiv.org, revised Feb 2025.
    3. Omid Rafieian, 2023. "Optimizing User Engagement Through Adaptive Ad Sequencing," Marketing Science, INFORMS, vol. 42(5), pages 910-933, September.
    4. Hangcheng Zhao & Ron Berman, 2025. "Algorithmic Collusion of Pricing and Advertising on E-commerce Platforms," Papers 2508.08325, arXiv.org, revised Oct 2025.
    5. Hema Yoganarasimhan & Ebrahim Barzegary & Abhishek Pani, 2023. "Design and Evaluation of Optimal Free Trials," Management Science, INFORMS, vol. 69(6), pages 3220-3240, June.
    6. Haihao Lu & Duncan Simester & Yuting Zhu, 2025. "Optimizing Scalable Targeted Marketing Policies with Constraints," Marketing Science, INFORMS, vol. 44(5), pages 1082-1103, September.
    7. Z. Eddie Ning & Jiwoong Shin & Jungju Yu, 2025. "Targeted Advertising as Implicit Recommendation: Strategic Mistargeting and Personal Data Opt-out," Marketing Science, INFORMS, vol. 44(2), pages 390-410, March.
    8. Preil, Deniz & Krapp, Michael, 2022. "Bandit-based inventory optimisation: Reinforcement learning in multi-echelon supply chains," International Journal of Production Economics, Elsevier, vol. 252(C).
    9. Tianshu Sun & Zhe Yuan & Chunxiao Li & Kaifu Zhang & Jun Xu, 2024. "The Value of Personal Data in Internet Commerce: A High-Stakes Field Experiment on Data Regulation Policy," Management Science, INFORMS, vol. 70(4), pages 2645-2660, April.
    10. Yuyan Wang & Long Tao & Xian Xing Zhang, 2025. "Recommending for a Multi-Sided Marketplace: A Multi-Objective Hierarchical Approach," Marketing Science, INFORMS, vol. 44(1), pages 1-29, January.
    11. Davide Proserpio & John R. Hauser & Xiao Liu & Tomomichi Amano & Alex Burnap & Tong Guo & Dokyun (DK) Lee & Randall Lewis & Kanishka Misra & Eric Schwarz & Artem Timoshenko & Lilei Xu & Hema Yoganaras, 2020. "Soul and machine (learning)," Marketing Letters, Springer, vol. 31(4), pages 393-404, December.
    12. Vinay Singh & Brijesh Nanavati & Arpan Kumar Kar & Agam Gupta, 2023. "How to Maximize Clicks for Display Advertisement in Digital Marketing? A Reinforcement Learning Approach," Information Systems Frontiers, Springer, vol. 25(4), pages 1621-1638, August.
    13. Garrett Johnson & Julian Runge & Eric Seufert, 2022. "Privacy-Centric Digital Advertising: Implications for Research," Customer Needs and Solutions, Springer;Institute for Sustainable Innovation and Growth (iSIG), vol. 9(1), pages 49-54, June.
    14. Elea McDonnell Feit & Ron Berman, 2019. "Test & Roll: Profit-Maximizing A/B Tests," Marketing Science, INFORMS, vol. 38(6), pages 1038-1058, November.
    15. Unnati Narang & Fernando Luco, 2025. "Privacy and prediction: how useful are geo-tracking data for predicting consumer visits?," Quantitative Marketing and Economics (QME), Springer, vol. 23(4), pages 523-544, December.
    16. Nicolás Aramayo & Mario Schiappacasse & Marcel Goic, 2023. "A Multiarmed Bandit Approach for House Ads Recommendations," Marketing Science, INFORMS, vol. 42(2), pages 271-292, March.
    17. Ali Goli & Anja Lambrecht & Hema Yoganarasimhan, 2024. "A Bias Correction Approach for Interference in Ranking Experiments," Marketing Science, INFORMS, vol. 43(3), pages 590-614, May.
    18. Ian N. Weaver & Vineet Kumar & Lalit Jain, 2025. "Nonparametric Pricing Bandits Leveraging Informational Externalities to Learn the Demand Curve," Marketing Science, INFORMS, vol. 44(6), pages 1299-1320, November.
    19. Hanyao Gao & Gang Kou & Haiming Liang & Hengjie Zhang & Xiangrui Chao & Cong-Cong Li & Yucheng Dong, 2024. "Machine learning in business and finance: a literature review and research opportunities," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 10(1), pages 1-35, December.
    20. Po-Yi Liu & Chi-Hua Wang & Henghsiu Tsai, 2022. "Non-Stationary Dynamic Pricing Via Actor-Critic Information-Directed Pricing," Papers 2208.09372, arXiv.org, revised Sep 2022.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormksc:v:44:y:2025:i:5:p:995-1016. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.