3412 search results - page 351 / 683 » Efficient Reinforcement Learning |
207
click to vote
JMLR
2010
15 years 1 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
184
click to vote
CSCWD
2007
Springer
16 years 26 days ago
2007
Springer
More and more learners tend to utilise e-learning as their learning platform. The privacy of the users’ digital identities of e-learning has become a big concern. This paper pro...
197
click to vote
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
190
click to vote
UAI
2008
15 years 8 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
140
click to vote
UAI
1998
15 years 8 months ago
1998
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs). We argue that simple...