We propose a novel procedure for correcting for the effects of sampling and parameter uncertainty in data-driven convex optimization. We consider the data-driven setting wherein the distribution lies in a parametric family with unknown parameter. The decision-maker possesses a historical data set, from which solves a prescriptive solution as a function mapping such a data set to decisions, and measures its out-of-sample performance as an average over data sets of the same size under the sampling distribution. As the parameter is unknown to the decision-maker, we argue that this problem is ill-defined and further prove that there cannot exist solutions generalizably optimal over all parameters. As such, we formulate the problem as a weighted multi-criteria optimization with weights defined by a density (termed ‘prior’) over the uncertain parameter, and call its optimal solution prior optimal. We prove that sufficient conditions for prior optimality reduces to functions of the sufficient statistic of the parametric family, and this function can be solved as a point-wise optima of a corrected function of the original objective, with terms accounting for parameter uncertainty and sampling uncertainty respectively. The correction for sampling interpretation is verified by a close to (but not) zero ex-ante regret against a perfect information oracle in numerical illustrations on the newsvendor and portfolio optimization problems.
We study Bayesian optimization of the Conditional Value-at-Risk (CVaR) of an expensive black-box function that depends on a decision and an environmental variable. Existing no-regret algorithms assume that the correct Gaussian process (GP) kernel and its hyperparameters are known. In practice, however, they must be est...
Valentin Margraf, Jonas Hanselle, Viktor Bengs et al.· 0 citations
We study preference elicitation under the Bradley-Terry-Luce (BTL) model where the true partworth vector is unknown and has to be estimated as a parameter with elicited preference information. The set of selected pairwise queries is non-uniform, deterministic, and arbitrary over a collection of alternatives, provided t...
In robust optimization, budgeted uncertainty sets offer a popular trade-off between modeling flexibility and computational tractability. Data that is observed in practice is often discrete in nature, which creates the need for tools to construct budgeted uncertainty sets based on observed data. This paper presents a pr...
Jamie Fairbrother, Marc Goerigk, Qiong-Yan Zeng· 0 citations
The algorithm is parameterized so as to address various stochastic formulations spanning from Expectation-focused to Value-at-Risk (VaR) as well as Conditional-Value-at-Risk (CVaR) as well as Conditional-Value-at-Risk (CVaR)-focused formulations.
Motivated by many application problems, we consider Markov decision processes (MDPs) with a general loss function and unknown parameters. To mitigate the epistemic uncertainty associated with unknown parameters, we take a Bayesian approach to estimate the parameters from data and impose a coherent risk functional (with...
This paper considers the Bayesian top-$k$ identification problem, wherein a decision maker is tasked with selecting $k$ items from a pool of items of unknown quality. To assess the items, the decision maker adaptively allocates a fixed sampling budget, where each sample of an item yields a noisy observation of its qual...
M. Goldberger, N. Rudi· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.