An algorithm for a least-square approximation problem of unknown systems
Yutaka Maeda, Yakichi Kanata
Abstract
Yutaka Maeda, Yakichi Kanata
Abstract
The authors consider a problem of finding a least-squares approximation parameter that minimizes the output error of unknown systems. When the dimension of the output is equal to the dimension of the input, one can apply the stochastic approximation algorithm. On the other hand, if the dimension of the output is greater than the dimension of the input, one cannot use stochastic approximation. The authors propose an algorithm that is applicable to this problem. This algorithm is an extension of the Robbins-Monro stochastic approximation procedure. A convergence theorem for this proposed procedure is demonstrated.>
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The authors consider a problem of finding a least-squares approximation parameter that minimizes the output error of unknown systems. When the dimension of the output is equal to the dimension of the input, one can apply the stochastic approximation algorithm. On the other hand, if the dimension of the output is greater than the dimension of the input, one cannot use stochastic approximation. The authors propose an algorithm that is applicable to this problem. This algorithm is an extension of the Robbins-Monro stochastic approximation procedure. A convergence theorem for this proposed procedure is demonstrated.>
Key concepts: Dimension (graph theory), Stochastic approximation, Approximation algorithm, Convergence (economics), Approximation error, Extension (predicate logic), Mathematics, Algorithm