Kernel Parameters Research Articles

Research on a Photovoltaic Panel Dust Detection Algorithm Based on 3D Data Generation

With the rapid advancements in AI technology, UAV-based inspection has become a mainstream method for intelligent maintenance of PV power stations. To address limitations in accuracy and data acquisition, this paper presents a defect detection algorithm for PV panels based on an enhanced YOLOv8 model. The PV panel dust dataset is manually extended using 3D modeling technology, which significantly improves the model’s ability to generalize and detect fine dust particles in complex environments. SENetV2 is introduced to improve the model’s perception of dust features in cluttered backgrounds. AKConv replaces traditional convolution in the neck network, allowing for more flexible and accurate feature extraction through arbitrary kernel parameters and sampling shapes. Additionally, a DySample dynamic upsampler accelerates processing by 8.73%, improving the frame rate from 87.58 FPS to 95.23 FPS while maintaining efficiency. Experimental results show that the 3D image expansion method contributes to a 4.6% increase in detection accuracy, an 8.4% improvement in recall, a 5.7% increase in mAP@50, and a 15.1% improvement in mAP@50-95 compared to the original YOLOv8. The expanded dataset and enhanced model demonstrate the effectiveness and practicality of the proposed approach.

KF-PLS: Optimizing Kernel Partial Least-Squares (K-PLS) with Kernel Flows

Partial Least-Squares (PLS) regression is a widely used tool in chemometrics for performing multivariate regression. As PLS has a limited capacity of modelling non-linear relations between the predictor variables and the response, Kernel PLS (K-PLS) has been introduced for modelling non-linear predictor-response relations. Most available studies use fixed kernel parameters, reducing the performance potential of the method. Only a few studies have been conducted on optimizing the kernel parameters for K-PLS. In this article, we propose a methodology for the kernel function optimization based on Kernel Flows (KF), a technique developed for Gaussian Process Regression (GPR). The results are illustrated with four case studies. The case studies represent both numerical examples and real data used in classification and regression tasks. K-PLS optimized with KF, called KF-PLS in this study, is shown to yield good results in all illustrated scenarios, outperforming literature results and other non-linear regression methodologies. In the present study, KF-PLS has been compared to convolutional neural networks (CNN), random trees, ensemble methods, support vector machines (SVM), and GPR, and it has proved to perform very well.

ADMNet: An adaptive downsampling multi-frequency multi-channel network for long-term time series forecasting

Long-term time series forecasting finds widespread applications in various domains such as energy, finance, and transportation. Decomposing time series into sub-sequences with distinct temporal relationships (periods) for analysis and modeling is an effective approach for long-term time series prediction. However, conventional decomposition techniques often rely on fixed-size parameter kernels for sliding averages, leading to inaccurate and unreasonable captures of the underlying periodicities in the time series. Additionally, it is essential to acknowledge that time series data often exhibits multi-periodic characteristics. In many time series prediction tasks, the value at a future time point is influenced by multiple periods within the time series. To accurately and flexibly capture the periodicities of time series, we propose an enhanced adaptive cyclic feature recognizer to automatically identify the periodic lengths for sliding average parameter kernel sizing. To fully exploit the multiple periodicities inherent in time series, we merge and smooth the sequences of features corresponding to the identified cycles, obtaining two frequency-blended cyclic feature fusion terms. Furthermore, we extract high-frequency random components to preserve finer details. Finally, we individually model the three cyclic feature fusion terms. In summary, we introduce the Adaptive Multi-Frequency Multi-Channel Network (ADMNet) designed to autonomously capture multi-periodic features. Experimental results show that, compared to the current state-of-the-art seven benchmark models, the proposed model achieves an average reduction in mean squared error (MSE) ranging from 6.19% to 22.75% across eight datasets, including ETT, Traffic, and Weather. This indicates that our model delivers superior predictive performance on multiple real-world datasets.

Calibration modeling of drilling fluid rheological parameters in variable temperature environment based on support vector machine.

