Matrix factorization basics in ML Python

Introduction

Matrix factorization helps us break a big table of numbers into smaller, simpler tables. This makes it easier to find hidden patterns and make predictions.

When you want to recommend movies to users based on their past ratings.

When you need to fill in missing values in a large dataset.

When you want to find groups or clusters in data like customer preferences.

When you want to reduce the size of data while keeping important information.

When you want to understand relationships between items and users in a simple way.

Syntax

ML Python

Given a matrix R (m x n), find two matrices P (m x k) and Q (k x n) such that:
R ≈ P x Q
where k is the number of latent features (smaller than m and n).

The number k controls how much detail you keep.

Matrix multiplication of P and Q reconstructs an approximation of R.

Examples

This example shows a user-item rating matrix with missing values (0). We want to find two smaller matrices to approximate it.

ML Python

R = [[5, 3, 0],
     [4, 0, 0],
     [1, 1, 0],
     [0, 0, 5],
     [0, 0, 4]]

Find P (5 x 2) and Q (2 x 3) such that R ≈ P x Q

These are example factor matrices. Multiplying P and Q gives an approximation of the original matrix R.

ML Python

P = [[1.2, 0.5],
     [1.0, 0.3],
     [0.5, 0.7],
     [0.0, 1.5],
     [0.1, 1.3]]

Q = [[4.0, 2.5, 0.1],
     [0.2, 0.3, 4.5]]

Sample Model

This code shows a simple matrix factorization using gradient descent to approximate a user-item rating matrix. It updates two smaller matrices to reconstruct the original matrix.

ML Python

import numpy as np

# Original matrix with missing values as zeros
R = np.array([
    [5, 3, 0],
    [4, 0, 0],
    [1, 1, 0],
    [0, 0, 5],
    [0, 0, 4]
], dtype=float)

# Number of latent features
k = 2

# Initialize P and Q with random values
np.random.seed(42)
P = np.random.rand(R.shape[0], k)
Q = np.random.rand(k, R.shape[1])

# Set learning rate and iterations
alpha = 0.01
iterations = 5000

# Matrix factorization using gradient descent
for _ in range(iterations):
    for i in range(R.shape[0]):
        for j in range(R.shape[1]):
            if R[i, j] > 0:  # Only update for known ratings
                eij = R[i, j] - np.dot(P[i, :], Q[:, j])
                for r in range(k):
                    P[i, r] += alpha * 2 * eij * Q[r, j]
                    Q[r, j] += alpha * 2 * eij * P[i, r]

# Reconstruct the matrix
R_hat = np.dot(P, Q)

# Print original and reconstructed matrices
print("Original matrix R:")
print(R)
print("\nReconstructed matrix R_hat (approximation):")
print(np.round(R_hat, 2))

Important Notes

Matrix factorization works best when the matrix is mostly filled with known values.

Choosing the right number of latent features (k) is important: too small loses detail, too large may overfit.

Gradient descent updates P and Q to reduce the difference between the original and reconstructed matrix.

Summary

Matrix factorization breaks a big matrix into smaller ones to find hidden patterns.

It helps predict missing values and understand relationships in data.

Simple algorithms like gradient descent can find these smaller matrices step by step.

Practice

1. What is the main goal of matrix factorization in machine learning?

easy

A. To break a large matrix into smaller matrices to find hidden patterns

B. To increase the size of a matrix for better accuracy

C. To convert a matrix into a single number

D. To sort the matrix rows in ascending order

Solution

1. Step 1: Understand matrix factorization purpose

   Matrix factorization breaks a big matrix into smaller ones to reveal hidden structures or patterns.

2. Step 2: Compare options with this purpose

   Only To break a large matrix into smaller matrices to find hidden patterns correctly describes this goal; others describe unrelated tasks.

3. Final Answer:

   To break a large matrix into smaller matrices to find hidden patterns -> Option A

4. Quick Check:

   Matrix factorization = breaking matrix into smaller ones [OK]

Hint: Matrix factorization means splitting matrix to find patterns [OK]

Common Mistakes:

• Thinking matrix factorization increases matrix size
• Confusing factorization with sorting or summarizing
• Assuming it converts matrix to a single value

