Sciweavers

3653 search results - page 12 / 731
» Learning of Partial Languages
Sort
View
JMLR
2012
11 years 11 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
ECML
2006
Springer
14 years 9 days ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
ICML
2010
IEEE
13 years 6 months ago
Approximate Predictive Representations of Partially Observable Systems
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
Monica Dinculescu, Doina Precup