9 search results - page 1 / 2 » The Concave-Convex Procedure (CCCP) |
88
Voted
NIPS
2001
14 years 11 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
If appropriately used, prior knowledge can significantly improve the predictive accuracy of learning algorithms or reduce the amount of training data needed. In this paper we intr...
112
click to vote
JMLR
2012
13 years 3 days ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
110
click to vote
TKDE
2012
13 years 2 days ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...