Abstract
Implementation of the K29 learning algorithm presents the problem of finding a root of an often non-invertible function. Numerical methods giving approximations to these roots have small numerical inaccuracies. These inaccuracies, despite possibly seeming negligible, can accumulate quickly when applied to K29. The main mathematical result of this paper presents a simple but novel derivation of two formulae, which directly calculate predictions for the K29 (and the regularised version K29*) learning algorithms. We present comparisons between this new implementation and the numerical method through empirical investigation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
