Timezone: »
Recently, there has been substantial interest in using large amounts of unlabeled data to learn word representations which can then be used as features in supervised classifiers for NLP tasks. However, most current approaches are slow to train, do not model context of the word, and lack theoretical grounding. In this paper, we present a new learning method, Low Rank Multi-View Learning (LR-MVL) which uses a fast spectral method to estimate low dimensional context-specific word representations from unlabeled data. These representation features can then be used with any supervised learner. LR-MVL is extremely fast, gives guaranteed convergence to a global optimum, is theoretically elegant, and achieves state-of-the-art performance on named entity recognition (NER) and chunking problems.
Author Information
Paramveer Dhillon (University of Pennsylvania)
Dean P Foster (University of Pennsylvania)
Lyle Ungar (University of Pennsylvania)
More from the Same Authors
-
2014 Poster: large scale canonical correlation analysis with iterative least squares »
Yichao Lu · Dean P Foster -
2013 Poster: One-shot learning and big data with n=2 »
Lee H Dicker · Dean P Foster -
2013 Poster: New Subsampling Algorithms for Fast Least Squares Regression »
Paramveer Dhillon · Yichao Lu · Dean P Foster · Lyle Ungar -
2013 Poster: Faster Ridge Regression via the Subsampled Randomized Hadamard Transform »
Yichao Lu · Paramveer Dhillon · Dean P Foster · Lyle Ungar -
2012 Poster: A Spectral Algorithm for Latent Dirichlet Allocation »
Anima Anandkumar · Dean P Foster · Daniel Hsu · Sham M Kakade · Yi-Kai Liu -
2012 Spotlight: A Spectral Algorithm for Latent Dirichlet Allocation »
Anima Anandkumar · Dean P Foster · Daniel Hsu · Sham M Kakade · Yi-Kai Liu -
2011 Poster: Stochastic convex optimization with bandit feedback »
Alekh Agarwal · Dean P Foster · Daniel Hsu · Sham M Kakade · Sasha Rakhlin -
2008 Poster: Regularized Learning with Networks of Features »
Ted Sandler · John Blitzer · Partha P Talukdar · Lyle Ungar