Sciweavers

5 search results - page 1 / 1
» Multileave Gradient Descent for Fast Online Learning to Rank
Sort
View
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 8 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
NIPS
2008
14 years 8 days ago
Online Metric Learning and Fast Similarity Search
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
Prateek Jain, Brian Kulis, Inderjit S. Dhillon, Kr...
ACL
2012
12 years 1 months ago
Fast Online Training with Frequency-Adaptive Learning Rates for Chinese Word Segmentation and New Word Detection
We present a joint model for Chinese word segmentation and new word detection. We present high dimensional new features, including word-based features and enriched edge (label-tra...
Xu Sun, Houfeng Wang, Wenjie Li
ICCV
2007
IEEE
15 years 24 days ago
Gradient Feature Selection for Online Boosting
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...
Ting Yu, Xiaoming Liu 0002
ESANN
2006
14 years 7 days ago
Magnification control for batch neural gas
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
Barbara Hammer, Alexander Hasenfuss, Thomas Villma...