The Cobb-Douglas Learning Machine

Sebastián Maldonado*, Julio López, Miguel Carrasco

*Autor correspondiente de este trabajo

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

Resumen

In this paper, we propose a novel machine learning approach based on robust optimization. Our proposal defines the task of maximizing the two class accuracies of a binary classification problem as a Cobb-Douglas function. This function is well known in production economics and is used to model the relationship between two or more inputs as well as the quantity produced by those inputs. A robust optimization problem is defined to construct the decision function. The goal of the model is to classify each training pattern correctly, up to a given class accuracy, even for the worst possible data distribution. We demonstrate the theoretical advantages of the Cobb-Douglas function in terms of the properties of the resulting second-order cone programming problem. Important extensions are proposed and discussed, including the use of kernel functions and regularization. Experiments performed on several classification datasets confirm these advantages, leading to the best average performance in comparison to various alternative classifiers.

Idioma originalInglés
Número de artículo108701
PublicaciónPattern Recognition
Volumen128
DOI
EstadoPublicada - ago. 2022

Nota bibliográfica

Publisher Copyright:
© 2022 Elsevier Ltd

Huella

Profundice en los temas de investigación de 'The Cobb-Douglas Learning Machine'. En conjunto forman una huella única.

Citar esto