Traditional measurement of drilling fluid rheological parameters suffers from significant lag due to the inability of the instruments to promptly capture real-time parameters of the drilling fluid. These measurement models are typically constructed based on fixed temperature conditions and empirical formulas, rendering them inadequate for complex temperature gradient environments. Consequently, this limitation results in increased prediction errors, severely compromising the precise monitoring of drilling fluid performance. Aiming at the problems of low accuracy and poor stability of drilling fluid measurements under variable temperature conditions, a support vector machine-based calibration model for drilling fluid rheological parameters in a variable temperature environment is proposed in this paper. First, the measurement principle of the double-tube differential pressure rheology real-time measurement device is analyzed. The relationship between shear stress and shear rate is then established using differential pressure sensor and flow rate data. Utilizing the gray wolf optimization algorithm to optimize the kernel function weights and parameters, an SVM-based calibration model for predicting drilling fluid rheology correction parameters is constructed. Finally, a real-time monitoring platform for drilling fluid is developed. Experimental results show that the maximum relative errors for the predictions of apparent viscosity, plastic viscosity, and yield point are within ±5%, with coefficients of determination (R2) all greater than 0.95. These results validate the effectiveness of the proposed method in accurately monitoring the rheological performance of drilling fluids.

An analytic approach for nonlinear collisional fragmentation model arising in bubble column

The phenomenon of coagulation and breakage of particles plays a pivotal role in diverse fields. It aids in tracking the development of aerosols and granules in the pharmaceutical sector, coagulation or breakage of droplets in chemical engineering, understanding blood clotting mechanisms in biology, and facilitating cheese production through the action of enzymes within the dairy industry. A significant portion of research in this direction concentrates on coagulation or linear breakage processes. In the case of linear case, bubble particles break down due to inherent stresses or specific conditions of the breakage event. However, in many practical situations, particle division is primarily due to forces exerted during collisions between particles, necessitating an approach that accounts for nonlinear collisional breakage. Despite its critical role in a wide array of engineering and physical operations, the study of this nonlinear fragmentation phenomenon has not been extensively pursued. This article introduces an innovative semi-analytical method that leverages the beyond linear use of equation superposition function to address the nonlinear integro-partial differential model of collisional breakage population balance. This approach is versatile, allowing for the resolution of both linear/nonlinear equations while sidestepping the complexities associated with discretization of domain. To assess the precision of this method, we conduct a thorough convergence analysis. This process utilizes the principle of contractive mapping in the Banach space, a globally recognized strategy for verifying convergence. We explore a variety of kernel parameters associated with collisional kernels, alongside breakage and initial distribution functions, to derive novel iterative solutions. Comparing our findings with those obtained through the finite volume method regarding number density functions and their integral moments, we demonstrate the reliability and accuracy of our approach. The consistency and correctness of our method are further validated by depicting the errors between the exact and approximated solutions in graphical and tabular formats.

A three-stage prediction model for firm default risk: An integration of text sentiment analysis

Predicting firm default risk is vital for financial institutions to avert significant economic losses, making the enhancement of its prediction precision both imperative and intricate. This research introduces a three-stage prediction model, including association rule algorithm (ARA), support vector machine (SVM) and modified particle swarm optimization algorithm (MPSO). Features selected by ARA are used as inputs for SVM, and penalty parameter and kernel parameter of SVM is optimized by MPSO that uses the adaptive inertia weight. The importance of text sentiment variables are emphasized to predict firm default risk. In the first stage, feature selection seeks to curtail the dimensions of both financial and non-financial variables. The empirical findings validate the efficacy of the ARA, revealing a strong correlation between text sentiment and default risk. The subsequent two stages deploy the SVM, refined by the MPSO, to predict the default risk. Compared with renowned models, the proposed model displays superior prediction precision and a reduced computational overhead. This research furnishes a potent instrument for regulators and firms alike, aiding in mitigating prospective default risks and forestalling broader economic upheavals.

Electromagnetic signal denoising model based on stacked ET layers structure

Electromagnetic signal denoising is crucial for safeguarding sensitive data from electromagnetic leakage. We introduce the Adaptive Stacked Temporal Pyramid Network (ASTPNet) for serial cable electromagnetic signals. ASTPNet combines dynamic convolution, pyramid channel convolution, and stacked ET layers structure to tackle non-linear and non-smooth noise. Dynamic convolution adjusts kernel parameters dynamically based on input signal variations, addressing signal non-smoothness. Pyramid channel convolution enhances the model’s capability to process non-linear features by analyzing key features across multiple scales. Stacked ET layers structure improve signal feature recognition by stacking multiple temporal network structures. Experimental results show that ASTPNet surpasses existing deep learning models in SNR, PSNR, and SI-SDR. The denoised signals can decode restored transmitted information, enhancing methodologies for the processing of electromagnetic signals.

