Asymptotic Optimality in Data-Driven Decision Making
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913968050667520 |
|---|---|
| author | Salač, Radek Kupper, Michael Sutter, Tobias |
| author_facet | Salač, Radek Kupper, Michael Sutter, Tobias |
| contents | Given data generated by an observable stochastic process, we study how to construct statistically optimal decisions for general stochastic optimization problems. Our setting encompasses non-standard data structures, including data originating from heterogeneous sources or from randomly evolving data-generating mechanisms. We propose a decision-making approach that identifies optimal decisions for which a specific notion of risk of shifted regret decays to zero at a prescribed exponential rate. This optimal decision arises as the solution to a multi-objective optimization problem, which reflects asymptotic behavior properties of the data-generating process. Central to our framework is a rate function that characterizes this behavior via a Laplace principle, thereby generalizing standard concepts from large deviation theory. Our general formulation enables our approach to account for data from uncertain distributions and recovers classical results in data-driven decision making under uncertainty as special cases, including distributionally robust optimization. Moreover, our method enables decision-makers to systematically balance a desired rate of asymptotic risk decay against a potential loss in statistical consistency of the resulting data-driven decision. We demonstrate the effectiveness of the proposed approach through illustrative examples from operations research, such as the newsvendor problem, under aleatoric uncertainty induced by heterogeneous data sources. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_15215 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Asymptotic Optimality in Data-Driven Decision Making Salač, Radek Kupper, Michael Sutter, Tobias Optimization and Control Probability Given data generated by an observable stochastic process, we study how to construct statistically optimal decisions for general stochastic optimization problems. Our setting encompasses non-standard data structures, including data originating from heterogeneous sources or from randomly evolving data-generating mechanisms. We propose a decision-making approach that identifies optimal decisions for which a specific notion of risk of shifted regret decays to zero at a prescribed exponential rate. This optimal decision arises as the solution to a multi-objective optimization problem, which reflects asymptotic behavior properties of the data-generating process. Central to our framework is a rate function that characterizes this behavior via a Laplace principle, thereby generalizing standard concepts from large deviation theory. Our general formulation enables our approach to account for data from uncertain distributions and recovers classical results in data-driven decision making under uncertainty as special cases, including distributionally robust optimization. Moreover, our method enables decision-makers to systematically balance a desired rate of asymptotic risk decay against a potential loss in statistical consistency of the resulting data-driven decision. We demonstrate the effectiveness of the proposed approach through illustrative examples from operations research, such as the newsvendor problem, under aleatoric uncertainty induced by heterogeneous data sources. |
| title | Asymptotic Optimality in Data-Driven Decision Making |
| topic | Optimization and Control Probability |
| url | https://arxiv.org/abs/2507.15215 |