Overview of QUIC-SVD - UMass Graphics Lab - University of ...

More documents

Recommendations

Info

Overview of QUIC-SVD • 5 Steps: 1. Select a leaf node with maximum estimated L2 error; 2. Split the node and create two child nodes; 3. Calculate and insert the mean vector of each child to the basis set V (replacing the parent vector), orthogonalized; 4. Estimate the error of newly added child nodes; 5. Repeat steps 1—4 until the termination criteria is satisfied. 18
GPU Implementation of QUIC-SVD • Computation cost mostly on constructing the tree. • Most expensive steps: • Computing vector inner products and row means • Basis orthogonalization 19
Page 1 and 2: A GPU-based Approximate SVD Algorit
Page 3 and 4: Introduction • Approximate SVD
Page 5 and 6: Introduction • Sample-based Appro
Page 7 and 8: Our Goal • Map QUIC-SVD onto the
Page 9 and 10: Our Work • A CUDA implementation
Page 11 and 12: Overview of QUIC-SVD [Holmes et al.
Page 17: Overview of QUIC-SVD • Monte Carl
Page 21 and 22: Parallelize Gram Schmidt Orthogonal
Page 23 and 24: Parallelize Gram Schmidt Orthogonal
Page 25 and 26: Extract the Final Result • Input:
Page 27 and 28: … … … … Partitioned QUIC-SV
Page 29 and 30: Partitioned QUIC-SVD 29
Page 31 and 32: Implementation Details • Main imp
Page 33 and 34: Performance • Comparisons: 1. Mat
Page 35 and 36: Performance - Speedup Factors 35
Page 37 and 38: Performance - CPU vs. GPU QUIC-SVD
Page 39 and 40: Integration with Manifold Alignment
Page 41 and 42: Future Work • Be able to process

Overview of QUIC-SVD - UMass Graphics Lab - University of ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?