arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.10696stat.MLcs.LGmath.OCmath.STstat.TH
收藏

从观测数据中稳健的 assortment 优化

Robust Assortment Optimization from Observational Data

Miao Lu, Yuxuan Han, Han Zhong, Zhengyuan Zhou, Jose Blanchet

AI总结:

本文提出了一种稳健的数据驱动 assortments 优化框架,通过考虑客户选择行为的潜在分布变化,实现了样本高效且稳健的 assortments 学习。

摘要:

assortment 优化是现代零售和推荐系统中的基本挑战,其目标是在复杂的客户选择行为下选择一个产品子集以最大化预期收益。尽管最近的数据驱动方法利用历史数据来学习和优化 assortments,但这些方法通常依赖于强假设——即客户偏好稳定性和底层选择模型的正确性。然而,由于偏好变化和模型不规范,这些假设在现实世界中经常失效,导致泛化能力差和收益损失。受此限制的启发,我们提出了一种稳健的数据驱动 assortment 优化框架,以考虑潜在的客户选择行为分布变化。我们的方法从一个名义选择模型生成数据,并试图最大化最坏情况下的预期收益。我们首先建立了当名义模型已知时稳健 assortments 规划的计算可行性,然后推进到数据驱动的场景,其中我们设计了统计最优的算法,以最小化数据需求同时保持稳健性。我们的理论分析提供了样本复杂度的上界和匹配下界,为稳健泛化提供了理论保证。值得注意的是,我们揭示并识别了“稳健的 item-wise 覆盖”作为实现样本高效稳健 assortments 学习的最小数据需求。我们的工作弥合了稳健性和统计效率在 assortments 学习之间的差距,为在不确定性下可靠的 assortments 优化提供了新的见解和工具。

英文摘要:

Assortment optimization is a fundamental challenge in modern retail and recommendation systems, where the goal is to select a subset of products that maximizes expected revenue under complex customer choice behaviors. While recent advances in data-driven methods have leveraged historical data to learn and optimize assortments, these approaches typically rely on strong assumptions -- namely, the stability of customer preferences and the correctness of the underlying choice models. However, such assumptions frequently break in real-world scenarios due to preference shifts and model misspecification, leading to poor generalization and revenue loss. Motivated by this limitation, we propose a robust framework for data-driven assortment optimization that accounts for potential distributional shifts in customer choice behavior. Our approach models potential preference shift from a nominal choice model that generates data and seeks to maximize worst-case expected revenue. We first establish the computational tractability of robust assortment planning when the nominal model is known, then advance to the data-driven setting, where we design statistically optimal algorithms that minimize the data requirements while maintaining robustness. Our theoretical analysis provides both upper bounds and matching lower bounds on the sample complexity, offering theoretical guarantees for robust generalization. Notably, we uncover and identify the notion of ``robust item-wise coverage'' as the minimal data requirement to enable sample-efficient robust assortment learning. Our work bridges the gap between robustness and statistical efficiency in assortment learning, contributing new insights and tools for reliable assortment optimization under uncertainty.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