In neural network theory, we analyze two strategies for learning weights: backpropagation and random selection. The former is common in ANNs with one or more hidden layers, while the latter is becoming popular in ANNs with exactly one hidden layer and weights chosen based on the “extreme learning machine” (ELM) paradigm proposed in [4]. We show that despite the empirical success of ELM, its theoretical platform, proposed in [4], has no sound mathematical basis. We demonstrate a dataset on which ELM training and backpropagation strategies cannot obtain satisfactory accuracy. We reopen the question of a new mathematical basis with answers to the problems posed.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Randomness Versus Backpropagation in Machine Learning

  • Irina Perfilieva,
  • Piotr Artiemjew,
  • Agnieszka Niemczynowicz

摘要

In neural network theory, we analyze two strategies for learning weights: backpropagation and random selection. The former is common in ANNs with one or more hidden layers, while the latter is becoming popular in ANNs with exactly one hidden layer and weights chosen based on the “extreme learning machine” (ELM) paradigm proposed in [4]. We show that despite the empirical success of ELM, its theoretical platform, proposed in [4], has no sound mathematical basis. We demonstrate a dataset on which ELM training and backpropagation strategies cannot obtain satisfactory accuracy. We reopen the question of a new mathematical basis with answers to the problems posed.