Multi-view universum support vector machines with insensitive pinball loss

Multi -view learning (MVL) is a promising field that seeks to make the most of information shared across different views, ultimately improving generalization performance. Numerous multi -view support vector machines (SVMs) have been proposed and shown great success. However, hinge loss is widely used by existing methods, which makes these SVMs sensitive to noise and unstable when re -sampling. Furthermore, many researchers have demonstrated the effectiveness of universum data for supervised learning. This paper proposes a novel MVL method called multi -view universum support vector machine with insensitive pinball loss (Pin-MvUSVM). Specifically, we first integrate the pinball loss into the multi -view learning framework, which is dependent on the quantization distance and is robust to noise. Then, we utilize universum data to explore prior knowledge for MVL, which improves the generalization performance. Moreover, we develop multi -view universum twin support vector machine with insensitive pinball loss (Pin-MvUTSVM) as a low -complexity alternative to improve computational efficiency. It solves a pair of smaller -scale quadratic programming problems (QPPs) and utilizes the dual form of the model to solve two convex optimization problems for obtaining the prediction classifier. We conduct classification experiments on four multi -view datasets, and our results show that the proposed convex models outperform several state-of-the-art models.