liveBook · Manning

Optimizer

As explained in Applied Reinforcement Learning

An optimizer is an algorithm that updates model parameters using an objective function and, commonly, its gradients.

An optimizer updates a network’s parameters using gradients computed by backpropagation. Backpropagation traces how changes flow through layered functions; the optimizer uses those gradients to adjust the parameters, like turning the model’s knobs so it can learn end to end. section 8.2

How Applied Reinforcement Learning covers it

How deep it goes
Defines the optimizer’s role after explaining gradient flow, but does not specify an update rule.
Examples
Uses a turn-the-knobs analogy and contrasts small linear-model parameter sets with deep networks’ thousands or millions of parameters.
What it assumes
Explains gradient chaining before parameter updates, building the connection from layered functions to learning.
What you can do after
Understand how gradients from backpropagation guide parameter updates across a deep network.
How it connects
Connects optimizers to backpropagation, gradients, loss functions, and deep neural networks.

Also explained in

Compare how 3 books explain optimizer →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Applied Reinforcement Learning. The section links point to the parts of the book it draws on.