引導式測驗 · 中等 等級

期望最大化演算法測驗

遵循潛變數模型中的 E 步和 M 步,並將似然改善與全域最適性或模型效度區分開來。

相關引導路徑期望最大化演算法
問題 1 的 8

E-step 使用目前參數計算什麼?

預覽每個問題8 問題

當您參加測驗時,就會出現答案和解釋。

  1. E-step 使用目前參數計算什麼?
    • Conditional expectations of complete-data quantities or log likelihood
    • The global maximum of observed likelihood
    • Hard labels for every hidden variable by necessity
    • A new validation dataset
  2. 在高斯混合中,責任代表什麼?
    • Fixed labels known before fitting
    • Posterior membership probabilities for observations across components
    • Component means multiplied by covariances
    • The number of EM iterations remaining
  3. 計算出期望後,M 步驟會做什麼?
    • Changes the number of features automatically
    • Replaces all observations with component labels
    • Maximizes the expected complete-data objective over parameters
    • Computes the validation likelihood only
  4. 在適當的假設下,精確的 EM 能提供什麼保證?
    • The selected model is scientifically correct
    • It finds the unique global optimum
    • Every hidden assignment becomes certain
    • Observed-data likelihood does not decrease at each iteration
  5. 不同的 EM 初始化以不同的可能性結束。這說明什麼?
    • The E-step is unnecessary
    • The optimization is sensitive to starts and may have local optima
    • The data contain no latent variables
    • All parameter estimates are unbiased
  6. Why are mixture responsibilities not automatically hard assignments?
    • They are class labels copied from the target
    • They are always equal for every observation
    • They are probabilities that can distribute one observation across components
    • They represent only missing data
  7. What does a small likelihood improvement at stopping indicate?
    • The latent structure has causal meaning
    • The model is proven adequate
    • The global optimum is certain
    • The chosen numerical convergence criterion was met
  8. How does generalized EM differ from exact EM?
    • Its M-step may increase the expected objective without fully maximizing it
    • It removes the latent variables
    • It guarantees a global optimum
    • It replaces likelihood with classification accuracy