mlsanityData to 7 Oct 2026

Beyond IID: data-driven decision-making in heterogeneous environments

arXiv 2206.09642 ↗First posted 20 Jun 2022cs.LG math.OC stat.MLcited by 9

Not on the map. Why?

Abstract (arXiv)

How should one leverage historical data when past observations are not perfectly indicative of the future, e.g., due to 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 at analyzing the performance of central data-driven policies but also near-optimal ones in these heterogeneous environments and understanding key drivers of performance. We establish a first result which allows 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 -- e.g., 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 towards a principled approach for the design and analysis of general rate-optimal algorithms.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 22 of its 77 references that are in the map. First posted on arXiv 20 Jun 2022.

Builds on

22 of 77 references.

References · 22

  1. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
  2. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  3. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  4. 2018Stochastic bandits robust to adversarial corruptionscited by 118
  5. 2019Corruption-robust exploration in episodic reinforcement learningcited by 72
  6. 2017Efficient Contextual Bandits in Non-stationary Worldscited by 62
  7. 2021Smoothed Analysis with Adaptive Adversariescited by 57
  8. 2022Smoothed Online Learning is as Easy as Statistical Learningcited by 50
  9. 2019Hedging the Drift: Learning to Optimize under Non-Stationaritycited by 46
  10. 2014Robust Sample Average Approximationcited by 25
  11. 2017Learning Whenever Learning is Possible: Universal Learning under General Stochastic Processescited by 23
  12. 2019Multi-Item Mechanisms without Item-Independence: Learnability via Robustnesscited by 22
10 more
  1. 2022Oracle-Efficient Online Learning for Beyond Worst-Case Adversariescited by 19
  2. 2017Learning Multi-item Auctions with (or without) Samplescited by 18
  3. 2014Making the Most of Your Samplescited by 15
  4. 2021On the power of adaptivity in statistical adversariescited by 12
  5. 2022Universal Online Learning: an Optimistically Universal Learning Rulecited by 12
  6. 2021How Big Should Your Data Really Be? Data-Driven Newsvendor: Learning One Sample at a Timecited by 9
  7. 2020Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularizationcited by 8
  8. 2015Randomization beats Second Price as a Prior-Independent Auctioncited by 5
  9. 2018Are Two (Samples) Really Better Than One? On the Non-Asymptotic Performance of Empirical Revenue Maximizationcited by 4
  10. 2021Robust Learning of Optimal Auctionscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 4; 2025: 1; 2026: 2.

9 papers.