Sciweavers

695 search results - page 54 / 139
» Convex Learning with Invariances
Sort
View
JMLR
2010
82views more  JMLR 2010»
13 years 3 months ago
On Spectral Learning
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...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
COLT
2006
Springer
14 years 21 days ago
Ranking with a P-Norm Push
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...
Cynthia Rudin
IDA
2010
Springer
13 years 7 months ago
Clustering with feature order preferences
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...
Jun Sun, Wenbo Zhao, Jiangwei Xue, Zhiyong Shen, Y...
GD
2006
Springer
14 years 19 days ago
Upright-Quad Drawing of st -Planar Learning Spaces
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...
David Eppstein
JMLR
2010
161views more  JMLR 2010»
13 years 3 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
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...
Lin Xiao