Fasheng Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fasheng Sun has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Min-Qian Liu
NITFID, LPMC & KLMDASR, School of Statistics and Data Science, Nankai University, Tianjin, China
3 shared publications - Yaping Wang
KLATASDS‐MOE, School of Statistics East China Normal University Shanghai China
3 shared publications Bo Hu
2 shared publications- Bo Hu
School of Statistics Dongbei University of Finance and Economics Dalian China
2 shared publications Dongying Wang
2 shared publications- Jiaqing Zhu
Department of Statistics, School of Mathematics and Statistics Shandong Normal University Jinan China
2 shared publications
Latest Publications
- 19 October 2026
- Published by Wiley in Canadian Journal of Statistics
- p. e70081
An efficient subsampling algorithm for big data with interaction effects under measurement constraints
The rapid growth of big data sets has made subsampling an essential tool for data storage and analysis. In many applications, first‐order models are inadequate, as interaction and quadratic effects are often present. Second‐order models provide a concise framework for capturing such higher‐order relationships, yet subsampling strategies tailored to these models remain underexplored. Hence, we propose an efficient subsampling method for second‐order models (ESSO) inspired by orthogonal arrays. Our method is particularly suited for scenarios with measurement constraints, where subsample selection does not require response information. This study examines the optimal subsampling method under the ‐optimality criterion for second‐order models. Additionally, the asymptotic normality of the estimator is established, and a sequential algorithm is proposed for practical implementation. Numerical simulations and a real data example further demonstrate the effectiveness of the proposed approach.
- 19 October 2026
- Published by Wiley in Canadian Journal of Statistics
- p. e70081
An efficient subsampling algorithm for big data with interaction effects under measurement constraints
The rapid growth of big data sets has made subsampling an essential tool for data storage and analysis. In many applications, first‐order models are inadequate, as interaction and quadratic effects are often present. Second‐order models provide a concise framework for capturing such higher‐order relationships, yet subsampling strategies tailored to these models remain underexplored. Hence, we propose an efficient subsampling method for second‐order models (ESSO) inspired by orthogonal arrays. Our method is particularly suited for scenarios with measurement constraints, where subsample selection does not require response information. This study examines the optimal subsampling method under the ‐optimality criterion for second‐order models. Additionally, the asymptotic normality of the estimator is established, and a sequential algorithm is proposed for practical implementation. Numerical simulations and a real data example further demonstrate the effectiveness of the proposed approach.
- Open Access
- 29 July 2026
- Published by Wiley in Canadian Journal of Statistics
Optimal subsampling for regression with mixed‐type predictors
Subsampling has emerged as an appealing strategy to mitigate the computational and storage challenges imposed by large datasets. Recent subsampling techniques have shown notable computational gains for data dominated by numerical predictors. However, real‐world datasets frequently contain both numerical and categorical predictors. Traditional treatments of categorical predictors commonly use dummy coding, which can lead to substantial dimensional expansion and added complexity during subsampling. To address these challenges, we propose a new mixed‐type optimal subsampling technique (MOST) specifically designed for both numerical and categorical predictors. By enforcing combinatorial orthogonality, MOST effectively captures the informative structure of mixed‐type predictors, enabling more efficient subdata estimators. Simulation studies and real‐data applications demonstrate the superior accuracy and computational benefits of MOST compared to existing subsampling methods.
- 29 July 2026
- Published by Wiley in Canadian Journal of Statistics
Open AccessOptimal subsampling for regression with mixed‐type predictors
Subsampling has emerged as an appealing strategy to mitigate the computational and storage challenges imposed by large datasets. Recent subsampling techniques have shown notable computational gains for data dominated by numerical predictors. However, real‐world datasets frequently contain both numerical and categorical predictors. Traditional treatments of categorical predictors commonly use dummy coding, which can lead to substantial dimensional expansion and added complexity during subsampling. To address these challenges, we propose a new mixed‐type optimal subsampling technique (MOST) specifically designed for both numerical and categorical predictors. By enforcing combinatorial orthogonality, MOST effectively captures the informative structure of mixed‐type predictors, enabling more efficient subdata estimators. Simulation studies and real‐data applications demonstrate the superior accuracy and computational benefits of MOST compared to existing subsampling methods.
- 1 October 2025
- Published by Wiley in Scandinavian Journal of Statistics
- Vol. 52 (4) , 2242-2269
On optimal blocked definitive screening designs: Theoretical insights and computational simplifications
Definitive screening designs (DSDs) are a novel class of three‐level designs that yield efficient estimates of main effects without aliasing with second‐order effects. While orthogonal and pairwise blocking schemes have been proposed for DSDs, their theoretical properties remain partially unexplored, resulting in computational challenges in searching for optimal blocked DSDs. In this paper, we obtain several theoretical insights into optimal blocked DSDs under the linear‐plus‐quadratic effects model. Our results not only demonstrate the optimality of some existing blocked DSDs but also substantially alleviate the complexities involved in identifying optimal orthogonal blocked DSDs.
- 1 October 2025
- Published by Wiley in Scandinavian Journal of Statistics
- Vol. 52 (4) , 2242-2269
On optimal blocked definitive screening designs: Theoretical insights and computational simplifications
Definitive screening designs (DSDs) are a novel class of three‐level designs that yield efficient estimates of main effects without aliasing with second‐order effects. While orthogonal and pairwise blocking schemes have been proposed for DSDs, their theoretical properties remain partially unexplored, resulting in computational challenges in searching for optimal blocked DSDs. In this paper, we obtain several theoretical insights into optimal blocked DSDs under the linear‐plus‐quadratic effects model. Our results not only demonstrate the optimality of some existing blocked DSDs but also substantially alleviate the complexities involved in identifying optimal orthogonal blocked DSDs.
- 25 September 2025
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 242
Orthogonal Latin hypercube designs with hidden low-dimensional projection
- 25 September 2025
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 242
Orthogonal Latin hypercube designs with hidden low-dimensional projection
- Open Access
Grouped Orthogonal Arrays and Their Applications
In computer experiments, it has become a standard practice to select the inputs that spread out as uniformly as possible over the design space. The resulting designs are called space-filling designs and they are undoubtedly desirable choices when there is no prior knowledge on how the input variables affect the response and the objective of experiments is global fitting. When there is some prior knowledge on the underlying true function of the system or what statistical models are more appropriate, a natural question is, are there more suitable designs than vanilla space-filling designs? In this article, we provide an answer for the cases where there are no interactions between the factors from disjoint groups of variables. In other words, we consider the design issue when the underlying functional form of the system or the statistical model to be used is additive where each component depends on one group of variables from a set of disjoint groups. For such cases, we recommend using {\em grouped orthogonal arrays.} Several construction methods are provided and many designs are tabulated for practical use. Compared with existing techniques in the literature, our construction methods can generate many more designs with flexible run sizes and better within-group projection properties for any prime power number of levels.
Open AccessGrouped Orthogonal Arrays and Their Applications
In computer experiments, it has become a standard practice to select the inputs that spread out as uniformly as possible over the design space. The resulting designs are called space-filling designs and they are undoubtedly desirable choices when there is no prior knowledge on how the input variables affect the response and the objective of experiments is global fitting. When there is some prior knowledge on the underlying true function of the system or what statistical models are more appropriate, a natural question is, are there more suitable designs than vanilla space-filling designs? In this article, we provide an answer for the cases where there are no interactions between the factors from disjoint groups of variables. In other words, we consider the design issue when the underlying functional form of the system or the statistical model to be used is additive where each component depends on one group of variables from a set of disjoint groups. For such cases, we recommend using {\em grouped orthogonal arrays.} Several construction methods are provided and many designs are tabulated for practical use. Compared with existing techniques in the literature, our construction methods can generate many more designs with flexible run sizes and better within-group projection properties for any prime power number of levels.
- 10 April 2025
- Published by Wiley in Scandinavian Journal of Statistics
Enhanced branching Latin hypercube design and its application in automatic algorithm configuration
Designing experiments that involve branching and nested factors is challenging due to the complex relationships between these factors. Identification of optimal settings requires designs with good stratification properties for both nested and shared factors. To meet this requirement, we defined a type of enhanced branching Latin hypercube designs and developed several novel construction methods by integrating orthogonal arrays and sliced Latin hypercube designs. These designs exhibit attractive low‐dimensional stratification properties and perform well in terms of column correlation. Additionally, the size of each design can be flexibly chosen based on the trade‐off between the experimental budget and estimation accuracy. The simulation results demonstrate that the proposed design method exhibits significant superiority in terms of design metrics and estimation accuracy. Furthermore, we showcase the application of these designs in initializing automatic algorithm configuration. The proofs and additional design tables are provided in the Appendix.
- 10 April 2025
- Published by Wiley in Scandinavian Journal of Statistics
Enhanced branching Latin hypercube design and its application in automatic algorithm configuration
Designing experiments that involve branching and nested factors is challenging due to the complex relationships between these factors. Identification of optimal settings requires designs with good stratification properties for both nested and shared factors. To meet this requirement, we defined a type of enhanced branching Latin hypercube designs and developed several novel construction methods by integrating orthogonal arrays and sliced Latin hypercube designs. These designs exhibit attractive low‐dimensional stratification properties and perform well in terms of column correlation. Additionally, the size of each design can be flexibly chosen based on the trade‐off between the experimental budget and estimation accuracy. The simulation results demonstrate that the proposed design method exhibits significant superiority in terms of design metrics and estimation accuracy. Furthermore, we showcase the application of these designs in initializing automatic algorithm configuration. The proofs and additional design tables are provided in the Appendix.
- 27 March 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 68 (9) , 2207-2230
Energy distance-based subsampling Markov chain Monte Carlo
- 27 March 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 68 (9) , 2207-2230
Energy distance-based subsampling Markov chain Monte Carlo
- 2 January 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 68 (5) , 1219-1242
On construction of strong orthogonal arrays and column-orthogonal strong orthogonal arrays of strength two plus
- 2 January 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 68 (5) , 1219-1242
On construction of strong orthogonal arrays and column-orthogonal strong orthogonal arrays of strength two plus
- 22 April 2024
- Published by Springer Nature in Metrika
- Vol. 88 (4) , 445-468
Theory and applications of stratification criteria based on space-filling pattern and projection pattern
- 22 April 2024
- Published by Springer Nature in Metrika
- Vol. 88 (4) , 445-468
Theory and applications of stratification criteria based on space-filling pattern and projection pattern
- 11 February 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 208
Mixed-level screening designs based on skew-symmetric conference matrices
- 11 February 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 208
Mixed-level screening designs based on skew-symmetric conference matrices