Aligning Learning and Endogenous Decision-Making
Not on the map. Why?
Abstract (arXiv)
Many of the observations we make are biased by our decisions. For instance, the demand of items is impacted by the prices set, and online checkout choices are influenced by the assortments presented. The challenge in decision-making under this setting is the lack of counterfactual information, and the need to learn it instead. We introduce an end-to-end method under endogenous uncertainty to train ML models to be aware of their downstream, enabling their effective use in the decision-making stage. We further introduce a robust optimization variant that accounts for uncertainty in ML models -- specifically by constructing uncertainty sets over the space of ML models and optimizing actions to protect against worst-case predictions. We prove guarantees that this robust approach can capture near-optimal decisions with high probability as a function of data. Besides this, we also introduce a new class of two-stage stochastic optimization problems to the end-to-end learning framework that can now be addressed through our framework. Here, the first stage is an information-gathering problem to decide which random variable to poll and gain information about before making a second-stage decision based off of it. We present several computational experiments for pricing and inventory assortment/recommendation problems. We compare against existing methods in online learning/bandits/offline reinforcement learning and show our approach has consistent improved performance over these. Just as in the endogenous setting, the model's prediction also depends on the first-stage decision made. While this decision does not affect the random variable in this setting, it does affect the correct point forecast that should be made.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 29 references that are in the map. First posted on arXiv 1 Jul 2025.
Builds on
16 of 29 references.
References · 16
- 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,809
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
- 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 599
- 2019Differentiable Convex Optimization Layerscited by 465
- 2021Bellman-consistent Pessimism for Offline Reinforcement Learningcited by 269
- 2019Differentiation of Blackbox Combinatorial Solverscited by 226
- 2021The Statistical Complexity of Interactive Decision Makingcited by 218
- 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 197
- 2019MIPaaL: Mixed Integer Program as a Layercited by 94
- 2019Smart Predict-and-Optimize for Hard Combinatorial Optimization Problemscited by 89
- 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertaintycited by 82
4 more
- 2017MNL-Bandit: A Dynamic Learning Approach to Assortment Selectioncited by 50
- 2021The Value of Information When Deciding What to Learncited by 15
- 2021Assortment Optimization under the Decision Forest Modelcited by 3
- 2023A Doubly Robust Approach to Sparse Reinforcement Learningcited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2021Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
- 2025Bayesian Optimization for Dynamic Pricing and Learning
- 2026Diffusion-Based Data-Driven Assortment Optimization
- 2025Offline Dynamic Inventory and Pricing Strategy: Addressing Censored and Dependent Demand
- 2024A Tale of Two Cities: Pessimism and Opportunism in Offline Dynamic Pricing
- 2026Learning Optimal and Sample-Efficient Decision Policies with Guarantees
- 2024Exploiting Exogenous Structure for Sample-Efficient Reinforcement Learning
- 2026Proximal Residual Value Functions for Consistent Planning and Real-Time Execution