Abstract
Since the online learning framework that make a compromise of the correctness and conservativeness is proposed by Kivinen and Warmuth,the framework have been referenced widely,but in gradient descent and exponentiated gradient algorithms proposed by Kivinen and Warmuth,the approximation step in the derivation of loss function of objection function lead to bad results.In this work,by means of duality theory of optimization,the novel non-approximation classifier algorithms based on square distance and relative entropy loss,relative entropy distance and relative entropy loss are proposed.Experimental results show that the proposed classifiers are always more accurate than the gradient descent and exponentiated gradient algorithms proposed by Kivinen and Warmuth in the real datasets.
Published Version
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.
