Beyond IID: data-driven decision-making in heterogeneous environments
Omar Besbes, Will Ma, Omar Mouchtaki
摘要
How should one leverage historical data when past observations are not perfectly indicative of the future, for example, because of the presence of unobserved confounders which one cannot “correct” for? Motivated by this question, we study a data-driven decision-making framework in which historical samples are generated from unknown and different distributions assumed to lie in a heterogeneity ball with known radius and centered around the (also) unknown future (out-of-sample) distribution on which the performance of a decision will be evaluated. This work aims to analyze the performance of central data-driven policies and also near-optimal ones in these heterogeneous environments, and it aims to understand key drivers of performance. We establish a first result that allows us to upper bound the asymptotic worst-case regret of a broad class of policies. Leveraging this result, for any integral probability metric, we provide a general analysis of the performance achieved by sample average approximation (SAA) as a function of the radius of the heterogeneity ball. This analysis is centered around the approximation parameter, a notion of complexity we introduce to capture how the interplay between the heterogeneity and the problem structure impacts the performance of SAA. In turn, we illustrate, through several widely studied problems—for example, newsvendor, pricing—how this methodology can be applied and find that the performance of SAA varies considerably depending on the combinations of problem classes and heterogeneity. The failure of SAA for certain instances motivates the design of alternative policies to achieve rate optimality. We derive problem-dependent policies achieving strong guarantees for the illustrative problems described above and provide initial results toward a principled approach for the design and analysis of general rate-optimal algorithms. This paper was accepted by Vivek Farias, data science. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2022.03448 .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Binary Search with Distributional PredictionsMichael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley 等NeurIPS 2024 · 被引用 20 次
- Online Algorithms with Uncertainty-Quantified PredictionsBo Sun, Jerry Huang, Nicolas Christianson, Mohammad Hajiesmaili 等ICML 2024 · 被引用 12 次
- Leveraging (Biased) Information: Multi-armed Bandits with Offline DataWang Chi Cheung, Lixing LyuICML 2024 · 被引用 3 次
- Robust and Consistent Ski Rental with Distributional AdviceJihwan Kim, Chenglin FanICML 2026 · 被引用 1 次
- Ski Rental with Distributional Predictions of Unknown QualityQiming Cui, Michael DinitzICML 2026
它引用的顶会 Paper2
相关 Paper
- Selling Data To a Machine Learner: Pricing via Costly SignalingJunjie Chen, Minming Li, Haifeng XuICML 2022 · 被引用 32 次
- The Bias-Variance Tradeoff in Data-Driven Optimization: A Local Misspecification PerspectiveHaixiang Lan, Luofeng Liao, Adam N. Elmachtoub, Christian Kroer 等NeurIPS 2025 · 被引用 4 次
- Data-driven Competitive Algorithms for Online Knapsack and Set CoverAli Zeynali, Bo Sun, Mohammad Hassan Hajiesmaili, Adam WiermanAAAI 2021 · 被引用 41 次
- On The Statistical Complexity of Offline Decision-MakingThanh Nguyen-Tang, Raman AroraICML 2024 · 被引用 2 次
- Geometry-Aware Approaches for Balancing Performance and Theoretical Guarantees in Linear BanditsYuwei Luo, Mohsen BayatiICLR 2025
