Abstract
The learning rate is analyzed for linear learning algorithms in this paper. In the presence of outliers, the robustness of several linear learning algorithms is given and it is shown that an absolute criterion based learning algorithm is more robust than the corresponding quadratic criterion based learning algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.