Families of Recurrence Generated Three and Four Parametric Activation Functions |
Author(s): |
| Anton Iliev , Faculty of Mathematics and Informatics, University of Plovdiv Paisii Hilendarski; Nikolay Kyurkchiev, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences; Svetoslav Markov, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences |
Keywords: |
| Three–Parametric Hyperbolic Tangent Activation Function (3–PHTA), Four–Parametric Hyperbolic Tangent Activation function (4–PHTA), Sign Function, Hausdorff distance, Upper and Lower Bounds |
Abstract |
|
In this note we construct families of recurrence generated three and four–parametric activation functions. We prove precise upper and lower estimates for the Hausdorff approximation of the sign function by means of these families. Numerical examples, illustrating our results are given. In Appendix 3 we provide an analysis of recurrence generated family of parametric Verhulst logistic functions. The results obtained in this article as well performed ultra-sensitive analysis in Appendix 1–3 may find important applications in the field of neural networks. |
Other Details |
|
Paper ID: IJSRDV4I120508 Published in: Volume : 4, Issue : 12 Publication Date: 01/03/2017 Page(s): 746-750 |
Article Preview |
|
|
|
|
