College of Information and Electrical Engineering, China Agricultural University, Beijing 100083, China.
School of Mathematics and Statistics, BeiJing Technology and Business University, Beijing, China.
Neural Netw. 2022 Jun;150:194-212. doi: 10.1016/j.neunet.2022.03.006. Epub 2022 Mar 10.
Direct multi-task twin support vector machine (DMTSVM) is an effective algorithm to deal with multi-task classification problems. However, the generated hyperplane may shift to outliers since the hinge loss is used in DMTSVM. Therefore, we propose an improved multi-task model RaMTTSVM based on ramp loss to handle noisy points more effectively. It could limit the maximal loss value distinctly and put definite restrictions on the influences of noises. But RaMTTSVM is non-convex which should be solved by CCCP, then a series of approximate convex problems need to be solved. So, it may be time-consuming. Motivated by the sparse solution of our RaMTTSVM, we further propose a safe acceleration rule MSA to accelerate the solving speed. Based on optimality conditions and convex optimization theory, MSA could delete a lot of inactive samples corresponding to 0 elements in dual solutions before solving the model. Then the computation speed can be accelerated by just solving reduced problems. The rule contains three different parts that correspond to different parameters and different iteration phases of CCCP. It can be used not only for the first approximate convex problem of CCCP but also for the successive problems during the iteration process. More importantly, our MSA is safe in the sense that the reduced problem can derive an identical optimal solution as the original problem, so the prediction accuracy will not be disturbed. Experimental results on one artificial dataset, ten Benchmark datasets, ten Image datasets and one real wine dataset confirm the generalization and acceleration ability of our proposed algorithm.
直接多任务孪生支持向量机 (DMTSVM) 是一种处理多任务分类问题的有效算法。然而,由于 DMTSVM 中使用了 hinge 损失,生成的超平面可能会向异常值偏移。因此,我们提出了一种基于斜坡损失的改进多任务模型 RaMTTSVM,以更有效地处理噪声点。它可以明显限制最大损失值,并对噪声的影响施加明确的限制。但是 RaMTTSVM 是非凸的,需要通过 CCCP 来解决,然后需要解决一系列近似凸问题。因此,它可能会很耗时。受我们的 RaMTTSVM 稀疏解的启发,我们进一步提出了一种安全加速规则 MSA 来加速求解速度。基于最优性条件和凸优化理论,MSA 在求解模型之前可以删除对偶解中对应于 0 元素的大量非活动样本。然后,通过只求解简化问题,可以加速计算速度。该规则包含三个不同的部分,分别对应于 CCCP 的不同参数和不同迭代阶段。它不仅可以用于 CCCP 的第一个近似凸问题,也可以用于迭代过程中的连续问题。更重要的是,我们的 MSA 是安全的,因为简化问题可以得出与原始问题相同的最优解,因此预测精度不会受到干扰。在一个人工数据集、十个基准数据集、十个图像数据集和一个真实葡萄酒数据集上的实验结果证实了我们提出的算法的泛化和加速能力。