Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Lära Challenge: Whitening via Eigenvalue Decomposition | Whitening and Decorrelation
Feature Scaling and Normalization Deep Dive

bookChallenge: Whitening via Eigenvalue Decomposition

Uppgift

Swipe to start coding

You are given a dataset X (2D NumPy array) with correlated features. Your goal is to perform feature whitening — transforming the data so that features become uncorrelated and have unit variance, using eigenvalue decomposition of the covariance matrix.

Steps:

  1. Center the data (subtract column means).
  2. Compute the covariance matrix cov_matrix using np.cov(X_centered, rowvar=False).
  3. Perform eigenvalue decomposition with np.linalg.eigh.
  4. Compute a regularized whitening matrix:
    eps = 1e-10
    eig_vals_safe = np.where(eig_vals < eps, eps, eig_vals)
    whitening_matrix = eig_vecs @ np.diag(1.0 / np.sqrt(eig_vals_safe)) @ eig_vecs.T
    
    The eps prevents division by zero for near-zero eigenvalues (rank-deficient data).
  5. Compute the whitened data:
    X_whitened = X_centered @ whitening_matrix
    
  6. Verify that the covariance of X_whitened is close to the identity matrix in the nonzero subspace.

Lösning

Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

Avsnitt 3. Kapitel 4
single

single

Fråga AI

expand

Fråga AI

ChatGPT

Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal

close

Awesome!

Completion rate improved to 5.26

bookChallenge: Whitening via Eigenvalue Decomposition

Svep för att visa menyn

Uppgift

Swipe to start coding

You are given a dataset X (2D NumPy array) with correlated features. Your goal is to perform feature whitening — transforming the data so that features become uncorrelated and have unit variance, using eigenvalue decomposition of the covariance matrix.

Steps:

  1. Center the data (subtract column means).
  2. Compute the covariance matrix cov_matrix using np.cov(X_centered, rowvar=False).
  3. Perform eigenvalue decomposition with np.linalg.eigh.
  4. Compute a regularized whitening matrix:
    eps = 1e-10
    eig_vals_safe = np.where(eig_vals < eps, eps, eig_vals)
    whitening_matrix = eig_vecs @ np.diag(1.0 / np.sqrt(eig_vals_safe)) @ eig_vecs.T
    
    The eps prevents division by zero for near-zero eigenvalues (rank-deficient data).
  5. Compute the whitened data:
    X_whitened = X_centered @ whitening_matrix
    
  6. Verify that the covariance of X_whitened is close to the identity matrix in the nonzero subspace.

Lösning

Switch to desktopByt till skrivbordet för praktisk övningFortsätt där du är med ett av alternativen nedan
Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

Avsnitt 3. Kapitel 4
single

single

some-alt