Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem
원문 초록
Motivated by the phenomenon that companies introduce new products to keep abreast with customers' rapidly changing tastes, we consider a novel online learning setting where a profit-maximizing seller needs to learn customers' preferences through offering recommendations, which may contain existing products and new products that are launched in the middle of a selling period. We propose a sequential multinomial logit (SMNL) model to characterize customers' behavior when product recommendations are presented in tiers. For the offline version with known customers' preferences, we propose a polynomial-time algorithm and characterize the properties of the optimal tiered product recommendation. For the online problem, we propose a learning algorithm and quantify its regret bound. Moreover, we extend the setting to incorporate a constraint which ensures every new product is learned to a given accuracy. Our results demonstrate the tier structure can be used to mitigate the risks associated with learning new products.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization
FeatInsight: An Online ML Feature Management System on 4Paradigm Sage-Studio Platform
Recommender systems and reinforcement learning for human-building interaction and context-aware support: A text mining-driven review of scientific literature
Harnessing the Power of Semi-Structured Knowledge and LLMs with Triplet-Based Prefiltering for Question Answering
Estimating Heterogeneous Treatment Effects by Combining Weak Instruments and Observational Data
Using LLMs for the Extraction and Normalization of Product Attribute Values
토론
이 논문과 연결된 포럼 글이 아직 없습니다.