This work proposes an approach to evaluating policies that provides tighter performance guarantees if the decision maker's belief happens to be correct, and shows that if computing a policy's worst-case performance is a convex program, then the value of human expertise is equal to the minimax gap of a max-min problem.
Abstract
We consider optimization applications with unknown parameters where the decision maker believes that the optimal value of the nominal problem-the optimization problem they would have solved if the true parameters were known-is unlikely to be large. This belief derives from information that humans have that is not captured in datasets, obtained from domain knowledge and interacting with the physical world. We propose an approach to evaluating policies that provides tighter performance guarantees if the decision maker's belief happens to be correct. Our main result shows that if computing a policy's worst-case performance is a convex program, then the value of human expertise-the maximum improvement in performance guarantees that can be obtained from the belief about the nominal problem-is equal to the minimax gap of a max-min problem. We illustrate our developments in assortment optimization and shortest path problems.
This lecture note develops, from first principles and within a single decision-theoretic setting, the link between the decision objective and the knowledge of an agent and the form of uncertainty representation that is sufficient to act optimally.
This work develops an inverse optimization approach to jointly learn the decision-maker's preferences and the decision rules governing their choices, which leads to better predictions and greater flexibility in capturing and replicating expert decision making.
Anurag Holani, Rishabh Gupta, J. Wassick et al.· 1 citation
Sequential decision-making in real-world applications often involves uncertainty about the environment's model. Uncertain Markov decision processes (UMDPs) represent the possible environments as a set of MDPs with shared states and actions but potentially different transition probabilities and rewards. Optimizing a sin...
A decision-aware approximation that targets the regret of the decision is introduced that can be turned into an exact dynamic program for the scalar case, and extended to an online version that prunes focal elements before the final cost is known.
Many design tasks can be cast as black-box function optimization, enabling use of Bayesian optimization to find an ideal design with minimal number of trials. However, often we do not actually need the optimum but instead a sufficiently good solution is enough, for instance a material that is durable enough for its int...
Samuli Kinnunen, P. Mikkola, Antti Niskanen et al.· arXiv.org· 0 citations
In real-world decision-making problems, one needs to pick among multiple policies the one that performs best while respecting economic constraints. This motivates the problem of constrained best-arm identification for bandit problems where every arm is a joint distribution of reward and cost. We investigate the general...
Tyron Lardy, Christina Katsimerou, Wouter M. Koolen· Neural Information Processin...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.