Please use this identifier to cite or link to this item:
|Title:||A divide-and-conquer method for scalable low-rank latent matrix pursuit||Authors:||Pan, Y.
|Issue Date:||2013||Citation:||Pan, Y., Lai, H., Liu, C., Yan, S. (2013). A divide-and-conquer method for scalable low-rank latent matrix pursuit. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition : 524-531. ScholarBank@NUS Repository. https://doi.org/10.1109/CVPR.2013.74||Abstract:||Data fusion, which effectively fuses multiple prediction lists from different kinds of features to obtain an accurate model, is a crucial component in various computer vision applications. Robust late fusion (RLF) is a recent proposed method that fuses multiple output score lists from different models via pursuing a shared low-rank latent matrix. Despite showing promising performance, the repeated full Singular Value Decomposition operations in RLF's optimization algorithm limits its scalability in real world vision datasets which usually have large number of test examples. To address this issue, we provide a scalable solution for large-scale low-rank latent matrix pursuit by a divide-and-conquer method. The proposed method divides the original low-rank latent matrix learning problem into two size-reduced sub problems, which may be solved via any base algorithm, and combines the results from the sub problems to obtain the final solution. Our theoretical analysis shows that with fixed probability, the proposed divide-and-conquer method has recovery guarantees comparable to those of its base algorithm. Moreover, we develop an efficient base algorithm for the corresponding sub problems by factorizing a large matrix into the product of two size-reduced matrices. We also provide high probability recovery guarantees of the base algorithm. The proposed method is evaluated on various fusion problems in object categorization and video event detection. Under comparable accuracy, the proposed method performs more than 180 times faster than the state-of-the-art baselines on the CCV dataset with about 4,500 test examples for video event detection. © 2013 IEEE.||Source Title:||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition||URI:||http://scholarbank.nus.edu.sg/handle/10635/68781||ISSN:||10636919||DOI:||10.1109/CVPR.2013.74|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 16, 2019
WEB OF SCIENCETM
checked on Jul 16, 2019
checked on Jun 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.