M12 - Unsupervised Learning Flashcards

1
Q

What are the categories of machine learning?

A
  • Supervised learning
  • Unsupervised learning
  • Reinforcement learning
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Explain Supervised Learning and give examples.

A
  • labeled data
  • feedback
    EX. Regression, SVM, Neural Networks
    Object recognition
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Explain Unsupervised learning and give examples.

A
  • no labeled data
  • no feedback

Ex. K-mean, self-organizing maps

Clustering

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

Explain Reinforcement learning and examples.

A
  • reward based learning
  • increase cumulative discounted rewards

Ex. Q-learning, SARSA, TD-learning, DQNs

Robot Navigation

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

What is the motivation behind using unsupervised learning?

A
  • no hand-labeling data required but we can still perform classification
  • find structure (or clusters) in the dataset based on the idea: similar inputs should be located close to each other
  • do not need backprop to adjust the weight
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What kind of models can we create with unsupervised learning?

A
  • find structures (clusters) in the data
  • detect anomalies
  • create auto-association
  • reduce the dimensionality
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

When should we use unsupervised learning?

A
  • when we have a lot of sensory data and we can not hand-label them
  • we do not have a rewards function to guide the behavior of robot
  • we can not structure a score (loss) function to train the network
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How does k-means work?

A
  • Partitions data into k number of mutually exclusive clusters
  • how well a point fits into a cluster is determined by the distance from that point to the cluster’s centre
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What are the convergence criteria for k-means?

A
  1. Number of specific iterations
  2. Until the centres moves with a threshold value
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How do we find correct numbers of K?

A
  • Visualize data
  • Domain knowledge
    Run for different number of K then select the best one
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is competitive learning?

A
  • paradigm different that supervised learning and reinforcement learning
  • the aim is not to map input and output by minimizing a cost function
  • no explicit reward function to tune the behaviour of network
  • form a unit (or neuron) which can be activated for similar inputs
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How does competitive learning work?

A
  • Similar inputs will activate the units that are close to each other
  • the activation of the neuron will increase if the distance between the neuron weights and input vector is closer
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the are the Pseudo-code steps of competitive learning?

A
  1. Initialize the weights for each unit
  2. Derive Euclidean distance for each unit for an input
  3. Select the unit which has the smallest Euclidean distance as the winner unit
  4. Update the weights of the winner unit
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What happens if the learning rate = 0?

A

No updates will be made to the model’s parameters during the training process

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

What if the learning rate = 1?

A

Model’s parameters will be updated by a large step at each iteration

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

What does competitive learning allow you to do?

A
  • cluster the input
  • reduce the dimensions
  • extract features in a unsupervised way
17
Q

What is SOM?

A

Self organizing map = is a variation of competitive learning

18
Q

What does SOM do?

A
  • the units close to each other (by weights) respond to similar inputs and have similar weights
19
Q

What are the limitations of SOM?

A
  • the initialization of the weights may lead to significant differences in the final formation of the SOM
  • training duration increases with dimensions of the network
  • different SOMs can find different similarities for the same inputs
20
Q

Competitive learning vs. Self-organizing maps

A

Competitive Learning:
- Identifies features/prototypes through neuron competition.
- Focuses on individual feature identification.
- Used for feature selection and identification.

Self-Organizing Maps (SOMs):
- Creates a low-dimensional representation of data while preserving topology.
- Emphasizes cluster formation and visualization.
- Used for clustering and visualization tasks.

21
Q

What are the use cases of SOM’s?

A
  • Epigenetic Robot Architecture (ERA)
  • Self-Organized Internal Models Architecture (SOIMA)
22
Q

Explain Epigenetic Robot architecture.

A
  • the units of the architecture are self-organizing maps
  • each SOM can be used to process different modality input
  • missing modality representation can be constructed
23
Q

Explain Self-Organized Internal Models Archtectur.

A
  • the unit of the architecture are self-organizing maps
  • implementation of inverse and forward models in the same architecture
  • missing modality representation can be constructed
  • sensory-motor mapping