3250 search results - page 57 / 650 » Parameterized Learning Complexity |
ESANN
2001
13 years 11 months ago
2001
Abstract. Sigmoidal or radial transfer functions do not guarantee the best generalization nor fast learning of neural networks. Families of parameterized transfer functions provide...
AAAI
1993
13 years 11 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
AIIA
2007
Springer
14 years 4 months ago
2007
Springer
The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its appli...
UAI
1997
13 years 11 months ago
1997
This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [1...