Chaoxia Yuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chaoxia Yuan has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Alan T. K. Wan
City University of Hong Kong
2 shared publications - Guohua Zou
School of Mathematical Sciences, Capital Normal University, Beijing, China
2 shared publications - Jiahui Zou
School of Statistics, Capital University of Economics and Business, Beijing, China
2 shared publications - Xinyu Zhang
Academy of Mathematics and Systems Science, Chinese Academy of Sciences
2 shared publications Fang Fang
KLATASDS – MOE, School of Statistics, East China Normal University, Shanghai, People's Republic of China
1 shared publicationYang Wu
KLATASDS – MOE, School of Statistics, East China Normal University, Shanghai, People's Republic of China
1 shared publication
Latest Publications
- Open Access
- 6 January 2023
- Published by Springer Nature in Research Square
Model Averaging for Support Vector Machine by Cross-Validation
Support vector machine (SVM) is a well-known statistical technique for classification problems in machine learning and other fields.An important question for SVM is the selection of covariates (or features) for the model.Many studies have considered model selection methods. As is well-known, selecting one winning model over others can entail considerable instability in predictive performance due to model selection uncertainties. This paper advocates model averaging as an alternative approach, where estimates obtained from different models are combined in a weighted average. We propose a model weighting scheme and provide the theoretical underpinning for the proposed method. In particular, we prove that our proposed method yields a model average estimator that achieves the smallest hinge risk among all feasible combinations asymptotically. To remedy the computational burden due to a large number of feasible models, we propose a screening step to eliminate the uninformative features before combining the models. Results from real data applications and a simulation study show that the proposed method generally yields more accurate estimates than existing methods.
- 6 January 2023
- Published by Springer Nature in Research Square
Open AccessModel Averaging for Support Vector Machine by Cross-Validation
Support vector machine (SVM) is a well-known statistical technique for classification problems in machine learning and other fields.An important question for SVM is the selection of covariates (or features) for the model.Many studies have considered model selection methods. As is well-known, selecting one winning model over others can entail considerable instability in predictive performance due to model selection uncertainties. This paper advocates model averaging as an alternative approach, where estimates obtained from different models are combined in a weighted average. We propose a model weighting scheme and provide the theoretical underpinning for the proposed method. In particular, we prove that our proposed method yields a model average estimator that achieves the smallest hinge risk among all feasible combinations asymptotically. To remedy the computational burden due to a large number of feasible models, we propose a screening step to eliminate the uninformative features before combining the models. Results from real data applications and a simulation study show that the proposed method generally yields more accurate estimates than existing methods.
- Open Access
- 30 July 2022
- Published by Taylor & Francis in Statistical Theory and Related Fields
- Vol. 6 (4) , 344-352
Model averaging for generalized linear models in fragmentary data prediction
Fragmentary data is becoming more and more popular in many areas which brings big challenges to researchers and data analysts. Most existing methods dealing with fragmentary data consider a continuous response while in many applications the response variable is discrete. In this paper, we propose a model averaging method for generalized linear models in fragmentary data prediction. The candidate models are fitted based on different combinations of covariate availability and sample size. The optimal weight is selected by minimizing the Kullback–Leibler loss in the completed cases and its asymptotic optimality is established. Empirical evidences from a simulation study and a real data analysis about Alzheimer disease are presented.
- 30 July 2022
- Published by Taylor & Francis in Statistical Theory and Related Fields
- Vol. 6 (4) , 344-352
Open AccessModel averaging for generalized linear models in fragmentary data prediction
Fragmentary data is becoming more and more popular in many areas which brings big challenges to researchers and data analysts. Most existing methods dealing with fragmentary data consider a continuous response while in many applications the response variable is discrete. In this paper, we propose a model averaging method for generalized linear models in fragmentary data prediction. The candidate models are fitted based on different combinations of covariate availability and sample size. The optimal weight is selected by minimizing the Kullback–Leibler loss in the completed cases and its asymptotic optimality is established. Empirical evidences from a simulation study and a real data analysis about Alzheimer disease are presented.
- Open Access
Model Averaging for Support Vector Machine by Cross-Validation
Support vector machine (SVM) is a well-known statistical technique for classification problems in machine learning and other fields. An important question for SVM is the selection of covariates (or features) for the model. Many studies have considered model selection methods. As is well-known, selecting one winning model over others can entail considerable instability in predictive performance due to model selection uncertainties. This paper advocates model averaging as an alternative approach, where estimates obtained from different models are combined in a weighted average. We propose a model weighting scheme and provide the theoretical underpinning for the proposed method. In particular, we prove that our proposed method yields a model average estimator that achieves the smallest hinge risk among all feasible combinations asymptotically. To remedy the computational burden due to a large number of feasible models, we propose a screening step to eliminate the uninformative features before combining the models. Results from real data applications and a simulation study show that the proposed method generally yields more accurate estimates than existing methods.
Open AccessModel Averaging for Support Vector Machine by Cross-Validation
Support vector machine (SVM) is a well-known statistical technique for classification problems in machine learning and other fields. An important question for SVM is the selection of covariates (or features) for the model. Many studies have considered model selection methods. As is well-known, selecting one winning model over others can entail considerable instability in predictive performance due to model selection uncertainties. This paper advocates model averaging as an alternative approach, where estimates obtained from different models are combined in a weighted average. We propose a model weighting scheme and provide the theoretical underpinning for the proposed method. In particular, we prove that our proposed method yields a model average estimator that achieves the smallest hinge risk among all feasible combinations asymptotically. To remedy the computational burden due to a large number of feasible models, we propose a screening step to eliminate the uninformative features before combining the models. Results from real data applications and a simulation study show that the proposed method generally yields more accurate estimates than existing methods.