General Questions Flashcards

(23 cards)

1
Q

Supervised Learning

A

Training on data labeld with input/output pairs.

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

Unsupervised Learning

A

Training data without labels. (e.g. clustering)

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

Reinforcement Learning

A

An agent can interact with the environment, performs actions and get a reward for actions.

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

Semi-supervised Learning

A

Learn with a small amount of labled data and utilize unlabeled data to increase performance.

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

Machine Learning

A

Machine learning is a method of data analysis that automates analytical model building. It is a branch of artificial intelligence.

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

Difference between discrete and continuous random variables?

A

Discrete random variables take on a countable number of distinct values.

Example: coin flip

Continuous random variables take on an infinite number of values within a given range.

Example: speed of a car

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

What is Bayes rule?

A

Bayes Rule is a theorem that describes how to update the probabilites of hypotheses when given evidence.

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

What is regression?

A

A machine Learning technique to model the relationship between variables.

Hypothesis function.

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

What is a loss function?

A

A measure for a learning algorithm to determine wether a parameterset theta is good or bad.

Example: Residual sum of squares = 0.5(y-y_pred)**2

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

Was ist overfitting?

A

When data is matched perfectly, but unseen data is not conform with the model.

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

Difference between normal equation and gradient descent in linear regression

A

The normal equation calculates the exact minimum with calculus and matrices. Kind of the perfect solution.

Gradient descent is an approach to the minimum of the loss function, but will never be as good as the normal equation.

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

Log Trick

A

In a likelihood function we multiply the probabilty of each sample. This leads to many multiplications with small numbers.

Instead multiplying we just add those up. To get this we just calculate the log likelihood becaus it turs multiplications into additions.

It also removes the exponential function from the log likelihood.

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

Differences between maximum likelihood and ordinary lieast squares.

A

Both approaches lead to the same solution.

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

Similarities between maximum likelihood and ordinary least square.

A

In ML we want to find argmax of the likelihood function and in ordinary least square we want to find the argmin of the loss function.

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

Decision function

A

A function that predictes a class for a given sample.

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

Define discriminant function

A

Classification Problem. A measure how well an input matches a specific class.

It provides a score y_pred or a probabilty for a certain class.

score∈R and probabilty∈[0, 1]

17
Q

How many discriminant functions do we need for two classes?

A

Just one
f(x)=w^Tx+b=theta^Tx linear discriminant
f(x)=p(y=1|x) probablistic model

with theta=[b, w1^T]^T and x:=[1, x^T]^T

18
Q

Define decison function

A

Gives the result needed to make a classification decision.

with k=1, …, K
Probabalistic: c_pred=argmax p(y=k|x)
Score: c_pred=argmax f_k(x)

19
Q

What is the difference between a discriminant function and a decision function?

A

A discriminant function is a measure for each class how well it fits the input and a decision function gives the result needed to make a classification decision.

20
Q

Was sind Regions?

A

A discriminant function usually divides the space into two subspaces or Regions R.

21
Q

Decision boundary

A

All points on the discriminant function. So that f(x)=0

22
Q

Describe w

A

Orthogonal to all points on the decision boundary

23
Q

Difference k-means and k-nearest

A

K-means is unsupervised and k-nearest is supervised