350 search results - page 12 / 70 » On the symmetry function of a convex set |
166
click to vote
CDC
2008
IEEE
16 years 16 days ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
138
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
165
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
146
click to vote
NIPS
2007
15 years 7 months ago
2007
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
180
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...