Publications
2004
1.
Guerrero-Curieses, Alicia; Alaiz-Rodríguez, Rocío; Cid-Sueiro, Jesús
A fixed-point algorithm to minimax learning with neural networks Artículo de revista
En: IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), vol. 34, no 4, pp. 383–392, 2004, (Publisher: IEEE).
Resumen | Enlaces | BibTeX | Etiquetas: loss functions, minimax learning strategy, neural networks, robust classifiers
@article{guerrero-curieses_fixed-point_2004,
title = {A fixed-point algorithm to minimax learning with neural networks},
author = {Alicia Guerrero-Curieses and Rocío Alaiz-Rodríguez and Jesús Cid-Sueiro},
url = {https://ieeexplore.ieee.org/abstract/document/1347290},
year = {2004},
date = {2004-01-01},
journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)},
volume = {34},
number = {4},
pages = {383–392},
abstract = {In some real applications, such as medical diagnosis or remote sensing, available training data do not often reflect the true a priori probabilities of the underlying data distribution. The classifier designed from these data may be suboptimal. Building classifiers that are robust against changes in prior probabilities is possible by applying a minimax learning strategy. In this paper, we propose a simple fixed-point algorithm that is able to train a neural minimax classifier [i.e., a classifier minimizing the worst (maximum) possible risk]. Moreover, we present a new parametric family of loss functions that is able to provide the most accurate estimates for the posterior class probabilities near the decision regions, and we also discuss the application of these functions together with a minimax learning strategy. The results of the experiments carried out on different real databases point out the ability of the proposed algorithm to find the minimax solution and produce a robust classifier when the real a priori probabilities differ from the estimated ones.},
note = {Publisher: IEEE},
keywords = {loss functions, minimax learning strategy, neural networks, robust classifiers},
pubstate = {published},
tppubtype = {article}
}
In some real applications, such as medical diagnosis or remote sensing, available training data do not often reflect the true a priori probabilities of the underlying data distribution. The classifier designed from these data may be suboptimal. Building classifiers that are robust against changes in prior probabilities is possible by applying a minimax learning strategy. In this paper, we propose a simple fixed-point algorithm that is able to train a neural minimax classifier [i.e., a classifier minimizing the worst (maximum) possible risk]. Moreover, we present a new parametric family of loss functions that is able to provide the most accurate estimates for the posterior class probabilities near the decision regions, and we also discuss the application of these functions together with a minimax learning strategy. The results of the experiments carried out on different real databases point out the ability of the proposed algorithm to find the minimax solution and produce a robust classifier when the real a priori probabilities differ from the estimated ones.
2.
Curieses, Alicia Guerrero; Rodríguez, Rocío Alaiz; Sueiro, Jesús Cid
A fixed-point algorithm to minimax learning with neural networks Artículo de revista
En: IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), vol. 34, no 4, pp. 383–392, 2004, (Publisher: IEEE).
Resumen | Enlaces | BibTeX | Etiquetas: loss functions, minimax learning strategy, neural networks, robust classifiers
@article{guerrero_curieses_fixed-point_2004,
title = {A fixed-point algorithm to minimax learning with neural networks},
author = {Alicia Guerrero Curieses and Rocío Alaiz Rodríguez and Jesús Cid Sueiro},
url = {https://ieeexplore.ieee.org/abstract/document/1347290},
year = {2004},
date = {2004-01-01},
journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)},
volume = {34},
number = {4},
pages = {383–392},
abstract = {In some real applications, such as medical diagnosis or remote sensing, available training data do not often reflect the true a priori probabilities of the underlying data distribution. The classifier designed from these data may be suboptimal. Building classifiers that are robust against changes in prior probabilities is possible by applying a minimax learning strategy. In this paper, we propose a simple fixed-point algorithm that is able to train a neural minimax classifier [i.e., a classifier minimizing the worst (maximum) possible risk]. Moreover, we present a new parametric family of loss functions that is able to provide the most accurate estimates for the posterior class probabilities near the decision regions, and we also discuss the application of these functions together with a minimax learning strategy. The results of the experiments carried out on different real databases point out the ability of the proposed algorithm to find the minimax solution and produce a robust classifier when the real a priori probabilities differ from the estimated ones.},
note = {Publisher: IEEE},
keywords = {loss functions, minimax learning strategy, neural networks, robust classifiers},
pubstate = {published},
tppubtype = {article}
}
In some real applications, such as medical diagnosis or remote sensing, available training data do not often reflect the true a priori probabilities of the underlying data distribution. The classifier designed from these data may be suboptimal. Building classifiers that are robust against changes in prior probabilities is possible by applying a minimax learning strategy. In this paper, we propose a simple fixed-point algorithm that is able to train a neural minimax classifier [i.e., a classifier minimizing the worst (maximum) possible risk]. Moreover, we present a new parametric family of loss functions that is able to provide the most accurate estimates for the posterior class probabilities near the decision regions, and we also discuss the application of these functions together with a minimax learning strategy. The results of the experiments carried out on different real databases point out the ability of the proposed algorithm to find the minimax solution and produce a robust classifier when the real a priori probabilities differ from the estimated ones.