Kuis terkait panduan · Sedang Tingkat

Kuis Propagasi Mundur

Uji gradien propagasi mundur, urutan ketergantungan terbalik, nilai penerusan yang di-cache, perkalian aturan rantai, jumlah jalur bersama, dan pemisahan pengoptimal.

Jalur panduan terkaitPropagasi mundur
Pertanyaan 1 dari 8

What quantity does backpropagation compute for a neural network's relevant weights?

Pratinjau setiap pertanyaan8 pertanyaan

Jawaban dan penjelasan muncul saat Anda mengikuti kuis.

  1. What quantity does backpropagation compute for a neural network's relevant weights?
    • Derivatives of the loss with respect to those weights
    • A causal percentage of total error uniquely assigned to each weight
    • The architecture drawing without any calculation
    • A permanently updated set of weights without an optimizer
  2. Aturan matematika manakah yang menjadi inti dari propagasi mundur?
    • Teorema Pythagoras
    • Teorema Bayes
    • Aturan rantai kalkulus
    • Rumus kuadrat
  3. Why can reverse-mode backpropagation compute many parameter derivatives efficiently?
    • It avoids all local derivatives
    • It reuses graph structure and relevant intermediate results
    • It calculates only the output prediction again
    • It guarantees every implementation has exactly one forward pass of runtime
  4. Dalam urutan apa backpropagation menghitung gradien?
    • Dari lapisan masukan menuju lapisan keluaran
    • Semua lapisan secara bersamaan tanpa urutan
    • Hanya untuk lapisan tersembunyi tengah
    • Dari lapisan keluaran ke belakang menuju lapisan masukan
  5. Does computing backpropagation gradients by itself establish that model weights were updated?
    • Yes; every backward computation automatically applies a learning rate
    • Yes; gradient values always replace the weights directly
    • No; the optimizer update is a separate step
    • Only if the network has no parameters
  6. In a conventional cached-backpropagation workflow, what does the forward computation provide for later derivative calculations?
    • Relevant intermediate values that can be retained for the backward computation
    • A completed optimizer update without any update rule
    • A guarantee that all later evaluation errors disappear
    • A permanent deletion of the training objective
  7. On one composed backpropagation path, local scalar derivatives are three and four. What is their chain-rule product?
    • Tujuh
    • Satu
    • Three quarters
    • Twelve
  8. A shared parameter has loss-gradient contributions two and five through two paths. What combined contribution is accumulated?
    • Sepuluh
    • Tujuh
    • Tiga
    • Two fifths