Sciweavers

NIPS
2008
14 years 29 days ago
Bayesian Synchronous Grammar Induction
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of su...
Phil Blunsom, Trevor Cohn, Miles Osborne
NIPS
2008
14 years 29 days ago
Asynchronous Distributed Learning of Topic Models
Distributed learning is a problem of fundamental interest in machine learning and cognitive science. In this paper, we present asynchronous distributed learning algorithms for two...
Arthur Asuncion, Padhraic Smyth, Max Welling
NIPS
2008
14 years 29 days ago
High-dimensional support union recovery in multivariate regression
We study the behavior of block 1/ 2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of...
Guillaume Obozinski, Martin J. Wainwright, Michael...
NIPS
2008
14 years 29 days ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson
NIPS
2008
14 years 29 days ago
Sparse Signal Recovery Using Markov Random Fields
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
Volkan Cevher, Marco F. Duarte, Chinmay Hegde, Ric...
NIPS
2008
14 years 29 days ago
On the Generalization Ability of Online Strongly Convex Programming Algorithms
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
Sham M. Kakade, Ambuj Tewari
NIPS
2008
14 years 29 days ago
QUIC-SVD: Fast SVD Using Cosine Trees
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
Michael P. Holmes, Alexander G. Gray, Charles Lee ...
NIPS
2008
14 years 29 days ago
Sparse Online Learning via Truncated Gradient
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
John Langford, Lihong Li, Tong Zhang
NIPS
2008
14 years 29 days ago
Hierarchical Semi-Markov Conditional Random Fields for Recursive Sequential Data
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
Tran The Truyen, Dinh Q. Phung, Hung Hai Bui, Svet...
NIPS
2008
14 years 29 days ago
Syntactic Topic Models
We develop the syntactic topic model (STM), a nonparametric Bayesian model of parsed documents. The STM generates words that are both thematically and syntactically constrained, w...
Jordan L. Boyd-Graber, David M. Blei