2. Which of the following is the correct way to represent matrix factorization of a matrix R into two matrices P and Q?

easy

A. R = P + Q

B. R = P * Q (matrix multiplication)

C. R = P - Q

D. R = P / Q

Solution

1. Step 1: Recall matrix factorization formula

   Matrix factorization expresses R as the product of two smaller matrices P and Q.

2. Step 2: Identify correct mathematical operation

   Matrix multiplication (*) is used, not addition, subtraction, or division.

3. Final Answer:

   R = P * Q (matrix multiplication) -> Option B

4. Quick Check:

   Matrix factorization = matrix multiplication [OK]

Hint: Matrix factorization uses multiplication, not addition [OK]

Common Mistakes:

• Using addition or subtraction instead of multiplication
• Confusing element-wise operations with matrix multiplication
• Thinking division applies to matrices here

3. Given the following Python code using NumPy for matrix factorization approximation:

import numpy as np
R = np.array([[5, 3], [4, 0]])
P = np.array([[1, 0], [0, 1]])
Q = np.array([[5, 3], [4, 2]])
approx = np.dot(P, Q)
print(approx)

What is the output printed?

medium

A. [[5 3]
[4 2]]

B. [[5 3]
[0 0]]

C. [[1 0]
[0 1]]

D. [[9 3]
[4 2]]

Solution

1. Step 1: Calculate matrix multiplication np.dot(P, Q)

   Multiplying P=[[1,0],[0,1]] by Q=[[5,3],[4,2]] results in Q itself because P is identity-like.

2. Step 2: Confirm output matches Q

   The result is [[5,3],[4,2]], matching [[5 3] [4 2]] exactly.

3. Final Answer:

   [[5 3] [4 2]] -> Option A

4. Quick Check:

   Identity matrix times Q = Q [OK]

Hint: Identity matrix times any matrix equals that matrix [OK]

Common Mistakes:

• Confusing element-wise multiplication with dot product
• Misreading P as zero matrix
• Expecting zeros in output due to zero in R

4. Consider this Python snippet for matrix factorization update step:

import numpy as np
R = np.array([[5, 3], [4, 0]])
P = np.array([[1, 0], [0, 1]])
Q = np.array([[5, 3], [4, 2]])
for i in range(2):
    for j in range(2):
        if R[i][j] != 0:
            error = R[i][j] - np.dot(P[i, :], Q[:, j])
            P[i, :] += 0.01 * error * Q[:, j]
print(P)

What is the main issue with this code?

medium

A. The update step incorrectly updates P using Q's columns instead of rows

B. The error calculation uses wrong indices for R

C. The learning rate 0.01 is too large causing divergence

D. The code misses updating Q matrix

Solution

1. Step 1: Analyze update step for matrix factorization

   Matrix factorization updates both P and Q to reduce error, but code updates only P.

2. Step 2: Identify missing update for Q

   Q is never updated, so factorization won't improve fully.

3. Final Answer:

   The code misses updating Q matrix -> Option D

4. Quick Check:

   Both P and Q must be updated [OK]

Hint: Update both P and Q matrices in factorization [OK]

Common Mistakes:

• Thinking only P needs updating
• Confusing error calculation indices
• Assuming learning rate causes error here

5. You have a user-item rating matrix with many missing values. Which approach best uses matrix factorization to predict missing ratings?

hard

A. Fill missing values with zeros and factorize the full matrix directly

B. Ignore missing values and factorize only the submatrix of known ratings

C. Factorize the matrix into two smaller matrices and use gradient descent to minimize error only on known ratings

D. Use matrix addition to combine user and item matrices

Solution

1. Step 1: Understand handling missing values in matrix factorization

   Missing values should not be treated as zeros; only known ratings guide factorization.

2. Step 2: Use gradient descent minimizing error on known ratings

   This approach updates factor matrices to predict missing values accurately.

3. Final Answer:

   Factorize the matrix into two smaller matrices and use gradient descent to minimize error only on known ratings -> Option C

4. Quick Check:

   Minimize error on known ratings for prediction [OK]

Hint: Train only on known ratings, predict missing [OK]

Common Mistakes:

• Filling missing values with zeros distorts learning
• Ignoring missing values loses data context
• Using addition instead of multiplication for factorization