ApproxEigen: An approximate computing technique for large-scale eigen-decomposition
Refereed conference paper presented and published in conference proceedings

Times Cited
Altmetrics Information

Other information
AbstractRecognition, Mining, and Synthesis (RMS) applications are expected to make up much of the computing workloads of the future. Many of these applications (e.g., recommender systems and search engine) are formulated as finding eigenvalues/vectors of large-scale matrices. These applications are inherently error-tolerant, and it is often unnecessary, sometimes even impossible, to calculate all the eigenpairs. Motivated by the above, in this work, we propose a novel approximate computing technique for large-scale eigen-decomposition, namely ApproxEigen, wherein we focus on the practically-used Krylov subspace methods to find finite number of eigenpairs. With ApproxEigen, we provide a set of computation kernels with different levels of approximation for data pre-processing and solution finding, and conduct accuracy tuning under given quality constraints. Experimental results demonstrate that ApproxEigen is able to achieve significant energy-efficiency improvement while keeping high accuracy.
All Author(s) ListZhang Q., Tian Y., Wang T., Yuan F., Xu Q.
Name of Conference34th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2015
Start Date of Conference02/11/2015
End Date of Conference06/11/2015
Place of ConferenceAustin
Country/Region of ConferenceUnited States of America
Detailed descriptionorganized by IEEE/ACM,
Pages824 - 830
LanguagesEnglish-United Kingdom

Last updated on 2021-25-01 at 00:30