OCAM: Out-of-core coordinate descent algorithm for matrix completion
SCIE
SCOPUS
- Title
- OCAM: Out-of-core coordinate descent algorithm for matrix completion
- Authors
- Dongha, Lee; Jinoh, Oh; Hwanjo, Yu
- Date Issued
- 2020-04
- Publisher
- ELSEVIER SCIENCE INC
- Abstract
- Recently, there are increasing reports that most datasets can be actually stored in disks of a single off-the-shelf workstation, and utilizing out-of-core methods is much cheaper and even faster than using a distributed system. For these reasons, out-of-core methods have been actively developed for machine learning and graph processing. The goal of this paper is to develop an efficient out-of-core matrix completion method based on coordinate descent approach. Coordinate descent-based matrix completion (CD-MC) has two strong benefits over other approaches: 1) it does not involve heavy computation such as matrix inversion and 2) it does not have step-size hyper-parameters, which reduces the effort for hyper-parameter tuning. Existing solutions for CD-MC have been developed and analyzed for in-memory setting and they do not take disk-I/O into account. Thus, we propose OCAM, a novel out-of-core coordinate descent algorithm for matrix completion. Our evaluation results and cost analyses provide sound evidences supporting the following benefits of OCAM: (1) Scalability - OCAM is a truly scalable out-of-core method and thus decomposes a matrix larger than the size of memory, (2) Efficiency - OCAM is super fast. OCAM is up to 10x faster than the state-of-the-art out-of-core method, and up to 4.1x faster than a competing distributed method when using eight machines. The source code of OCAM will be available for reproducibility. (C) 2019 Published by Elsevier Inc.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/100442
- DOI
- 10.1016/j.ins.2019.09.077
- ISSN
- 0020-0255
- Article Type
- Article
- Citation
- INFORMATION SCIENCES, vol. 514, page. 587 - 604, 2020-04
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.