Physics-constrained adaptive kernel interpolation for region-to-region acoustic transfer function: a Bayesian approach

A kernel interpolation method for the acoustic transfer function (ATF) between regions constrained by the physics of sound while being adaptive to the data is proposed. Most ATF interpolation methods aim to model the ATF for fixed source by using techniques that fit the estimation to the measurements while not taking the physics of the problem into consideration. We aim to interpolate the ATF for a region-to-region estimation, meaning we account for variation of both source and receiver positions. By using a very general formulation for the reproducing kernel function, we have created a kernel function that considers both directed and residual fields as two separate kernel functions. The directed field kernel considers a sparse selection of reflective field components with large amplitudes and is formulated as a combination of directional kernels. The residual field is composed of the remaining densely distributed components with lower amplitudes. Its kernel weight is represented by a universal approximator, a neural network, in order to learn patterns from the data freely. These kernel parameters are learned using Bayesian inference both under the assumption of Gaussian priors and by using a Markov chain Monte Carlo simulation method to perform inference in a more directed manner. We compare all established kernel formulations with each other in numerical simulations, showing that the proposed kernel model is capable of properly representing the complexities of the ATF.

Distributed learning for kernel mode–based regression

AbstractWe propose a parametric kernel mode–based regression built on the mode value, which provides robust and efficient estimators for datasets containing outliers or heavy‐tailed distributions. To address the challenges posed by massive datasets, we integrate this regression method with distributed statistical learning techniques, which greatly reduces the required amount of primary memory and simultaneously accommodates heterogeneity in the estimation process. By approximating the local kernel objective function with a least squares format, we are able to preserve compact statistics for each worker machine, facilitating the reconstruction of estimates for the entire dataset with minimal asymptotic approximation error. Additionally, we explore shrinkage estimation through local quadratic approximation, showcasing that the resulting estimator possesses the oracle property through an adaptive LASSO approach. The finite‐sample performance of the developed method is illustrated using simulations and real data analysis.

Maximum Local Density-Driven Non-overlapping Radial Basis Function Support Kernel Neural Network

The learning and optimization of kernels in the radial basis function neural network (RBFNN) are crucial. However, in existing methods, there are issues of overfitting when learning kernel parameters. The learned kernels are also sensitive to outliers. This paper proposes a general kernel learning strategy for RBFNN called non-overlapping maximum local density support kernel learning (MLD-SKL), which contains two modules, the non-overlapping maximum local density (MLD) kernel learning module and support kernel learning (SKL) module. In the MLD kernel learning stage, the candidate set of kernels is incrementally determined based on the local density of samples. Meanwhile, it is required that the coverage ranges of kernels from different classes do not overlap with each other. This module is effective in reducing the impact of outliers. In the SKL stage, kernel importance indicator is defined to measure the importance of kernels. The learned support kernels are utilized to construct a maximum local density-driven non-overlapping radial basis function support kernel neural network (MLD-RBFSKNN). The RBFNN constructed through MLD-SKL exhibits a more compact structure. The experiments demonstrate that the proposed MLD-RBFSKNN improves accuracy in recognition task. Furthermore, while achieving superior recognition performance, the final constructed network also has the minimum number of kernels.

Iterated rational quadratic kernel - High-order unscented Kalman filtering algorithm for spacecraft tracking

The high-speed development of space defense technology demands a high state estimation capacity for spacecraft tracking methods. However, reentry flight is accompanied by complex flight environments, which brings to the uncertain, complex, and strongly coupled non-Gaussian detection noise. As a result, there are several intractable considerations on the problem of state estimation tasks corrupted by complex non-Gaussian outliers for non-linear dynamics systems in practical application. To address these issues, a new iterated rational quadratic (RQ) kernel high-order unscented Kalman filtering (IRQ-HUKF) algorithm via capturing the statistics to break through the limitations of the Gaussian assumption is proposed. Firstly, the characteristic analysis of the RQ kernel is investigated in detail, which is the first attempt to carry out an exploration of the heavy-tailed characteristic and the ability on capturing high-order moments of the RQ kernel. Subsequently, the RQ kernel method is first introduced into the UKF algorithm as an error optimization criterion, termed the iterated RQ kernel-UKF (RQ-UKF) algorithm by derived analytically, which not only retains the high-order moments propagation process but also enhances the approximation capacity in the non-Gaussian noise problem for its ability in capturing high-order moments and heavy-tailed characteristics. Meanwhile, to tackle the limitations of the Gaussian distribution assumption in the linearization process of the non-linear systems, the high-order Sigma Points (SP) as a subsidiary role in propagating the state high-order statistics is devised by the moments matching method to improve the RQ-UKF. Finally, to further improve the flexibility of the IRQ-HUKF algorithm in practical application, an adaptive kernel parameter is derived analytically grounded in the Kullback-Leibler divergence (KLD) method and parametric sensitivity analysis of the RQ kernel. The simulation results demonstrate that the novel IRQ-HUKF algorithm is more robust and outperforms the existing advanced UKF with respect to the kernel method in reentry vehicle tracking scenarios under various noise environments.

