997 search results - page 85 / 200 » Completely Lazy Learning |
155
click to vote
JMLR
2010
14 years 11 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
123
click to vote
NIPS
2008
15 years 5 months ago
2008
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
151
click to vote
CLOUDCOM
2010
Springer
15 years 2 months ago
2010
Springer
Commercial cloud offerings, such as Amazon's EC2, let users allocate compute resources on demand, charging based on reserved time intervals. While this gives great flexibilit...
149
click to vote
CVPR
1997
IEEE
16 years 6 months ago
1997
IEEE
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
158
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...