Yongqiao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yongqiao Wang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Chuangyin Dang
Department of Systems Engineering, City University of Hong Kong, Kowloon, Hong Kong
1 shared publication - He Ni
Zhejiang Gongshang University
1 shared publication Jiaming Su
1 shared publicationJiaqi Qian
1 shared publicationJie Wang
School of Finance Zhejiang Gongshang University Hangzhou China
1 shared publication- Jun Wu
School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication
Latest Publications
- 20 March 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (1) , 239-252
Superquantile efficiency frontiers
- 20 March 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (1) , 239-252
Superquantile efficiency frontiers
- Open Access
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 22 (9) , 4599-4626
Dynamic learning for a DC pension plan with random risk aversion
This paper investigated the equilibrium investment strategy for a defined contribution (DC) pension plan that incorporates random risk aversion and stock return predictability. The financial market consists of a risk-free asset, an inflation-indexed bond, and a stock, where the expected stock return is driven by an unobservable mean-reverting predictor. By filtering techniques, a DC member dynamically learns and updates the estimation of this unobservable predictor based on the observations. Different from previous studies that consider only random risk aversion and resort to a system of ordinary differential equations (ODEs), this paper further incorporated stock return predictability and characterized the equilibrium strategy as a system of partial differential equations (PDEs). In the case of power utility, we derived the semi-closed form of the equilibrium investment strategy as the solution of a PDE system, and verified the existence of the solution by the Banach fixed-point theorem. Rigorous analysis showed that ignoring either random risk aversion or stock return predictability leads to welfare loss. Numerical analysis confirmed the welfare loss.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 22 (9) , 4599-4626
Open AccessDynamic learning for a DC pension plan with random risk aversion
This paper investigated the equilibrium investment strategy for a defined contribution (DC) pension plan that incorporates random risk aversion and stock return predictability. The financial market consists of a risk-free asset, an inflation-indexed bond, and a stock, where the expected stock return is driven by an unobservable mean-reverting predictor. By filtering techniques, a DC member dynamically learns and updates the estimation of this unobservable predictor based on the observations. Different from previous studies that consider only random risk aversion and resort to a system of ordinary differential equations (ODEs), this paper further incorporated stock return predictability and characterized the equilibrium strategy as a system of partial differential equations (PDEs). In the case of power utility, we derived the semi-closed form of the equilibrium investment strategy as the solution of a PDE system, and verified the existence of the solution by the Banach fixed-point theorem. Rigorous analysis showed that ignoring either random risk aversion or stock return predictability leads to welfare loss. Numerical analysis confirmed the welfare loss.
- 1 October 2024
- Published by Wiley in Journal of Forecasting
- Vol. 44 (2) , 391-423
Forecasting Expected Shortfall and Value‐at‐Risk With Cross‐Sectional Aggregation
The combination of the conditional autoregressive value‐at‐risk (CAViaR) process with the Fissler–Ziegel (FZ) loss function generates a recently emerging framework (CAViaR‐FZ) for forecasting value‐at‐risk (VaR) and expected shortfall (ES). However, existing CAViaR‐FZ models typically overlook the presence of long‐range dependence, a stylized fact of financial time series. This paper proposes a long‐memory CAViaR‐FZ model using the cross‐sectional aggregation (CSA) method. The CSA method is well‐recognized for its ability to generate a long‐memory process by aggregating an infinite number of short‐memory processes cross‐sectionally. The proposed CSA‐CAViaR‐FZ model flexibly captures long‐memory dynamics in both VaR and ES and includes the original short‐memory CAViaR‐FZ model as a special case. Simulation and empirical results demonstrate that the proposed model outperforms various competing models.
- 1 October 2024
- Published by Wiley in Journal of Forecasting
- Vol. 44 (2) , 391-423
Forecasting Expected Shortfall and Value‐at‐Risk With Cross‐Sectional Aggregation
The combination of the conditional autoregressive value‐at‐risk (CAViaR) process with the Fissler–Ziegel (FZ) loss function generates a recently emerging framework (CAViaR‐FZ) for forecasting value‐at‐risk (VaR) and expected shortfall (ES). However, existing CAViaR‐FZ models typically overlook the presence of long‐range dependence, a stylized fact of financial time series. This paper proposes a long‐memory CAViaR‐FZ model using the cross‐sectional aggregation (CSA) method. The CSA method is well‐recognized for its ability to generate a long‐memory process by aggregating an infinite number of short‐memory processes cross‐sectionally. The proposed CSA‐CAViaR‐FZ model flexibly captures long‐memory dynamics in both VaR and ES and includes the original short‐memory CAViaR‐FZ model as a special case. Simulation and empirical results demonstrate that the proposed model outperforms various competing models.
- 28 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 41 (8) , 1813-1827
Calibrating Classification Probabilities with Shape-Restricted Polynomial Regression
In many real-world classification problems, accurate prediction of membership probabilities is critical for further decision making. The probability calibration problem studies how to map scores obtained from one classification algorithm to membership probabilities. The requirement of non-decreasingness for this mapping involves an infinite number of inequality constraints, which makes its estimation computationally intractable. For the sake of this difficulty, existing methods failed to achieve four desiderata of probability calibration: universal flexibility, non-decreasingness, continuousness and computational tractability. This paper proposes a method with shape-restricted polynomial regression, which satisfies all four desiderata. In the method, the calibrating function is approximated with monotone polynomials, and the continuously-constrained requirement of monotonicity is equivalent to some semidefinite constraints. Thus, the calibration problem can be solved with tractable semidefinite programs. This estimator is both strongly and weakly universally consistent under a trivial condition. Experimental results on both artificial and real data sets clearly show that the method can greatly improve calibrating performance in terms of reliability-curve related measures.
- 28 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 41 (8) , 1813-1827
Calibrating Classification Probabilities with Shape-Restricted Polynomial Regression
In many real-world classification problems, accurate prediction of membership probabilities is critical for further decision making. The probability calibration problem studies how to map scores obtained from one classification algorithm to membership probabilities. The requirement of non-decreasingness for this mapping involves an infinite number of inequality constraints, which makes its estimation computationally intractable. For the sake of this difficulty, existing methods failed to achieve four desiderata of probability calibration: universal flexibility, non-decreasingness, continuousness and computational tractability. This paper proposes a method with shape-restricted polynomial regression, which satisfies all four desiderata. In the method, the calibrating function is approximated with monotone polynomials, and the continuously-constrained requirement of monotonicity is equivalent to some semidefinite constraints. Thus, the calibration problem can be solved with tractable semidefinite programs. This estimator is both strongly and weakly universally consistent under a trivial condition. Experimental results on both artificial and real data sets clearly show that the method can greatly improve calibrating performance in terms of reliability-curve related measures.
- 1 December 2013
- Published by Elsevier in Applied Soft Computing
- Vol. 13 (12) , 4519-4535
Stock index tracking by Pareto efficient genetic algorithm
- 1 December 2013
- Published by Elsevier in Applied Soft Computing
- Vol. 13 (12) , 4519-4535
Stock index tracking by Pareto efficient genetic algorithm
- 17 April 2013
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 17 (2) , 233-249
Modeling financial dependence with support vector regression
Copula has become the standard tool in financial dependence modeling. This paper proposes a novel nonparametric bivariate copula estimation method which smooths empirical copula with shape-restricted least squares support vector regression. This meth
- 17 April 2013
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 17 (2) , 233-249
Modeling financial dependence with support vector regression
Copula has become the standard tool in financial dependence modeling. This paper proposes a novel nonparametric bivariate copula estimation method which smooths empirical copula with shape-restricted least squares support vector regression. This meth
- 1 December 2012
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 27 (6) , 1025-1038
Robust ν-support vector machine based on worst-case conditional value-at-risk minimization
By minimizing the conditional expectation of random loss in the 1−β worst case, the performance of the ν-support vector machine (SVM) severely depends on its assumption on the underlying distribution. This paper proposes a robust ν-SVM based on worst-case conditional value-at-risk (WCCVaR) minimization, which assumes that the underlying distribution comes from a certain set of potential distributions and minimizes the maximum CVaR associated with these distributions. The problem can be transformed into a quadratic programme and handle nonlinear classification problems. Experiments on six data sets clearly show that the robust approach can achieve superior results than the ν-SVM.
- 1 December 2012
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 27 (6) , 1025-1038
Robust ν-support vector machine based on worst-case conditional value-at-risk minimization
By minimizing the conditional expectation of random loss in the 1−β worst case, the performance of the ν-support vector machine (SVM) severely depends on its assumption on the underlying distribution. This paper proposes a robust ν-SVM based on worst-case conditional value-at-risk (WCCVaR) minimization, which assumes that the underlying distribution comes from a certain set of potential distributions and minimizes the maximum CVaR associated with these distributions. The problem can be transformed into a quadratic programme and handle nonlinear classification problems. Experiments on six data sets clearly show that the robust approach can achieve superior results than the ν-SVM.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3621-3626
Fuzzy Integrating Multiple SVM Classifiers and its Application in Credit Scoring
This paper presents a method of combining support vector machine (SVM) based on fuzzy integral. The classification has two steps: first map individual SVM classifiers' decision values, which are good representatives of confidence, to memberships, second aggregate these memberships by fuzzy integral to obtain the final decision. Experimental results on two public datasets indicate that the performance of the proposed method outperforms the three conventional combining methods: single best, majority-rule ensemble and weighted-majority-rule ensemble. It clearly shows that the method has a great potential to find successful application in credit scoring area
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3621-3626
Fuzzy Integrating Multiple SVM Classifiers and its Application in Credit Scoring
This paper presents a method of combining support vector machine (SVM) based on fuzzy integral. The classification has two steps: first map individual SVM classifiers' decision values, which are good representatives of confidence, to memberships, second aggregate these memberships by fuzzy integral to obtain the final decision. Experimental results on two public datasets indicate that the performance of the proposed method outperforms the three conventional combining methods: single best, majority-rule ensemble and weighted-majority-rule ensemble. It clearly shows that the method has a great potential to find successful application in credit scoring area