3
$\begingroup$

I have a computer model with a number of parameters that need to be calibrated based on experimental results. It's also important to understand the sensitivity of the results to each parameter individually. The intuitive approach to this problem is to sample each parameter (say m realization from each parameter) and conduct a factorial experiment to see the main effects and interactions between parameters. As it's repeatedly reported, the problem with this approach is its computational costs as for a model with 10 parameters, even with only two-level experiment, it would cost $2^{10}$ runs, which is not feasible for my model.

I am therefore searching for an alternative sampling approach that rescues me from this headache. Any guidance is appreciated.

$\endgroup$
  • 2
    $\begingroup$ I am not sure if I'm properly understanding what you're trying to do, but it seems like you want to avoid doing a factorial sampling of your space and want an alternative. A simple alternative is Monte Carlo sampling and another alternative is Latin Hypercube sampling. Monte Carlo sampling should make the error bound of integrals (assuming that's what you're approximately computing with this Bayesian stuff) $O\left(\frac{1}{\sqrt{n}}\right)$ regardless of the dimensionality of the integral, where $n$ is the number of samples. So depending on the error you want, this might be sufficient. $\endgroup$ – spektr Jul 9 '19 at 17:07
  • $\begingroup$ Just doing a quick google, it appears that a random Latin Hypercube approach can have error bounded by $O\left(\frac{1}{n}\right)$ in some lower dimensional settings, so this may actually be better depending. Here is a link I just found and started to read that you might find interesting: lumina.com/blog/latin-hypercube-vs.-monte-carlo-sampling $\endgroup$ – spektr Jul 9 '19 at 17:11
  • $\begingroup$ LHS? NUTS! the trouble with LHS is that it leads to clustered sample points in high dimensional spaces, so you may completely miss very relevant regions of your probability space (=> biased estimates). if you can build a reasonable, differentiable approximation to the joint PDF of the parameters, I'd suggest you try a state-of-the art Hamiltonian Monte Carlo sampler (for continuous parameters). $\endgroup$ – GoHokies Jul 10 '19 at 5:58
  • $\begingroup$ also, LHS is completely oblivious to things like concentration of measure, i.e. the unintuitive behavior of volume in high-dimensions. If all you know a priori are (1) the parameter correlations and (2) their upper and lower bounds, you could approximate their joint PDF by a Gaussian copula with uniform marginals and use HMC (NUTS) to sample that efficiently. $\endgroup$ – GoHokies Jul 10 '19 at 9:57
  • $\begingroup$ Thanks you both for your inputs. Since I am new to the concepts that you are introducing, let me ask you a question before me diving into them. In my simulation, I am also interested to know the sensitivity of the results to each parameter. In Factorial experiments, two factors of "main effect" and "interaction" can be used to interpret the sensitivity. Would it be also possible to get this type of information from the methods you suggested? $\endgroup$ – JN_ Jul 10 '19 at 11:40
1
$\begingroup$

The computational costs of sensitivity analysis for a considerably large simulation is attributed to two main phenomena. Firstly, as it's mentioned in the body of the question, due to a large number of parameters, even a small selection of samples from each parameter would lead to an astronomical number of runs. Secondly, a small sampling number (two-level experiment) is never enough to even roughly understand the behavior of a system with regards to its parameters.

After spending a couple of days, this is what I understood. There are usually two steps taken to address the raised concerns. First, instead of using a full factorial design, one can use the fractional factorial design to reduce the number of runs to address the first concern. This approach assumes that most of the information provided by the full factorial design is redundant and can be ignored accordingly. Read more on Wikipedia. Using the fractional factorial design with a two-level factor, one can conduct a primary study on parameters and drop those that are insignificant. This would result in a much smaller parameter set that can be more extensively investigated using other methods (mentioned below). For the sake of completeness, there are also other methods in this scope to reduce the complexity of full factorial design such as Plackett-Burman designs, Cotter designs, and mixed-level designs.

In the second step, in order to further understand the system, one can use methods such as those classified as Space-filling design (e.g. Latin hypercube sampling-LHD) to investigate each parameter's influence on the system in more detail. Different methods use different sampling approaches based on the nature of a problem. I find this open article ("Sensitivity analysis by design of experiments") by Schepdael et al 2016 useful in this regard.

One more point. If running your model takes a substantial amount of time and executing thousands of runs based on the aforementioned methods are not feasible, check out Approximate Approximate Bayesian Calculation. This method develops a statistical model based on the limited result sets from your real model an executes more extensive runs on the statistical model instead. I think this is the main article elaborating this method: "AABC: Approximate approximate Bayesian computation for inference in population-genetic models" by Buzbas et al 2015.

Please correct me or let me know your opinions in the comments.

| cite | improve this answer | |
$\endgroup$
-1
$\begingroup$

What you have just described is called the curse of dimensionality, in which the number of samples scales exponentially with respect to dimensionality $d$. Supposed that you want $s$ samples in each dimension, then you would need $s^d$ to explore your design space. Fit $s=2$ and $d=10$ in your example.

This is usually referred to as full-tensor grid in the literature. There is an approach called sparse grid, which significantly reduces the number of samples, while retains the desired accuracy. Basically, you want an accurate interpolation/integration method on high-dimensional space. See :

  1. Barthelmann V, Novak E and Ritter K 2000 High dimensional polynomial interpolation on sparse grids Adv. Comput. Math. 12 273–88
  2. Novak E and Ritter K 1999 Simple cubature formulas with high polynomial exactness Constructive Approx. 15 499–522

Open-source code are available. Notable software is DAKOTA from Sandia National Laboratories, you can download from http://dakota.sandia.gov/.

If your dimensionality is too high ($d>1,000$ or so), you are better off using Monte Carlo, since the accuracy is independent of the dimensionality (only depends on the number of samples). Downside: you have to sample a lot, $\mathcal{O}(10^5) - \mathcal{O}(10^6)$ or so, to achieve good accuracy.

| cite | improve this answer | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.