A note on greedy algorithm
type: Item
instance of: scholarly article
zbMATH Open document ID: 0979.41012
author: Nahmwoo Hahm
author: Bum Il Hong
publication date: 2002-02-26T00:00:00Z
Mathematics Subject Classification ID: 41A29
Mathematics Subject Classification ID: 41A46
zbMATH DE Number: 1623268
zbMATH Keywords: greedy algorithm
zbMATH Keywords: approximation with constraints
zbMATH Keywords: approximation order
zbMATH Keywords: neural network
zbMATH Keywords: neural network approximation
MaRDI profile type: Publication
title: A note on greedy algorithm
published in: Bulletin of the Korean Mathematical Society
review text: The greedy algorithm is one of the important tools in neural network approximation. The authors construct a greedy algorithm using the arithmetic average of elements of a given subset in a normed linear space. Further, they show that the degree of approximation order is \(O(n^{-1/2})\), which offers a good approximation method for neural networks.
reviewed by: Manfred Tasche
description: scientific article; zbMATH DE number 1623268