高斯過程被廣泛地運用在電腦實驗的建模上，但是隨著資訊爆炸的時代來臨，資料量成長的速度遠遠超過硬體設備的進步，使得高斯過程的預測能力在樣本數很大時急遽下降。常見的解決方法是透過改進模型或是實驗設計降低樣本數。本篇論文提出一個座標交換演算法，在給定樣本中迭代找出最具有預測力（predictive）的子樣本（subdata），且透過數值模擬來展示只需使用這些子樣本就可以達到準確的預測結果。

Gaussian processes are widely used for emulating expensive computer simulators. However, their use is limited under large-scale data due to numerical problems. Common solutions to this difficulty are either to modify the model or to design suitable computer experiments. In this paper, we propose an exchange algorithm to search for predictive subdata given a full dataset. We demonstrate
our method on several examples to show the performance between our method and other competitive methods. Furthermore, we show that the predictive subdata selected by our method achieves high prediction accuracy even though the full dataset is not space-filling in the experimental region.

Ba, S., & Joseph, V. R. (2012). Composite gaussian process models for emulationg expensive functions. J. Appl. Stat., 6 , 1838–1860.
Fedorov, V. V. (1972). Theory of optimal experiments. Academic Press New York.
Gramacy, R., & Apley, D. (2015). Local gaussian process approximation for large computer experiments. J. Comput. Graph. Statist., 24 , 561–578.
Jones, B., & Goos, P. (2007). A candidate-set-free algorithm for generating doptimal split-plot designs. J. R. Stat. Soc. Ser. C. Appl. Stat., 56 , 347–364.
Marrel, A., Iooss, B., Dorpe, F. V., & Volkova, E. (2008). An efficient methodology for modeling complex computer codes with gaussian processes. Comput. Statist. Data Anal., 52 , 4731 – 4744.
Meyer, R. K., & Nachtsheim, C. J. (1995). The coordinate-exchange algorithm for constructing exact optimal experimental designs. Technometrics, 37 , 60–69.
Peng, C.-Y., & Wu, C. F. J. (2014). On the choice of nugget in kriging modeling for deterministic computer experiments. J. Comput. Graph. Statist., 23 , 151–168.
Plumlee, M., & Joseph, V. R. (2018). Orthogonal gaussian process models. Statist. Sinica, 28 , 601–619.
Sacks, J., Schiller, S. B., & Welch, W. J. (1989). Designs for computer experiments. Technometrics, 31 , 41–47.
Sambo, F., Borrotti, M., & Mylona, K. (2014). A coordinate-exchange twophase local search algorithm for the D- and I-optimal designs of split-plot experiments. Comput. Statist. Data Anal., 71 , 1193–1207.
Santner, T. J., Williams, B. J., & Notz, W. I. (2018). The Design and Analysis of Computer Experiments. New York: Springer.
Sch¨obi, R., Sudret, B., & Wiart, J. (2015). Polynomial-chaos-based kriging. Int. J. Uncertain. Quantif., 5 , 171–193.
Sun, D. X., Wu, C. F. J., & Chen, Y. (1997). Optimal blocking schemes for 2n and 2n−p designs. Technometrics, 39 , 298–307.
Sung, C.-L., Wang, W., Plumlee, M., & Haaland, B. (2019). Multiresolution functional anova for large-scale, many-input computer experiments. J. Amer. Statist. Assoc, 0 , 1–12.
Zhao, Y., Amemiya, Y., & Hung, Y. (2018). Efficient gaussian process modeling using experimental design-based subagging. Statist. Sinica, 28 , 1459–1479.