The recent work on lattice-based space-filling designs
Holder: He Xu
Time:2019-10-24 3:30-4:30pm
Location:Room 1303, Sciences Building No. 1
Abstract:
In this talk, He Xu will present several recent works of mine on constructing experimental design for computer experiments. Computer experiments are computer programs that simulate real systems using mathematical models. Some such simulations are extremely slow in computation, calling for experimental designs that are efficient in building surrogate models. Some recent work suggests that space-filling designs with low fill distance, high separation distance, and certain projective properties are appealing for computer experiments. Usually, such designs are generated using global optimization techniques. However, because the optimization problem is fundamentally difficult, near optimal designs are rarely obtained. His approach is to use lattices that have distance properties in Euclidean space to construct space-filling designs. Such designs include rotated sphere packing designs and interleaved lattice-based designs.
About the Speaker:
He Xu got his bachelor's degree from the School of Mathematical Sciences, Peking University. He received his Ph.D. from the Department of Statistics, University of Wisconsin-Madison. Since 2012, he has been working as an assistant researcher and associate researcher in the Academy of Mathematics and Systems Science, Chinese Academy of Sciences. His research interests include experimental design, computer experiments and uncertainty quantification. He published more than 10 papers in Annals of Statistics, Journal of the American Statistical Association, Biometrika and other journals.