Reinforcement Learning by Probability Matching

NIPS 1995: Proceedings of the 8th International Conference on Neural Information Processing Systems

Volumn , Issue , 1995, Pages 1080-1086

  Sabes, Philip N ^a   Jordan, Michael I ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK ARCHITECTURE; PROBABILITY DISTRIBUTIONS;

ASSOCIATIVE REINFORCEMENT LEARNING; LEARNING RULES; LOCAL MINIMUMS; MATCHING ALGORITHM; MATCHINGS; MIXTURE OF EXPERTS NETWORK; PROBABILITY MATCHING; PROBABILITY: DISTRIBUTIONS; REINFORCEMENT LEARNINGS; SIMPLE++;

REINFORCEMENT LEARNING;

EID: 85156273296     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Jacobs, R. A., Jordan, M. I., Nowlan, S. J., and Hinton, G. E. (1991). Adaptive mixtures of local experts. Neural Computation, 3:79-87.
2. Phansalkar, V. V. (1991). Learning automata algorithms for connectionist systems - local and global convergence. PhD Thesis, Dept. of Electrical Engineering, India Institute of Science, Bangalore.
3. Sutton, R. S. (1984). Temporal credit assignment in reinforcement learning. PhD Thesis, Dept. of Computer and Information Science, University of Massachusetts, Amherst, MA.
4. Williams, R. J. (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8:229-256.
5. Williams, R. J. and Peng, J. (1991). Function optimization using connectionist reinforcement learning algorithms. Connection Science, 3:241-268.