GYGenglong Yan
Genglong Yan
*This is an algorithmically generated author record based on publicly available information.
Genglong Yan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Chengbin Zeng
School of Automation Engineering, Moutai Institute, Renhuai 564507, China
2 shared publications - Fabin Zhang
School of Automation Engineering, Moutai Institute, Renhuai 564507, China
2 shared publications - Xiaoyong Liu
School of Automation Engineering, Moutai Institute, Renhuai 564507, China
2 shared publications - Peng Tian
Moutai Institute
1 shared publication - Qingyao Liu
School of Automation Engineering, Moutai Institute, Renhuai 564507, China
1 shared publication - Shunqiang Liu
School of Automation Engineering, Moutai Institute, Renhuai 564507, China
1 shared publication
Latest Publications
- Open Access
A Dual-Norm Support Vector Machine: Integrating L1 and L∞ Slack Penalties for Robust and Sparse Classification
This paper presents a novel support vector machine (SVM) classification approach that simultaneously accounts for both overall and extreme misclassification errors via a dual-norm regularization strategy. Traditional SVMs minimize the -norm of slack variables to control global misclassification, while least squares SVM (LSSVM) minimizes the sum of squared errors. In contrast, our method preserves the classical -norm penalty to maintain overall classification fidelity and incorporates an additional -norm term to penalize the largest slack variable, thereby constraining the worst-case margin violation. This composite objective yields a more robust and generalizable classifier, particularly effective when occasional large deviations disproportionately affect decision boundaries. The resulting optimization problem minimizes a regularized objective combining the model norm, the sum of slack variables, and the maximum slack variable, with two hyperparameters, and , balancing global error against extremal robustness. By formulating the problem under convex constraints, the optimization remains tractable and guarantees a globally optimal solution. Experimental evaluations on benchmark datasets demonstrate that the proposed method achieves comparable or superior classification accuracy while reducing the impact of outliers and maintaining a sparse model structure. These results underscore the advantage of jointly enforcing and penalties, providing an effective mechanism to balance average performance with worst-case error sensitivity in support vector classification.Open AccessA Dual-Norm Support Vector Machine: Integrating L1 and L∞ Slack Penalties for Robust and Sparse Classification
This paper presents a novel support vector machine (SVM) classification approach that simultaneously accounts for both overall and extreme misclassification errors via a dual-norm regularization strategy. Traditional SVMs minimize the -norm of slack variables to control global misclassification, while least squares SVM (LSSVM) minimizes the sum of squared errors. In contrast, our method preserves the classical -norm penalty to maintain overall classification fidelity and incorporates an additional -norm term to penalize the largest slack variable, thereby constraining the worst-case margin violation. This composite objective yields a more robust and generalizable classifier, particularly effective when occasional large deviations disproportionately affect decision boundaries. The resulting optimization problem minimizes a regularized objective combining the model norm, the sum of slack variables, and the maximum slack variable, with two hyperparameters, and , balancing global error against extremal robustness. By formulating the problem under convex constraints, the optimization remains tractable and guarantees a globally optimal solution. Experimental evaluations on benchmark datasets demonstrate that the proposed method achieves comparable or superior classification accuracy while reducing the impact of outliers and maintaining a sparse model structure. These results underscore the advantage of jointly enforcing and penalties, providing an effective mechanism to balance average performance with worst-case error sensitivity in support vector classification. - Open Access
Linear Programming-Based Sparse Kernel Regression with L1-Norm Minimization for Nonlinear System Modeling
This paper integrates -norm structural risk minimization with -norm approximation error to develop a new optimization framework for solving the parameters of sparse kernel regression models, addressing the challenges posed by complex model structures, over-fitting, and limited modeling accuracy in traditional nonlinear system modeling. The first -norm regulates the complexity of the model structure to maintain its sparsity, while another -norm is essential for ensuring modeling accuracy. In the optimization of support vector regression (SVR), the -norm structural risk is converted to an -norm framework through the condition of non-negative Lagrange multipliers. Furthermore, -norm optimization for modeling accuracy is attained by minimizing the maximum approximation error. The integrated -norm of structural risk and approximation errors creates a new, simplified optimization problem that is solved using linear programming (LP) instead of the more complex quadratic programming (QP). The proposed sparse kernel regression model has the following notable features: (1) it is solved through relatively simple LP; (2) it effectively balances the trade-off between model complexity and modeling accuracy; and (3) the solution is globally optimal rather than just locally optimal. In our three experiments, the sparsity metrics of were 2.67%, 1.40%, and 0.8%, with test RMSE values of 0.0667, 0.0701, 0.0614 (sinusoidal signal), and 0.0431 (step signal), respectively. This demonstrates the balance between sparsity and modeling accuracy.Open AccessLinear Programming-Based Sparse Kernel Regression with L1-Norm Minimization for Nonlinear System Modeling
This paper integrates -norm structural risk minimization with -norm approximation error to develop a new optimization framework for solving the parameters of sparse kernel regression models, addressing the challenges posed by complex model structures, over-fitting, and limited modeling accuracy in traditional nonlinear system modeling. The first -norm regulates the complexity of the model structure to maintain its sparsity, while another -norm is essential for ensuring modeling accuracy. In the optimization of support vector regression (SVR), the -norm structural risk is converted to an -norm framework through the condition of non-negative Lagrange multipliers. Furthermore, -norm optimization for modeling accuracy is attained by minimizing the maximum approximation error. The integrated -norm of structural risk and approximation errors creates a new, simplified optimization problem that is solved using linear programming (LP) instead of the more complex quadratic programming (QP). The proposed sparse kernel regression model has the following notable features: (1) it is solved through relatively simple LP; (2) it effectively balances the trade-off between model complexity and modeling accuracy; and (3) the solution is globally optimal rather than just locally optimal. In our three experiments, the sparsity metrics of were 2.67%, 1.40%, and 0.8%, with test RMSE values of 0.0667, 0.0701, 0.0614 (sinusoidal signal), and 0.0431 (step signal), respectively. This demonstrates the balance between sparsity and modeling accuracy.