Optimal sampling will in general depend on one's objective. From the title it seems you are mainly interested in variable importance. This is typically one of the objectives of sensitivity analysis, and a variety of methods exist for which the ideal sampling methods may differ.
The book by Saltelli[1] covers sampling from the perspective of factorial design of experiments and Latin Hyper Cube sampling, however quasi-random sequences (Sobol, Halton, Hammersley, etc ) are a popular alternative for sampling based methods.
The number of samples will also depend on what you want to quantify and to what accuracy.
If you have many inputs of interest screening approaches such as Morris' method [2] are a good approach
However, if you already only care about 3 parameters screen may not be advantageous over a full variance based sensitivity analysis (Saltelli's book also covers this).
There are a number of approaches to this which can be divided in two approaches
- Meta-model/surrogate modelling approach where a simplified model for which the variance computation is relatively trivial (linear[1], polynomial [3-5], Fourier[1,6]) is used as an approximation of the model of interest.
- Direct computation of variance based sensitivities by integrating the model of interest over the input parameter space. The most popular approach for this is Monte Carlo, but direct numerical quadrature might be feasible in some situations.
For both of these methods the simplest procedures specify a sampling scheme (or quadrature grid) a priori, however, the resulting sensitivity estimates are approximate, so it is good practice to see if the results are consistent either between different sample sizes or by bootstrapping the estimation procedure to quantify how variable the estimates are.
Alternatively some adaptive sampling approaches exist, particularly for meta-modelling approaches [4], and try to choose new sample points based on error estimates or other criteria.
- Saltelli, A. (2008). Global sensitivity analysis: The primer. John Wiley,
- Morris, M. D. (1991). Factorial Sampling Plans for Preliminary Computational Experiments. Technometrics, 33(2), 161–174. https://www.tandfonline.com/doi/abs/10.1080/00401706.1991.10484804
- Buzzard, G. T., & Xiu, D. (2011). Variance-Based Global Sensitivity Analysis via Sparse-Grid Interpolation and Cubature. Communications in Computational Physics, 9(3), 542–567. https://doi.org/10.4208/cicp.230909.160310s
- Blatman, G., & Sudret, B. (2010). An adaptive algorithm to build up sparse polynomial chaos expansions for stochastic finite element analysis. Probabilistic Engineering Mechanics, 25(2), 183–197. https://doi.org/10.1016/j.probengmech.2009.10.003
- Crestaux, T., Le Maitre, O., & Martinez, J.-M. (2009). Polynomial chaos expansion for sensitivity analysis. Reliability Engineering & System Safety, 94(7), 1161–1172. https://doi.org/10.1016/j.ress.2008.10.008
- Xu, C., & Gertner, G. (2011). Understanding and comparisons of different sampling approaches for the Fourier Amplitudes Sensitivity Test (FAST). Computational Statistics & Data Analysis, 55(1), 184–198. https://doi.org/10.1016/j.csda.2010.06.028