Is Learning Rate a Good Performance Criterion for Learning?
Abstract
The most frequently used measure of performance for reinforcement learning algorithms is learning rate. That is, how many learning trials are required before the program is able to perform its task adequately. In this paper, we argue that this is not necessarily the best measure of performance and, in some cases, can even be misleading. In control tasks, such as pole balancing, we have found that a program that learns to balance the pole quickly produces a control strategy that is so specific as to make it impossible to transfer expertise from one related task to another. We examine the reasons for this and suggest ways of obtaining general control strategies. We also make the conjecture that, as a broad principle, there is a trade-off between rapid learning rate and the ability to generalise. We also introduce methods for analysing the results of reinforcement learning algorithms to produce readable control rules.
Cite
Text
Sammut and Cribb. "Is Learning Rate a Good Performance Criterion for Learning?." International Conference on Machine Learning, 1990. doi:10.1016/B978-1-55860-141-3.50024-9Markdown
[Sammut and Cribb. "Is Learning Rate a Good Performance Criterion for Learning?." International Conference on Machine Learning, 1990.](https://mlanthology.org/icml/1990/sammut1990icml-learning/) doi:10.1016/B978-1-55860-141-3.50024-9BibTeX
@inproceedings{sammut1990icml-learning,
title = {{Is Learning Rate a Good Performance Criterion for Learning?}},
author = {Sammut, Claude and Cribb, James},
booktitle = {International Conference on Machine Learning},
year = {1990},
pages = {170-178},
doi = {10.1016/B978-1-55860-141-3.50024-9},
url = {https://mlanthology.org/icml/1990/sammut1990icml-learning/}
}