Comparative performance of some popular ANN algorithms on benchmark and function approximation problems
V.K.Dhar, A.K.Tickoo, R.Koul. B.P.Dubey

TL;DR
This paper compares various popular ANN algorithms on benchmark classification and function approximation problems, highlighting their relative performance and suggesting certain functions as new benchmarks.
Contribution
It provides a comparative analysis of multiple ANN algorithms on standard benchmarks and regression problems, identifying the best performers for each task.
Findings
Levenberg-Marquardt yields lowest RMS error for parity and spiral problems.
Higher Order Neurons excel on IRIS data.
Neuro Fuzzy performs best on XOR problem.
Abstract
We report an inter-comparison of some popular algorithms within the artificial neural network domain (viz., Local search algorithms, global search algorithms, higher order algorithms and the hybrid algorithms) by applying them to the standard benchmarking problems like the IRIS data, XOR/N-Bit parity and Two Spiral. Apart from giving a brief description of these algorithms, the results obtained for the above benchmark problems are presented in the paper. The results suggest that while Levenberg-Marquardt algorithm yields the lowest RMS error for the N-bit Parity and the Two Spiral problems, Higher Order Neurons algorithm gives the best results for the IRIS data problem. The best results for the XOR problem are obtained with the Neuro Fuzzy algorithm. The above algorithms were also applied for solving several regression problems such as cos(x) and a few special functions like the Gamma…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
