1252 search results - page 133 / 251 » Minimizing Learned Clauses |
155
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
133
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
141
click to vote
ICDM
2003
IEEE
15 years 10 months ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
150
click to vote
NIPS
2008
15 years 6 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
140
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...