Adaptive condition-aware high-dimensional decoupling remote sensing image object detection algorithm

Remote Sensing Image Object Detection (RSIOD) faces the challenges of multi-scale objects, dense overlap of objects and uneven data distribution in practical applications. In order to solve these problems, this paper proposes a YOLO-ACPHD RSIOD algorithm. The algorithm adopts Adaptive Condition Awareness Technology (ACAT), which can dynamically adjust the parameters of the convolution kernel, so as to adapt to the objects of different scales and positions. Compared with the traditional fixed convolution kernel, this dynamic adjustment can better adapt to the diversity of scale, direction and shape of the object, thus improving the accuracy and robustness of Object Detection (OD). In addition, a High-Dimensional Decoupling Technology (HDDT) is used to reduce the amount of calculation to 1/N by performing deep convolution on the input data and then performing spatial convolution on each channel. When dealing with large-scale Remote Sensing Image (RSI) data, this reduction in computation can significantly improve the efficiency of the algorithm and accelerate the speed of OD, so as to better adapt to the needs of practical application scenarios. Through the experimental verification of the RSOD RSI data set, the YOLO-ACPHD model in this paper shows very satisfactory performance. The F1 value reaches 0.99, the Precision value reaches 1, the Precision-Recall value reaches 0.994, the Recall value reaches 1, and the mAP value reaches 99.36%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\%$$\\end{document}, which indicates that the model shows the highest level in the accuracy and comprehensiveness of OD.

Prediction model of coal seam gas content based on kernel principal component analysis and IDBO-DHKELM

Abstract Accurate coal seam gas content assists in the effective prevention of coal and gas outburst accidents. To solve this problem, an IDBO-DHKELM coal seam gas content prediction model is proposed by combining improved Dung Beetle optimization algorithm (IDBO) with a deep hybrid kernel extreme learning machine (DHKELM). First, the index factors of the coupled gas content are determined according to the influence factors of coal seam gas content and the actual situation of mine production. The correlation of index factors is analyzed by SPSS 27 software via Pearson correlation coefficient matrix. Then, the principal components of the original data are extracted using the principal component analysis method (KPCA). Second, sine chaotic mapping, fusion improved sinusoidal algorithm, and fusion adaptive Gauss–Cauchy hybrid mutation perturbation are introduced to improve the Dung Beetle optimization algorithm (DBO) to enhance its global search capability. Third, IDBO is used to optimize the number of hidden layer nodes, regularization coefficient, penalty coefficient, and kernel parameter in DHKELM, which improves the prediction accuracy and further avoid the phenomenon of overfitting. Finally, the principal component extracted by KPCA is taken as the model’s input, and the gas content as the model’s output. The results are compared and analyzed with those of PSO-BPNN, GA-BPNN, PSO-SVM, and DPO-DHKELM models. The results demonstrate that the IDBO-DHKELM model’s performance is the best in each performance index. Compared with other models, the mean absolute error of test samples in the IDBO-DHKELM model is reduced by 0.402, 0.4407, 0.3554, and 0.0646, respectively. The mean absolute percentage error is decreased by 3.67%, 4.07%, 8.27%, and 6.35%, respectively. The root mean square error decreased by 0.7861, 0.7148, 0.3384, and 0.1186, respectively. The coefficient of determination (R 2) is increased by 0.1544, 0.1404, 0.0955, and 0.0396, respectively. Finally, the IDBO-DHKELM model and other models are applied to an experimental mine. The resulting IDBO-DHKELM model is the closest to the actual value, which further verifies the universality and reliability of the model. Therefore, the model is more suitable for the prediction of coal seam gas content.

