Learning Algorithms Flashcards

1
Q
  • Regression vs Classification
A
  • Continuous vs discrete
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  • Parameter vs Hyperparameter
A
  • Parameter – properties learned by model during training (DT threshold value or NN connection weight)
  • Hyperparameter – this you choose before learning process (Dt: branch amounts or NN hidden layers and size)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  • Strategy for automatic selection of feature values on branch splitting
A

Choose a statistical term to use as the threshold (mean, median)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  • What is black box in learning algorithm
A
  • Multiple hidden layers or nodes that are not easily interpretable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is meant by generalization and how well do DT and NN perform at this?

A
  • DT: based on tree depth and pruning, prone to overfit not good at generalising
  • NN: based on complexity and regularization techniques, more good to generalising, less likely to overfitting.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

We used different names for training and loss function in physics based modelling, what are they?

A
  • Calibration and objective function
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
  • How to extend classification models to predict categories?
A

Create a binary classifier to compare the features against each other

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