716 search results - page 51 / 144 » Optimizing Sorting with Machine Learning Algorithms |
103
click to vote
ESA
2010
Springer
15 years 3 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
124
click to vote
AAAI
2008
15 years 4 months ago
2008
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...
121
click to vote
NN
2008
Springer
15 years 1 months ago
2008
Springer
Learning data representations is a fundamental challenge in modeling neural processes and plays an important role in applications such as object recognition. In multi-stage Optima...
131
click to vote
COLT
1993
Springer
15 years 6 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...