arXiv subjects

Karthik Natarajan

Publications and source records attributed to Karthik Natarajan.

22 records · Page 2Linked to original sources

arXiv2019

Tree Bounds for Sums of Bernoulli Random Variables: A Linear Optimization Approach

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a complete graph, the bounds are NP-hard to compute. When the bivariate distributions are specified on a tree graph, we show that tight bounds are computable in polynomial time using linear optimization. These bounds provide robust probability estimates when the assumption of conditional independence in a tree structured graphical model is violated. Generalization of the result to finding probability bounds of order statistic for more general random variables and instances where the bounds provide the most significant improvements over univariate bounds is also discussed in the paper.

math.OC↗

arXiv2019

On the heavy-tail behavior of the distributionally robust newsvendor

Since the seminal work of Scarf (1958) [A min-max solution of an inventory problem, Studies in the Mathematical Theory of Inventory and Production, pages 201-209] on the newsvendor problem with ambiguity in the demand distribution, there has been a growing interest in the study of the distributionally robust newsvendor problem. The model is criticized at times for being overly conservative since the worst-case distribution is discrete with a few support points. However, it is the order quantity prescribed from the model that is of practical relevance. A simple calculation shows that the optimal order quantity in Scarf's model with known first and second moment is also optimal for a censored student-t distribution with parameter 2. In this paper, we generalize this "heavy-tail optimality" property of the distributionally robust newsvendor to an ambiguity set where information on the first and the $α$th moment is known, for any real number $α> 1$. We show that the optimal order quantity for the distributionally robust newsvendor problem is also optimal for a regularly varying distribution with roughly a power law tail with tail index $α$. We illustrate the usefulness of the model in the high service level regime with numerical experiments, by showing that when a standard distribution such as the exponential or lognormal distribution is contaminated with a heavy-tailed (regularly varying) distribution, the distributionally robust optimal order quantity outperforms the optimal order quantity of the original distribution, even with a small amount of contamination.

math.ST↗

arXiv2018

Exploiting Partial Correlations in Distributionally Robust Optimization

In this paper, we identify partial correlation information structures that allow for simpler reformulations in evaluating the maximum expected value of mixed integer linear programs with random objective coefficients. To this end, assuming only the knowledge of the mean and the covariance matrix entries restricted to block-diagonal patterns, we develop a reduced semidefinite programming formulation, the complexity of solving which is related to characterizing a suitable projection of the convex hull of the set $\{(\bold{x}, \bold{x}\bold{x}'): \bold{x} \in \mathcal{X}\}$ where $\mathcal{X}$ is the feasible region. In some cases, this lends itself to efficient representations that result in polynomial-time solvable instances, most notably for the distributionally robust appointment scheduling problem with random job durations as well as for computing tight bounds in Project Evaluation and Review Technique (PERT) networks and linear assignment problems. To the best of our knowledge, this is the first example of a distributionally robust optimization formulation for appointment scheduling that permits a tight polynomial-time solvable semidefinite programming reformulation which explicitly captures partially known correlation information between uncertain processing times of the jobs to be scheduled.

math.OC↗

arXiv2017

Worst-Case Expected Shortfall with Univariate and Bivariate Marginals

Worst-case bounds on the expected shortfall risk given only limited information on the distribution of the random variables has been studied extensively in the literature. In this paper, we develop a new worst-case bound on the expected shortfall when the univariate marginals are known exactly and additional expert information is available in terms of bivariate marginals. Such expert information allows for one to choose from among the many possible parametric families of bivariate copulas. By considering a neighborhood of distance $ρ$ around the bivariate marginals with the Kullback-Leibler divergence measure, we model the trade-off between conservatism in the worst-case risk measure and confidence in the expert information. Our bound is developed when the only information available on the bivariate marginals forms a tree structure in which case it is efficiently computable using convex optimization. For consistent marginals, as $ρ$ approaches $\infty$, the bound reduces to the comonotonic upper bound and as $ρ$ approaches $0$, the bound reduces to the worst-case bound with bivariates known exactly. We also discuss extensions to inconsistent marginals and instances where the expert information which might be captured using other parameters such as correlations.

q-fin.RM↗