Sciweavers

3694 search results - page 360 / 739
» Stochastic complexity in learning
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
TSMC
2008
132views more  TSMC 2008»
15 years 6 months ago
Ensemble Algorithms in Reinforcement Learning
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and fin...
Marco A. Wiering, Hado van Hasselt
NN
1998
Springer
15 years 6 months ago
A tennis serve and upswing learning robot based on bi-directional theory
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
Hiroyuki Miyamoto, Mitsuo Kawato
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
15 years 5 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis