Abstract
Abstract During the implementation of iterative machine learning algorithms for objective function optimization in large-scale distributed environment, they can be blocked when some of the machines failed. In this paper, a hybrid approach is proposed to balance the performance and efficiency. In each iteration, the results from failure machines are abandoned. We will discuss the relationship between accuracy and abandon rate which can be formulated as inequations. It is argued that the speed of this process is highly effective and efficient. The algorithm is demonstrated using real distributed environment and shows significant improvement of speedup results.
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.
