AI Revision Flashcards

1
Q

What is combinatorial explosion?

A

sIs where the possible combinations or permutations increases rapidly with the size of the input or problem

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

What is the turing test? what is the objective? and provide one example of the test in real life

A

The turing test was a test designed by Alan Turing which consisted of an interrogator being connected to a person and a machine via a terminal and cannot see either of them, and its object would be to find out which candidate is the machine or human only by asking them questions. If the machine could fool the interrogator 30% of the time the machine is considered intelligent.

Real Life Examples: -> CAPTCHA | SIRI

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

What is machine Learning?

A

The ability to learn without being explicitly programmed. Seen as part of AI, it builds a model based on sample data.

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

What is supervised learning vs unsupervised learning

A

Is giving the machine learning model data which is supervised meaning that it relies on label input and output training data where as unsupervised learning processes unlabelled or raw data.

SIMPLE TERMS -> SUPERVISED -> Train a model on labelled data, goal is to predict the label of new instances. UNSUPERVISED -> Analysis of unlabelled data, goal is to uncover hidden patterns

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

What are a few examples of Supervised and Unsupervised Learning: (2 each)

A

Supervised Learning ->
1. Handwriting Recognition
2. Traffic prediction

Unsupervised learning ->
1. Ad targeting ( group similar customer together and send adverts specific to those clusters)
2. Crime hotspot (Identify areas with high crime rates)

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

What is clustering?

A

Is a technique used in unsupervised learning, it is given unlabelled dataset and similarity metric. And the goal is to find ‘natural’ partitioning, or groups of similar data points.

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

What is association rules?

A

Is a technique used in unsupervised learning, it is given a set of transaction records containing items, and it’s goal is to produce dependency rules, to predict occurrence of one variable based on occurrences of another variable(s).

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

What is data mining?

A

Analysis of large quantity of data to discover, valid, non-obvious data to the system, data that should be possible to act on the item and ultimately humans should be able to interpret the pattern/model in data.

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

How is data trained in supervised learning?

A

Data is split into 2 types of data, (Training data) which is used to learn the parameters of the model and (Test data) which is used to test how well the model works

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

What is pros and cons of decision trees

A

Pros -> Easy to interpret and explain decisions, reasonable training time.

Cons -> Small variations in data can lead to very different trees, only simple decision boundaries, over-complex trees - overfitting.

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

How to construct decision trees

A

In decision trees there are a few things to consider,
1. The root node (largest information gain)
2. The Internal nodes so true / false are considered decision rules on features.
3. Leaf nodes predicted class label

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

What is learning regression?

A

Supervised learning technique to estimate a relationship between an output variable Y (label) and input features(s) X | GOAL - Find line of best fit.

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

Pros and cons of learning regression

A

Pros -> easy to interpret, fast to train, can work with limited training data.

Cons -> Only applicable if relationship is linear, relies on assumption, none of the features are highly correlated

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

What is model evaluation?

A

How well does the model do on the validation set.

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

What is model tuning?

A

Adjust model hyperparameters, e.g. -> maximum depth of decision trees

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

What is overfitting?

A

Is where the model that performs well on the training data but poorly on unseen or test data because it has become too specialized to the training data and is not able to generalize well to new data.

17
Q

What is the concept of search space?

A

Set of all possible solutions to a problem

18
Q

Search trees construct

A

Root Node, Child/parent nodes / depth of a node / branches / leaves

States - nodes (possible states of the problem e.g. initial)
Search Space - all nodes in the tree (the set of all states reachable from the initial state)
Operators - Branches (a set of actions that move one state to another.)
Neighbourhood - All possible states reachable from a given state.
Goal Test - Test if the search reached a state that solves the problem
Path Cost - how much it costs to take a particular path

19
Q

What is the issues with search tree?

A

Combinatorial Explosion, Search efficiency (computationally expensive).

20
Q

What is the BFS Method

A

Expand root node first
Expand all nodes at level 1 before expanding level 2

21
Q

What is the DFS Method

A

Expand root node first
Explore one branch before exploring another branch

22
Q

What is the UCS Method

A

Expand root note first
Always remove the smallest cost node first in the queue

23
Q

What is learning rate?

A

Learning rate dictates how quickly the network converges by adjusting different scale to correct the weights.

24
Q

What is a linearly separable function?

A

Is a function which can be separated | Only linearly separable functions can be represented as a single layer NN, e.g. perceptron

25
Q

Explain the learning rate if too low and too high

A

Too low: Very small changes to weights → training will take a very long time however it is guaranteed to converge to correct weights if they exist
Too high: : Drastic adjustment to weights each time → may jump over a good combination of weights

26
Q

Neural network pros and cons

A

Pros - 1.Can learn more complicated decision boundaries.
2. Can handle a large number of features.
Cons - 1.Difficult to interpret, 2.difficult to design neural network architectures that work well for a problem - lots of hyper parameters to tune, 3.slow training time