quiz bu lëkkale ak tegtal · Diggante Niveau

Laaj ak tasaare ci ginaaw

Saytu gradient yu backpropagation, dellu ginaaw ci doxalinu dependence, valeur yuñ denc ci kanam, bariwaayu sàrtu chaine, somme yoon yuñ bokk, ak tàqale optimisatër.

Yooni njiit yu jëm ciTasaaro ci ginaaw
Laaj 1 de 8

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

Xoolaatal laaj bu nekk8 laaj

Sooy def quiz bi, tontu yi ak leeral yi dañuy feeñ.

  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. Ban sàrtu math mooy xol backpropagation?
    • Théorème du Pythagore
    • Théorème de Bayes
    • Regle chaîne de calcul
    • Formul kaadratik bi
  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. Ci ban yoon la tasaare ginaaw di xayma degrade yi?
    • Liko dalee ci couche biy dugg dem ci couche biy génne
    • Layers yépp benn yoon te amul benn yoon
    • Ci diggu layer bu nëbbu bi kese
    • Liko dalee ci couche biy génne ci ginaaw dem ci couche biy dugg
  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?
    • Juróom ñaar
    • Benn
    • Three quarters
    • Twelve
  8. A shared parameter has loss-gradient contributions two and five through two paths. What combined contribution is accumulated?
    • Fukk
    • Juróom ñaar
    • Ñatt
    • Two fifths