Sciweavers

107 search results - page 18 / 22
» Learning to rank using gradient descent
Sort
View
118
Voted
PAMI
2010
337views more  PAMI 2010»
14 years 11 months ago
Single-Image Super-Resolution Using Sparse Regression and Natural Image Prior
—This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...
Kwang In Kim, Younghee Kwon
88
Voted
ICML
2008
IEEE
16 years 1 months ago
Random classification noise defeats all convex potential boosters
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...
Philip M. Long, Rocco A. Servedio
WWW
2011
ACM
14 years 7 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
ICML
2004
IEEE
16 years 1 months ago
Links between perceptrons, MLPs and SVMs
We propose to study links between three important classification algorithms: Perceptrons, Multi-Layer Perceptrons (MLPs) and Support Vector Machines (SVMs). We first study ways to...
Ronan Collobert, Samy Bengio
CVPR
2012
IEEE
13 years 3 months ago
Steerable part models
We describe a method for learning steerable deformable part models. Our models exploit the fact that part templates can be written as linear filter banks. We demonstrate that one...
Hamed Pirsiavash, Deva Ramanan