Gaussian process regression to predict dryout incipience quality of saturated flow boiling in mini/micro-channels

In the present study, a Gaussian process regression (GPR) model is developed to predict the dryout incipience quality for flow boiling in mini / micro – channels based on a consolidated database obtained from Purdue University Boiling and Two – Phase Flow Laboratory (PU – BTPFL) consisting of 997 points from 26 sources. The database includes 13 different working fluids over a wide range of operating conditions: hydraulic diameter (0.51 – 6.0 mm), mass velocities (29 – 2303 kg/ m2 s), liquid – only Reynolds number (125 – 53,770), boiling number (0.31 – 44.3 × 10-4), and reduced pressure (0.005 – 0.78). The inputs to the model were liquid – only Weber number (Wefo), reduced pressure (PR), boiling number (Bo), heated to frictional perimeter ratio(PH/PF), capillary number (Ca) and density ratio (ρg/ρf), and the output was dryout incipience quality. The database was randomly divided into training data to learn GPR kernel (covariance) parameters using maximum likelihood estimation, and test data to evaluate the prediction accuracy of the outputs based on mean absolute error (MAE). Six – different types of covariance functions were tested, and GPR model with automatic relevance detection (ARD) rational quadratic covariance function showed the best overall performance. A performance comparison of approved GPR model was made with an existing highly reliable universal correlation to predict dryout incipience quality for mini / micro – channels. Results show that the developed GPR model exhibits superior generalization ability with an overall MAE of 6.03 %, and a significant reduction of 51.76 % in MAE compared with the universal correlation. Overall, the GPR model was found to be a data efficient machine learning technique for predicting dryout incipience quality for flow boiling in mini / micro – channels based on a consolidated database.

Optimizing projectile aerodynamic parameter identification of kernel extreme learning machine based on improved Dung Beetle Optimizer algorithm

Accurately obtaining the aerodynamic parameters of a projectile is crucial for improving aircraft performance, optimizing design and control, and enhancing weapon strike accuracy. In this study, the Dung Beetle Optimization (DBO) algorithm was utilized to optimize the kernel parameters and regularization coefficients of the Kernel Extreme Learning Machine (KELM). To fully exploit the performance of the DBO algorithm and enhance identification accuracy, four improvement measures were proposed for the DBO algorithm. The enhanced DBO algorithm, known as the Improved Dung Beetle Optimization (IDBO) algorithm, was developed and validated using the CEC2017 test function. The proposed IDBO-KELM algorithm was applied to the aerodynamic parameter identification of projectiles. Comparative analysis with results from ELM, IDBO-ELM, and other models revealed that single ELM struggles to accurately identify aerodynamic parameters. While the identification results of IDBO-ELM were 3–5 orders of magnitude higher than those of ELM, a certain gap still existed between the identification results and the true values in the highly nonlinear transonic region. Notably, the IDBO-KELM model yielded the best identification results, with an overall improvement of 1–2 orders of magnitude compared to IDBO-ELM, effectively reducing errors in identification within the transonic region. Experimental findings demonstrate that the proposed algorithm combines the advantages of high accuracy and stability.

Deep Learning-Based Defects Detection in Keyhole TIG Welding with Enhanced Vision.

Keyhole tungsten inert gas (keyhole TIG) welding is renowned for its advanced efficiency, necessitating a real-time defect detection method that integrates deep learning and enhanced vision techniques. This study employs a multi-layer deep neural network trained on an extensive welding image dataset. Neural networks can capture complex nonlinear relationships through multi-layer transformations without manual feature selection. Conversely, the nonlinear modeling ability of support vector machines (SVM) is limited by manually selected kernel functions and parameters, resulting in poor performance for recognizing burn-through and good welds images. SVMs handle only lower-level features such as porosity and excel only in detecting simple edges and shapes. However, neural networks excel in processing deep feature maps of "molten pools" and can encode deep defects that are often confused in keyhole TIG. Applying a four-class classification task to weld pool images, the neural network adeptly distinguishes various weld states, including good welds, burn-through, partial penetration, and undercut. Experimental results demonstrate high accuracy and real-time performance. A comprehensive dataset, prepared through meticulous preprocessing and augmentation, ensures reliable results. This method provides an effective solution for quality control and defect prevention in keyhole TIG welding process.

