A Convex Method for Locating Regions of Interest with Multi-instance Learning
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Correlated multi-label feature selection
Proceedings of the 20th ACM international conference on Information and knowledge management
Distributed convergence to Nash equilibria in two-network zero-sum games
Automatica (Journal of IFAC)
Regularized robust optimization: the optimal portfolio execution case
Computational Optimization and Applications
Convex and scalable weakly labeled SVMs
The Journal of Machine Learning Research
| Hi-index | 0.00 |
This paper concerns a fractional function of the form $x^Ta/\sqrt{x^TBx}$, where $B$ is positive definite. We consider the game of choosing $x$ from a convex set, to maximize the function, and choosing $(a,B)$ from a convex set, to minimize it. We prove the existence of a saddle point and describe an efficient method, based on convex optimization, for computing it. We describe applications in machine learning (robust Fisher linear discriminant analysis), signal processing (robust beamforming and robust matched filtering), and finance (robust portfolio selection). In these applications, $x$ corresponds to some design variables to be chosen, and the pair $(a,B)$ corresponds to the statistical model, which is uncertain.