output
20052013
most citedNatural Language Processing (almost) from Scratch

5.2k citations

Showing 2012 · cs.LGShow all

12 papers · 2 filters

cs.LG20121 cited

Latent Structured Ranking

Jason Weston, John Blitzer

Many latent (factorized) models have been proposed for recommendation tasks like collaborative filtering and for ranking tasks like document or image retrieval and annotation. Comm…

cs.LG20123 cited

Multi-track Map Matching

Adel Javanmard, Maya Haridasan, Li Zhang

We study algorithms for matching user tracks, consisting of time-ordered location points, to paths in the road network. Previous work has focused on the scenario where the location…

cs.LG201235 cited

On the Difficulty of Nearest Neighbor Search

Junfeng He, Sanjiv Kumar, Shih-Fu Chang

Fast approximate nearest neighbor (NN) search in large databases is becoming popular. Several powerful learning-based formulations have been proposed recently. However, not much at…

cs.LG20129 cited

Adaptive Regularization for Weight Matrices

Koby Crammer, Gal Chechik

Algorithms for learning distributions over weight-vectors, such as AROW were recently shown empirically to achieve state-of-the-art performance at various problems, with strong the…

cs.LG201259 cited

Compact Hyperplane Hashing with Bilinear Functions

Wei Liu, Jun Wang, Yadong Mu +2

Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing ran…

cs.LG2012363 cited

L2 Regularization for Learning Kernels

Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh

The choice of the kernel is critical to the success of many learning algorithms but it is typically left to the user. Instead, the training data can be used to learn the kernel by…