Sciweavers

329 search results - page 22 / 66
» Probably Approximately Correct Learning
Sort
View
ACL
2010
13 years 5 months ago
Learning Phrase-Based Spelling Error Models from Clickthrough Data
This paper explores the use of clickthrough data for query spelling correction. First, large amounts of query-correction pairs are derived by analyzing users' query reformula...
Xu Sun, Jianfeng Gao, Daniel Micol, Chris Quirk
CVPR
2011
IEEE
13 years 3 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
ICML
2008
IEEE
14 years 8 months ago
Bolasso: model consistent Lasso estimation through the bootstrap
We consider the least-square linear regression problem with regularization by the 1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptot...
Francis R. Bach
ICML
2010
IEEE
13 years 8 months ago
Non-Local Contrastive Objectives
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller
ICML
2010
IEEE
13 years 8 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang