1393 search results - page 95 / 279 » Machine Learning by Function Decomposition |
110
click to vote
COLT
2004
Springer
15 years 5 months ago
2004
Springer
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
119
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
108
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
In this paper, we propose a probabilistic kernel approach to preference learning based on Gaussian processes. A new likelihood function is proposed to capture the preference relat...
111
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
140
Voted
CVIU
2008
15 years 1 months ago
2008
This paper presents a search engine architecture, RETIN, aiming at retrieving complex categories in large image databases. For indexing, a scheme based on a two-step quantization ...