nips nips2005 nips2005-166 nips2005-166-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Seung-jean Kim, Alessandro Magnani, Stephen Boyd
Abstract: Fisher linear discriminant analysis (LDA) can be sensitive to the problem data. Robust Fisher LDA can systematically alleviate the sensitivity problem by explicitly incorporating a model of data uncertainty in a classification problem and optimizing for the worst-case scenario under this model. The main contribution of this paper is show that with general convex uncertainty models on the problem data, robust Fisher LDA can be carried out using convex optimization. For a certain type of product form uncertainty model, robust Fisher LDA can be carried out at a cost comparable to standard Fisher LDA. The method is demonstrated with some numerical examples. Finally, we show how to extend these results to robust kernel Fisher discriminant analysis, i.e., robust Fisher LDA in a high dimensional feature space. 1
[1] D. Bertsekas, A. Nedi´ , and A. Ozdaglar. Convex Analysis and Optimization. Athena Scientific, c 2003.
[2] C. Bhattacharyya. Second order cone programming formulations for feature selection. Journal of Machine Learning Research, 5:1417–1433, 2004.
[3] S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
[4] B. Efron and R.J. Tibshirani. An Introduction to Bootstrap. Chapman and Hall, London UK, 1993.
[5] K. Huang, H. Yang, I. King, M. Lyu, and L. Chan. The minimum error minimax probability machine. Journal of Machine Learning Research, 5:1253–1286, 2004.
[6] G. Lanckriet, L. El Ghaoui, C. Bhattacharyya, and M. Jordan. A robust minimax approach to classification. Journal of Machine Learning Research, 3:555–582, 2002.
[7] S. Mika, G. R¨ tsch, and K. M¨ ller. A mathematical programming approach to the kernel Fisher a u algorithm, 2001. In Advances in Neural Information Processing Systems, 13, pp. 591-597, MIT Press.
[8] S. Verd´ and H. Poor. On minimax robustness: A general approach and applications. IEEE u Transactions on Information Theory, 30(2):328–340, 1984.