Abstract
In this paper, we investigate the performance of minimum error entropy (MEE) from a theoretical viewpoint. Owing to resistance of heavy-tailed noise or outliers, as an alternative to traditional robust empirical risk minimization schemes, MEE has drawn particular attention over the last decades and has been successfully used in machine learning. The purpose of this paper is to conduct refined learning theory analysis of MEE and establish its improved rates of convergence without the light-tailed noise. It shows that a new comparison theorem not only characterizes the regression calibration properties of MEE, but also refines the variance of analysis of learning theory.
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.
