Tutorvo

Recurrent Networks by Hand: Hidden States, Unrolling Through Time, Vanishing Gradients, LSTM Gates, GRU Cells & Sequence Prediction

See how a network remembers. You will run a tiny recurrent cell step by step, unroll it over a toy sequence, measure how gradients shrink across time, compute forget, input and output gates and the cell state of an LSTM, compare it with a GRU, count parameters and predict the next value of a toy series, with given weights and every cell checked as you go.

8 lessons 8 labs 2.2 h Certificate

  • One-time payment
  • 14-day money-back guarantee
  • Secure checkout with Stripe

What you'll build

What you will be able to do

Each lab ends with a concrete result that you build yourself and the checker confirms, cell by cell.

  • Lay out a toy parcel series one time step per row, add the previous value, the change and a 0–1 scaled input, turn two four-word sentences into numbers with a vocabulary and see that a plain sum cannot tell them apart while a leaky memory can.
  • Run a one-unit recurrent cell over six scaled inputs: feed the previous hidden state back in, compute the pre-activation z_t, squash it with tanh written with EXP and follow the hidden state to the end of the sequence.
  • Unroll the cell sideways over five four-word toy reviews, keep only the final hidden state as the summary of each review, turn it into a probability with a sigmoid output and see that reversing the words changes the score.
  • Compute the factor u·(1 − h²) that a gradient is multiplied by at every step back, chain ten steps with PRODUCT for a small and a large recurrent weight and chart how the signal vanishes or explodes.
  • Run a one-unit LSTM cell with given weights: compute the forget, input and output gates with sigmoids, the candidate with tanh, update the cell state c_t = f·c_(t−1) + i·g and the hidden state h_t = o·tanh(c_t), and carry both into the next step.
  • Run a one-unit GRU over the same six inputs as the LSTM: compute the update and reset gates, the candidate with the reset applied to the old state, blend old and new state with the update gate and chart the GRU and LSTM hidden states side by side.
  • Count the weights of a simple cell, a GRU and an LSTM for six layer sizes with h·(h + x + 1) per gate, turn the LSTM count into storage at 4 bytes per weight and add up a stacked two-layer LSTM.
  • Run a recurrent cell with given trained weights over twelve weeks of toy visitor counts, turn each hidden state into a forecast for the following week, compare the mean absolute error with the naive last-week forecast, chart actual vs forecast and read off the forecast for week 13.

About this course

How does a neural network carry information from one word to the next? You find out with small numbers you calculate yourself. Sequences are laid out one time step per row, and a simple recurrent cell combines each input with the previous hidden state through tanh. You unroll the cell over short toy reviews and turn the last hidden state into a sentiment score. Multiplying factors backwards through time shows why gradients vanish or explode. Then you work through the forget, input and output gates and the cell state of an LSTM, compare it with the leaner GRU and count the weights each design needs. The final lab forecasts a toy series and checks it against a naive guess.

Curriculum

Course content

8 lessons · 8 labs · 2.2 h · final exam

  1. Unlocked when you buy the course
  2. Unlocked when you buy the course
  3. Unlocked when you buy the course
  4. Unlocked when you buy the course
  5. Unlocked when you buy the course
  6. Unlocked when you buy the course
  7. Unlocked when you buy the course
  8. Unlocked when you buy the course
  9. Final exam12 questions, 75% to pass, unlimited retries.

Certificate

Finish with a certificate you can verify

Complete every lesson and pass the final exam to receive a certificate of completion for this course, with a unique credential ID and a public verification page.

  • Names the course, your score and the date of issue
  • A verification link for your CV or LinkedIn profile
  • 12 questions, 75% to pass, unlimited retries.

A Tutorvo certificate confirms that you completed a course. It is not an official or professional qualification.

Illustration. Your certificate shows your own name, course and credential ID.

Before you buy

Questions about this course

Is this a subscription?

No. You pay $9.99 once for this course. There is no subscription and nothing renews automatically. Prices are in US dollars; taxes may be added where required.

What exactly do I get?

All lessons and labs of this course, the final exam and the certificate, including later updates to the course, for as long as Tutorvo offers it. Access is personal and tied to your account.

Can I get a refund?

Yes. If you are not satisfied, email hello@tutorvo.com within 14 days of buying and we refund the course in full via Stripe. The guarantee does not apply once a certificate for the course has been issued to you, or where there are signs of abuse.

When can I start?

Right after payment. Access starts immediately at your request; for consumers in the EU/EEA the statutory right of withdrawal therefore ends once access has begun, while our 14-day money-back guarantee applies regardless.

Do I need Excel or other software?

No. The labs run in a spreadsheet inside your browser on a laptop, tablet or phone. Function names and syntax follow Excel.

Is the certificate an official qualification?

No. It confirms that you completed all lessons of the course and passed its final exam. It is not an official, state-recognised or professional qualification. The name is taken from your profile when the certificate is issued.

Full details are in our Terms · hello@tutorvo.com

$9.99one-time payment
Buy course