82. SO HOW TO COMPUTE AND ?
Columns of are the eigenvectors of
Columns of are the eigenvectors of
Associated eigenvalues make up the diagonal of
There are very efficient algorithms in the wild
48
83. SO HOW TO COMPUTE AND ?
Columns of are the eigenvectors of
Columns of are the eigenvectors of
Associated eigenvalues make up the diagonal of
There are very efficient algorithms in the wild
Alternate option: find the s and the s that minimize the reconstruction error
(With some orthogonality constraints). There are also very efficient algorithms in the wild
48
84. SO HOW TO COMPUTE AND ?
Columns of are the eigenvectors of
Columns of are the eigenvectors of
Associated eigenvalues make up the diagonal of
There are very efficient algorithms in the wild
Alternate option: find the s and the s that minimize the reconstruction error
(With some orthogonality constraints). There are also very efficient algorithms in the wild
So, piece of cake right?
48
91. MINIMIZATION BY (STOCHASTIC) GRADIENT DESCENT
Our parameter is for all and . The function to be minimized is:
def compute_SVD():
'''Fit pu and qi to known ratings by SGD'''
p = np.random.normal(size=F)
q = np.random.normal(size=F)
for iter in range(n_max_iter):
for u, i, r_ui in rating_hist:
err = r_ui - np.dot(p[u], q[i])
p[u] = p[u] + learning_rate * err * q[i]
q[i] = q[i] + learning_rate * err * p[u]
def estimate_rating(u, i):
return np.dot(p[u], q[i])
53