Matrix factorization basics in ML Python - Model Pipeline Trace

Model Pipeline - Matrix factorization basics

This pipeline shows how matrix factorization breaks a big table of numbers into two smaller tables. This helps us find hidden patterns and make predictions, like guessing missing ratings in a movie rating table.

Data Flow - 5 Stages

1Input data

1000 rows x 500 columns→Original user-item rating matrix with some missing values→1000 rows x 500 columns

User 1 rated Movie 1 as 4, Movie 2 as missing, Movie 3 as 5

↓

2Initialize factor matrices

1000 rows x 500 columns→Create two smaller matrices: User features (1000 x 10) and Item features (500 x 10)→User features: 1000 rows x 10 columns, Item features: 500 rows x 10 columns

User 1 features: [0.1, 0.3, ..., 0.05], Movie 1 features: [0.2, 0.4, ..., 0.1]

↓

3Matrix multiplication

User features (1000 x 10), Item features (500 x 10)→Multiply user and item feature matrices to approximate original ratings→1000 rows x 500 columns

Predicted rating for User 1 and Movie 1: 3.8

↓

4Loss calculation

Original ratings and predicted ratings (1000 x 500)→Calculate difference only on known ratings to measure error→Single loss value (scalar)

Loss = 0.25

↓

5Update features

User features (1000 x 10), Item features (500 x 10), loss scalar→Adjust user and item features to reduce loss using gradient descent→Updated user features (1000 x 10), updated item features (500 x 10)

User 1 features updated to [0.12, 0.28, ..., 0.06]

Training Trace - Epoch by Epoch

Loss
1.2 |**************
1.0 |**********
0.8 |*******
0.6 |*****
0.4 |***
0.2 |**
0.0 +----------------
     1  5 10 15 20 Epochs

Epoch	Loss ↓	Accuracy ↑	Observation
1	1.20	N/A	Initial loss is high because features are random
5	0.75	N/A	Loss decreases as features start to capture patterns
10	0.45	N/A	Loss continues to decrease steadily
15	0.30	N/A	Model is learning well, loss is much lower
20	0.25	N/A	Loss stabilizes, model converges

Prediction Trace - 3 Layers

Layer 1: Input user and item features

Layer 2: Dot product of user and item features

Layer 3: Compare predicted rating to known rating

Model Quiz - 3 Questions

What happens to the loss value as training progresses?

A It stays the same

B It increases steadily

C It decreases steadily

D It jumps randomly

Key Insight

Matrix factorization learns smaller user and item features that, when multiplied, recreate the original data closely. This helps predict missing values by capturing hidden patterns.

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