liveBook · Manning

Timestep

As explained in Inside Deep Learning: Math, Algorithms, Models

A discrete position in a sequence or recurrent computation at which the model updates state.

A timestep is one discrete position in an ordered sequence and one update of a recurrent computation. At timestep t, an RNN combines the previous hidden state hₜ₋₁ with the current input xₜ to produce hₜ, a summary of everything seen so far. section 4.1.2

In an RNN implementation:

  • T is the total number of timesteps, while each xₜ is a same-sized feature vector. section 4.1.2
  • PyTorch commonly represents sequence batches as (B, T, D): batch size, timesteps, and features per timestep. section 4.2

Weather sequence

For daily weather, xₜ can contain the high, low, and mean temperature for day t. Processing days in natural order lets hₜ summarize that day and all preceding days; h_T can support a prediction for the entire sequence. section 4.1.2

How Inside Deep Learning: Math, Algorithms, Models covers it

How deep it goes
Defines timestep notation, state propagation, tensor dimensions, and an explicit loop, but does not derive recurrent internals.
Examples
Uses ordered weather vectors, an unrolled three-timestep RNN, and (B, T, D) sequence tensors.
What it assumes
Assumes sequence data can be represented as vectors and distinguishes batch size, timestep count, and feature count.
What you can do after
Apply via PyTorch by arranging inputs as (B, T, D) and iterating over T recurrent updates.
How it connects
Connects timesteps to sequences, recurrent neural networks, hidden states, tensor shapes, and one-dimensional convolutions.

Also explained in

Compare how 5 books explain timestep →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Inside Deep Learning: Math, Algorithms, Models. The section links point to the parts of the book it draws on.