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.
Learning an Optimal Assortment Policy under Observational Data
Stern School of Business, New York University(纽约大学斯特恩商学院);Center for Data Science, Peking University(北京大学数据科学中心);Department of Management Science & Engineering, Stanford University(斯坦福大学管理科学与工程系)
Purdue University(普渡大学);Department of Statistics, Purdue University(普渡大学统计系);Mitchell E. Daniels, Jr. School of Business, Purdue University(普渡大学米切尔·E·丹尼尔斯 Jr.商学院)
Multi-CATE: Multi-Accurate Conditional Average Treatment Effect Estimation Robust to Unknown Covariate Shifts
Ludwig-Maximilians-University of Munich(慕尼黑大学);Munich Center for Machine Learning (MCML)(慕尼黑机器学习中心);Cornell University(康奈尔大学);University of Southern California(南加州大学)
Combining Experimental and Observational Data for Identification and Estimation of Long-Term Causal Effects
Boston University(波士顿大学);Stanford University(斯坦福大学);University of California, Irvine(加州大学尔湾分校);Johns Hopkins University(约翰斯·霍普金斯大学);University of Pennsylvania(宾夕法尼亚大学)
本文融合存在未观测混杂的观测数据与仅有短期随访的实验数据,提出三类长期因果效应识别假设及基于影响函数的估计方法,并以班级规模对 SAT 分数的影响进行实证验证。