Study Guide & Practice Routes

Find a starting point, rebuild missing skills, and practise before moving on

A book route with connected decisions

The book front matter explains the learning path and how to judge progress. Read a chapter’s theory, attempt its application lab, then reconstruct the decision with changed assumptions. The projects connect several chapters; the glossary links terminology to small examples.

Contents
1. Start from the beginning 2. Find and repair a knowledge gap 3. Work through a section 4. Find practice by topic 5. Choose a research track

1. Start from the beginning

The primers are a learning route, not an entrance exam. Start with Primer 0 if mathematical notation or proofs feel unfamiliar. Continue with Primer A for vectors and matrices, then Primer B for calculus and optimization. Their opening refreshers help rebuild the algebra, matrix arithmetic and derivatives used later.

Primer C introduces probability; Primer D introduces systems and control; Primer E introduces reinforcement learning and neural networks. These subjects are taught here. You do not need a previous course in them.

After the primers, read the numbered modules in order for the most direct route through the whole site. For a shorter route, use the tracks below and follow each module’s “Before you start” links whenever a listed skill is unfamiliar.

2. Find and repair a knowledge gap

Use these questions to locate a gap. Try answering first, then open the worked check. If the explanation is unfamiliar, follow its review link and practise the Easy problems there before returning.

Algebra check — solve 2x + 3 = 7

Find x and check it in the original equation.

Show hint

Undo addition first, then undo multiplication. Perform the same operation on both sides.

Show answer

Subtract 3 from both sides to obtain 2x = 4. Divide both sides by 2 to obtain x = 2. Substitution checks the answer: 2 × 2 + 3 = 7. When a derivation rearranges an equation, write these intermediate steps until they feel routine. Continue with functions in Primer 0.

Vector check — measure the vector (3, 4)

Find its Euclidean length and explain why that differs from adding its coordinates.

Show hint

Square the coordinates, add, then take a square root.

Show answer

The squared Euclidean length is 3² + 4² = 9 + 16 = 25, so the length is √25 = 5. Adding absolute coordinates gives 7, a different measure called the 1-norm. Later safety bounds depend on which norm is used. Review vectors, inner products and norms in Primer A.

Matrix check — multiply rows by a column

A matrix has rows (1, 2) and (0, 1). What is its product with the column vector (1, 3)?

Show hint

Each output coordinate is the dot product of one row with the input column.

Show answer

The first output is 1 × 1 + 2 × 3 = 7. The second is 0 × 1 + 1 × 3 = 3. The product is the column vector (7, 3). This is a map from one vector to another; matrix norms later measure how much such maps stretch inputs. Review the refresher at the start of Primer A.

Calculus check — distinguish a value from a derivative

For f(x) = x², find f(3) and f′(3). What does each number describe?

Show hint

Evaluate the function for the first quantity. Differentiate before evaluating the second.

Show answer

The function value is f(3) = 3² = 9. The power rule gives f′(x) = 2x, hence f′(3) = 6. The value is the height of the graph; the derivative is its local slope. For a small change Δx, the output change is approximately 6Δx near x = 3. Review the calculus refresher and learning route in Primer B.

Probability check — complement and independent trials

A coin lands heads with probability 0.25. Find the probability of tails in one toss and of heads in both of two independent tosses.

Show hint

Complementary outcomes have probabilities adding to 1. Independent joint outcomes have probabilities that multiply.

Show answer

Tails has probability 1 − 0.25 = 0.75. Independence gives a probability of 0.25 × 0.25 = 0.0625 for two heads. The multiplication relies on independence; it cannot be assumed for arbitrary repeated observations. Review random variables in Primer C and conditioning and independence.

3. Work through a section

  1. Check the prerequisites. Follow a linked definition you cannot explain and try its Easy practice. Return to your original page afterward.
  2. Read the idea and the small example. Identify what goes in, what comes out, and what the guarantee says in words. Copy one calculation and fill in its intermediate algebra.
  3. Read a theorem in two passes. First list its assumptions and conclusion. Then follow the proof and mark where each assumption is used. Optional literature comparisons can wait until the core example is clear.
  4. Practise in order. Easy rebuilds notation and calculation; Medium applies a method; Hard combines methods or audits a guarantee. Use a hint before the solution. After checking, close the solution and redo the problem without looking.
  5. Use the explorer to test understanding. Predict what changing one parameter will do, change it, and explain the result. A simulation helps understanding; the theorem’s assumptions determine what is guaranteed.
  6. Check readiness to continue. Explain the main idea without the page, solve an Easy problem and a Medium problem, and say why the important assumptions matter. If one part fails, use the review link for that part and retry.

4. Find practice by topic

Primer routes link to section-by-section practice. Each numbered module’s graded set starts with four Easy exercises, continues with four Medium exercises, and ends with four Hard exercises. The original longer assignments remain available after that set.

TopicPractice and review route
Notation, proofs, limitsPrimer 0 practice route
Vectors, matrices, norms, SVDPrimer A practice route
Calculus, convexity, optimizationPrimer B practice route
Probability, confidence, riskPrimer C practice route
Systems, stability, feedbackPrimer D practice route
MDPs, RL, neural networksPrimer E practice route
1. Safety meaningsGraded practice
2. Duality, LMIs, S-procedureGraded practice
3. Kernels and Gaussian processesGraded practice
4. Safe Bayesian optimizationGraded practice
5. Assumptions behind safe BOGraded practice
6. Global safe explorationGraded practice
7. Viability and safe valuesGraded practice
8. CMDPs and multipliersGraded practice
9. Safe policy updatesGraded practice
10. Barriers and safety filtersGraded practice
11. Lyapunov certificates and MPCGraded practice
12. SDP Lipschitz boundsGraded practice
13. Networks with built-in boundsGraded practice
14. Networks in feedbackGraded practice
15. VerificationGraded practice

5. Choose a research track

Use the numbered order when studying everything. For a focused track, read its core modules and fill in their linked prerequisites before tackling the proofs. A module’s reading route distinguishes its first-pass material from later comparisons.

Use the references after the explanation

The Formula Sheet helps retrieve a formula and its assumptions; follow its source-page link to relearn the argument. The Paper Atlas helps choose deeper reading. The Open Problems page is a later research extension, with background links for each problem.