Sciweavers

175 search results - page 2 / 35
» Forgetting Reinforced Cases
Sort
View
CCECE
2006
IEEE
13 years 9 months ago
Variable Step-Size Affine Projection Algorithm with a Weighted and Regularized Projection Matrix
This paper presents a forgetting factor scheme for variable step-size affine projection algorithms (APA). The proposed scheme uses a forgetting processed input matrix as the projec...
Tao Dai, Andy Adler, Behnam Shahrrava
AI
2010
Springer
13 years 5 months ago
Reasoning under inconsistency: A forgetting-based approach
In this paper, a fairly general framework for reasoning from inconsistent propositional bases is defined. Variable forgetting is used as a basic operation for weakening pieces of ...
Jérôme Lang, Pierre Marquis
NN
2002
Springer
113views Neural Networks» more  NN 2002»
13 years 4 months ago
Control of exploitation-exploration meta-parameter in reinforcement learning
In reinforcement learning (RL), the duality between exploitation and exploration has long been an important issue. This paper presents a new method that controls the balance betwe...
Shin Ishii, Wako Yoshida, Junichiro Yoshimoto
ICML
1996
IEEE
13 years 9 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos
TNN
1998
100views more  TNN 1998»
13 years 4 months ago
A dynamical system perspective of structural learning with forgetting
—Structural learning with forgetting is an established method of using Laplace regularization to generate skeletal artificial neural networks. In this paper we develop a continu...
D. A. Miller, J. M. Zurada