Sciweavers

23 search results - page 2 / 5
» Application specific loss minimization using gradient boosti...
Sort
View
JMLR
2002
140views more  JMLR 2002»
13 years 5 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
ETVC
2008
13 years 7 months ago
Intrinsic Geometries in Learning
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
Richard Nock, Frank Nielsen
IPM
2008
100views more  IPM 2008»
13 years 5 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
ICIP
2009
IEEE
14 years 6 months ago
Early Terminating Algorithms For Adaboost Based Detectors
In this paper we propose an early termination algorithm for speeding up the detection phase of the Adaboost based detectors. In the basic algorithm, at a specific search location,...
CVPR
2004
IEEE
14 years 7 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...