Cutting plane approach for efficient minimax risk classifiers in high-dimensional settings

K. R. Bondugula, S. Mazuelas Franco, A. Pérez

High-dimensional data is common in multiple areas, such as health care and genomics, where the number of features can be hundreds of thousands. In such scenarios, the large number of features often lead to inefficient learning. Recently, methods based on constraint generation have enabled efficient learning of L1-regularized support vector machines (SVMs). In this work, we present efficient learning algorithm based on cutting plane approach for the recently proposed minimax risk classifiers (MRCs). The presented iterative algorithm obtains a sequence of MRCs with decreasing worst-case error probabilities while learning. Therefore, the algorithm can address the trade-off between training time and the classifier performance that can be suitable for the scenarios discussed above. In addition, the algorithm also provides a greedy feature selection as a side benefit.

Keywords: Supervised classification, minimax classification, high-dimensional learning, cutting plane methods

Posters II
November 9, 2023  11:40 AM
CC: coffee break Hall

V. López López, Y. Jimenez Agudelo, P. Llamocca Portella, C. Guevara Maldonado, D. Urgelés Puértolas, M. Espinosa Ruíz

J. Ollero Hinojosa

F. Scielzo Ortiz, A. Grané Chávez

I. Rodriguez Moreno, I. Irigoien Garbizu, J. M. Martinez Otzeta, B. Sierra Araujo, C. Arenas Sola

J. M. Sánchez Santos, M. J. Rivas López, A. Lorenzo Hernández, M. Suárez Barrios

J. Gutiérrez Botella, C. Armero, M. Pata, T. Kneib, F. Gude-Sampedro

L. Aixalà-Perelló, X. Barber, A. López-Quílez

B. Sawik, A. Agustin

A. V. Garcia Luengo, I. Oña Casado

E. Gómez Déniz, E. Calderín-Ojeda, F. J. Vázquez-Polo