Sciweavers

2750 search results - page 275 / 550
» Learning Efficient Parsing
Sort
View
ICGI
2010
Springer
15 years 1 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
ICML
2009
IEEE
16 years 4 months ago
Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery
We develop a cyclical blockwise coordinate descent algorithm for the multi-task Lasso that efficiently solves problems with thousands of features and tasks. The main result shows ...
Han Liu, Mark Palatucci, Jian Zhang
ICML
2008
IEEE
16 years 4 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
ICML
2005
IEEE
16 years 4 months ago
Coarticulation: an approach for generating concurrent plans in Markov decision processes
We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees ...
Khashayar Rohanimanesh, Sridhar Mahadevan
126
Voted
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
16 years 4 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio