Computational complexity of ALS for Matrix Factorization
Hello,
In the lecture of matrix factorization, for the ALS method, it is asked the computational complexity of computing Z_T and W_T. I tried to determine the computational complexity of computing Z_T. Can you tell me if I am correct please?
Also, it is asked how can you decrease the cost when N and D are large? Is it by decreasing K?
Computational complexity of ALS for Matrix Factorization
Hello,
In the lecture of matrix factorization, for the ALS method, it is asked the computational complexity of computing Z_T and W_T. I tried to determine the computational complexity of computing Z_T. Can you tell me if I am correct please?
Also, it is asked how can you decrease the cost when N and D are large? Is it by decreasing K?
Thank you so much for your help.
1
O(KDN) for both W and Z
Add comment