Abstract
Recently, Timotheou has formulated the learning problem of the random neural network (RNN) into a convex non-negative least-square problem that can be solved to optimality. By incorporating this work of problem formulation and the line-search technique, this paper designs a line-search aided non-negative least-square (LNNLS) learning algorithm for the RNN, which is able to find a nearly optimal solution efficiently. (The source code is available at www.yonghuayin.icoc.cc.) Numerical experiments based on datasets with different dimensions have been conducted to demonstrate the efficacy of the LNNLS 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
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.
