Perceptrons and FeedForward ANN's Flashcards

1
Q

What is a perceptron?

A

An equation that takes a number of inputs, and gives a single output value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the inputs to a perceptron?

A

The value of the input, multiplied by its weight (how valuable the input is).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What does an activation function do?

A

It decides whether the output of one perceptron is enough to give as input to the next layer of perceptrons

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are some issues with training a perceptron on some data?

A

There may be overfitting. This is when the model has perfectly separated the classes, meaning that it cannot be generalised (used on other data - it is useless)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How do we estimate weights?

A

Initialise weights. Can be all 0, or a random number

Iterate through each sample in the training dataset
- Calculate the predicted output
- Update the weights based on this

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the relationship between input magnitude and ∆ weight?

A

The larger the input magnitude, the larger effect it has on ∆ weight

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is learning rate?

A

It is a measure that controls how fast a network learns
It can be constant or adaptive

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the issue with the learning rate being too big?

A

The network may take a long time to reach the global minimum or oscillate around it forever

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the issue with the learning rate being too small?

A

The network may become trapped in a local minimum

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

When do we stop training a network?

A

When the error falls below an acceptable threshold

When the change in instantaneous error falls below an acceptable threshold

When it has completed a predetermined amount of iterations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly