695 search results - page 54 / 139 » Convex Learning with Invariances |
109
Voted
JMLR
2010
14 years 10 months ago
2010
In this paper, we study the problem of learning a matrix W from a set of linear measurements. Our formulation consists in solving an optimization problem which involves regulariza...
114
Voted
COLT
2006
Springer
15 years 7 months ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
129
Voted
IDA
2010
Springer
15 years 2 months ago
2010
Springer
We propose a clustering algorithm that effectively utilizes feature order preferences, which have the form that feature s is more important than feature t. Our clustering formulati...
131
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
139
Voted
JMLR
2010
14 years 10 months ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...