Conditional Monte Carlo Estimation of Quantile Sensitivities

Management Science (Impact Factor: 2.48). 12/2009; 55(12):2019-2027. DOI: 10.1287/mnsc.1090.1090
Source: DBLP


Estimating quantile sensitivities is important in many optimization applications, from hedging in financial engineering to service-level constraints in inventory control to more general chance constraints in stochastic programming. Recently, Hong (Hong, L. J. 2009. Estimating quantile sensitivities. Oper. Res. 57 118-130) derived a batched infinitesimal perturbation analysis estimator for quantile sensitivities, and Liu and Hong (Liu, G., L. J. Hong. 2009. Kernel estimation of quantile sensitivities. Naval Res. Logist. 56 511-525) derived a kernel estimator. Both of these estimators are consistent with convergence rates bounded by n-1/3 and n-2/5, respectively. In this paper, we use conditional Monte Carlo to derive a consistent quantile sensitivity estimator that improves upon these convergence rates and requires no batching or binning. We illustrate the new estimator using a simple but realistic portfolio credit risk example, for which the previous work is inapplicable.

Download full-text


Available from: L. Jeff Hong, Oct 01, 2015
  • Source
    • "θ, which is not the case in (3) since indicator functions induce discontinuities on the boundary of the corresponding sets. It is worth noting that under appropriate additional conditions IPA can be applied to this type of problems, see [12] [11] [9]. In general, however, to be able to deal with discontinuities of sample path functions, an extension of IPA, called smoothed perturbation analysis (SPA), has been applied that integrates out discontinuities. "

    Full-text · Article · Nov 2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The researchers made significant progress in all of the proposed research areas. The first major task in the proposal involved simulation-based and sampling methods for global optimization. In support of this task, we have discovered two new innovative approaches to simulation-based global optimization; the first involves connections between stochastic approximation and our model reference approach to global optimization, while the second connects particle filtering and simulation-based approaches to global optimization. We have also made significant progress in population-based global optimal search methods, applications of these algorithms to problems in statistics and clinical trials, and efficient allocation of simulations. In support of the second task, we have made progress incorporating simulation-based and sampling methods into Markov Decision Processes (MDPs). We have made significant progress on new sampling methods for MDPs, simulation-based approaches to partially observable Markov decision processes (POMDPs), and applications of these algorithms.
    Preview · Article · Jan 2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Quantiles of customer based performance characteristics have been adopted in many areas for measuring the quality of service. Recently, sensitivity analysis of quantiles has attracted quite some attention. Sensitivity analysis of quantiles is particularly challenging as quantiles cannot be expressed as the expected value of some sample performance function, and it is therefore not evident how standard gradient estimation methods can be applied. While sensitivity analysis of quantiles of waiting times for static or fixed time horizon problems is well understood, quantile estimation for stationary waiting times remains an open question. This paper will close this gap and will provide a framework for gradient estimation for quantiles of stationary waiting times.
    Full-text · Conference Paper · Aug 2010
Show more