Abstract
Distributed statistical learning for massive data has attracted enormous attention recently.There are two noteworthy issues in the existing methods. First, they all require that the massive data are randomly distributed on different machines, which is seldom the case in practice. Second, they are usually built upon the least squares, which are sensitive to the heavy-tailed noise and outliers.To fix these problems, we propose a new robust distributed modal regression and also apply it to nonconvex penalized learning problems.The new method can overcome the non-randomly distributed nature of the big data, and the theoretical results also guarantee this statement. Simulation studies and the real world data evaluation are also used to illustrate the proposed methods.
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.