132 search results - page 8 / 27 » Classification with Sums of Separable Functions |
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
DAS
2010
Springer
14 years 28 days ago
2010
Springer
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...
SIAMIS
2011
13 years 4 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
AAAI
2008
13 years 12 months ago
2008
Classification is one of the most fundamental problems in machine learning, which aims to separate the data from different classes as far away as possible. A common way to get a g...