Geometric Properties of Quasi-Additive Learning Algorithms

• IKEDA Kazushi

  Kyoto University

Abstract

The family of Quasi-Additive (QA) algorithms is a natural generalization of the perceptron learning, which is a kind of on-line learning having two parameter vectors: One is an accumulation of input vectors and the other is a weight vector for prediction associated with the former by a nonlinear function. We show that the vectors have a dually-flat structure from the information-geometric point of view, and this representation makes it easier to discuss the convergence properties.

Journal

• IEICE transactions on fundamentals of electronics, communications and computer sciences

  IEICE transactions on fundamentals of electronics, communications and computer sciences 89 (10), 2812-2817, 2006-10-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• quasi-additive algorithms
• perceptron
• information geometry

Details

• CRID: 1572543027451325440
• NII Article ID: 110007537759
• NII Book ID: AA10826239
• ISSN: 09168508
• Text Lang: en
• Data Source:
  • CiNii Articles