aNet.ai
Machine Learning/Learning path
0day streak0XP · Lv 1
← 4. Learning as an Optimization Problem
Lesson 4 of 12 7 min · 116 words

Objective functions

Loss summed over data, plus any regularisation terms.

The objective function is what the optimiser actually minimises: the average loss over the training set, plus any regularisation terms:

Loss is per example; the objective (also called cost) is over the whole dataset. Some objectives are convex — bowl-shaped with a single global minimum, like linear and logistic regression. Neural-network objectives are non-convex, with many local minima and saddle points, yet gradient methods still find good solutions in practice.

Formula to remember

Gradient descent

Step against the gradient with learning rate η.

Quick check · +5 XP

The gradient of a function points in the direction of…

Practice this topic
Saved in this browser as you type.
aNet.ai · Introduction to Machine Learning · NewUU course outlineProgress saved in this browser