Idanwo ti o sopọ mọ itọsọna · Alabọde Ipele

Awọn adanwo Awọn Nẹtiwọọki Nẹtiwọọki loorekoore

Review recurrent states, ordered inputs, gradient challenges, gates, training parallelism, numerical updates, and training-memory limits.

Jẹmọ itọsọna awọn ọnaAwọn nẹtiwọki Neural Loorekoore
Ibeere 1 ti 8

What recurrent information does a conventional unidirectional RNN combine with each new input?

Awotẹlẹ gbogbo ibeere8 ibeere

Awọn idahun ati awọn alaye han bi o ṣe n mu ibeere naa.

  1. What recurrent information does a conventional unidirectional RNN combine with each new input?
    • Only the previous printed prediction with no internal state
    • A fresh unrelated dataset at every step
    • The previous hidden state
    • No parameters or intermediate information
  2. How should an RNN hidden state be understood?
    • An evolving internal representation that may summarize earlier inputs
    • A guaranteed lossless archive of every earlier input
    • The network's entire training dataset on disk
    • Only a final class label with no intermediate role
  3. Which training difficulty can arise from propagating RNN gradients through many time steps?
    • A guarantee that every hidden state grows without bound
    • Vanishing or exploding gradient magnitudes
    • An automatic change from speech to image inputs
    • Permanent deletion of the training objective
  4. Bawo ni awọn LSTMs ati awọn GRU ṣe ilọsiwaju lori awọn RNN lasan?
    • Wọn yọ gbogbo iranti kuro lati nẹtiwọki
    • Wọn ṣiṣẹ nikan lori awọn nọmba, kii ṣe ọrọ
    • Wọn ṣe ikẹkọ laisi eyikeyi data
    • Wọn lo awọn ẹnu-ọna lati ṣakoso iru alaye lati tọju, imudojuiwọn, tabi sọnù
  5. Iru data wo ni awọn RNN ṣe apẹrẹ pataki fun?
    • Awọn data lẹsẹsẹ bi ọrọ, ọrọ, ati jara akoko
    • Awọn fọto ti o ni ẹyọkan laisi aṣẹ
    • Laileto unordered awọn nọmba
    • Awọn awoṣe ile onisẹpo mẹta nikan
  6. What training-computation difference does the original transformer architecture offer compared with a conventional sequential RNN?
    • Guaranteed fully parallel autoregressive generation
    • A guarantee that no training examples are needed
    • More parallel computation across training positions and direct attention interactions
    • A model with no learned parameters
  7. In the stated linear recurrent illustration h-new equals one-half h-previous plus x, what is h-new for h-previous two and x three?
    • Marun
    • Ọkan
    • Meje
    • Mẹrin
  8. Why does a fixed-size RNN inference state not establish constant memory for full-sequence training?
    • Training never uses intermediate values
    • Backpropagation through time may store or recompute information across many steps
    • Every model deletes its parameters before learning
    • A fixed state guarantees every historical input is retained exactly