Using enhanced Variational Modal Decomposition and Dung Beetle Optimization Algorithm optimization-kernel Extreme Learning Machine model to forecast short-term wind power

With the widespread use of clean energy, the forecasting of wind power has become increasingly significant. Extracting time series from sophisticated wind power data and thus improving the prediction accuracy of wind power generation has become the key to short-term forecasting. This paper proposes a Kernel Extreme Learning Machine (KELM) prediction model based on Crested Porcupine Optimizer (CPO), Variational Modal Decomposition (VMD) with Improved Dung Beetle Optimization Algorithm (QHDBO). Firstly, by analyzing the correlation between the variables in the wind power data, the CPO algorithm is used to optimize the modal decomposition number and the penalty parameter of the VMD and extract the time-series information of the wind power series, and smooth it to obtain a number of sub-sequences with strong regularity. Then, the KELM prediction model is constructed for different subsequences, and the kernel parameters and regularization coefficients of KELM are optimized using the QHDBO algorithm. Finally, the predicted values of different subsequences are reconstructed to obtain the final prediction results. The simulation results show that the CVMD-QHDBO-KELM model can effectively improve the wind power prediction performance, and the MAPE values are all below 9 %, and most of the RE values are below 10 %.

Enhancing Support Vector Machine Performance: A Hybrid Approach with Davidon-Fletcher-Powell Algorithm and Elephant Herding Optimization (EHO-DFP) for Parameter Optimization

Support Vector Machines (SVMs) have gained prominence in machine learning for their capability to establish optimal decision boundaries in high-dimensional spaces. SVMs are powerful machine learning models but can encounter difficulties in achieving optimal performance due to challenges such as selecting appropriate kernel parameters, handling uncertain data, and adapting to complex decision boundaries.. This paper introduces a novel hybrid approach to enhance the performance of Support Vector Machines (SVM) through the integration of the Davidon-Fletcher-Powell (DFP) optimization algorithm and Elephant Herding Optimization (EHO) for parameter tuning. SVM, a robust machine learning algorithm, relies on effective hyperparameter selection for optimal performance. The proposed hybrid model synergistically leverages DFP's efficiency in unconstrained optimization and EHO's exploration-exploitation balance inspired by elephant herding behavior. The fusion of these algorithms address the challenges associated with traditional optimization methods. The hybrid model offers improved convergence towards the global optimum. Experimental results demonstrate the efficacy of the approach, showcasing enhanced SVM performance in terms of minimum 3.3% accuracy and 3.4% efficiency. This research contributes to advancing the field of metaheuristic optimization in machine learning, providing a promising avenue for effective parameter optimization in SVM applications.

On non parametric kernel estimation of the mode of the regression function in the strong mixing random design model with censored data

. This study delves into the conditional mode estimation of a randomly censored scalar response variable operating within the framework of strong mixing conditions. We introduce a kernel-based estimator for the conditional mode function. The principal contribution of this investigation lies in the derivation of the asymptotic distribution and the strong rate of convergence of the newly proposed estimators. These findings are established under a set of fairly comprehensive structural assumptions governing the underlying models. Additionally, we conduct a series of simulation studies to showcase the finite sample performance characteristics of the proposed estimator.

Prediction of Geometric Characteristics of Laser Cladding Layer Based on Least Squares Support Vector Regression and Crested Porcupine Optimization.

The morphology size of laser cladding is a crucial parameter that significantly impacts the quality and performance of the cladding layer. This study proposes a predictive model for the cladding morphology size based on the Least Squares Support Vector Regression (LSSVR) and the Crowned Porcupine Optimization (CPO) algorithm. Specifically, the proposed model takes three key parameters as inputs: laser power, scanning speed, and powder feeding rate, with the width and height of the cladding layer as outputs. To further enhance the predictive accuracy of the LSSVR model, a CPO-based optimization strategy is applied to adjust the penalty factor and kernel parameters. Consequently, the CPO-LSSVR model is established and evaluated against the LSSVR model and the Genetic Algorithm-optimized Backpropagation Neural Network (GA-BP) model in terms of relative error metrics. The experimental results demonstrate that the CPO-LSSVR model can achieve a significantly improved relative error of no more than 2.5%, indicating a substantial enhancement in predictive accuracy compared to other methods and showcasing its superior predictive performance. The high accuracy of the CPO-LSSVR model can effectively guide the selection of laser cladding process parameters and thereby enhance the quality and efficiency of the cladding process.