notes

Unnamed repository; edit this file 'description' to name the repository.
Log | Files | Refs

commit ab87b381b8a20905e186b6336c9380f20be8afe6
parent db3bd2d675567bcd5434b1554fad841593e4023e
Author: Andrew <andrewlaack1@gmail.com>
Date:   Thu, 18 Apr 2024 09:53:04 -0500

Completed l1 of ml course

Diffstat:
ABackpropagation.md | 1+
AClassificationProblem.md | 13+++++++++++++
AClusteringAlgorithms.md | 12++++++++++++
ADeepLearning.md | 1+
AEigenVector.md | 1+
AGradientDescent.md | 1+
AKernels.md | 1+
ALogisticRegression.md | 1+
AMachineLearning.md | 35+++++++++++++++++++++++++++++++++++
ARegressionProblem.md | 10++++++++++
AReinforcementLearning.md | 12++++++++++++
ASupervisedLearning.md | 10++++++++++
ASupportVectorMachine.md | 8++++++++
AUnsupervisedLearning.md | 14++++++++++++++
Mindex.md | 1+
15 files changed, 121 insertions(+), 0 deletions(-)

diff --git a/Backpropagation.md b/Backpropagation.md @@ -0,0 +1 @@ +:todo: diff --git a/ClassificationProblem.md b/ClassificationProblem.md @@ -0,0 +1,13 @@ +:ml: +# Classification Problem + +ML 1 + +# Notes + +**Definition:** There is a discrete number of possible outcomes. + +In other words, if there is a finite set of possible outcomes, it is a classification problem. Oftentimes this manifests as yes/no, but also could include much larger sets of possible values. + +The alternative to this would be a [[RegressionProblem.md]] where the output is a continuous set of values. + diff --git a/ClusteringAlgorithms.md b/ClusteringAlgorithms.md @@ -0,0 +1,12 @@ +:ml: +# Clustering Algorithms + +ML L1 + +## Notes + +**Definition:** An algorithm that groups data together with other like items. + +Think google news group related stories amongst other things. + +This is often done via [[UnsupervisedLearning.md]] diff --git a/DeepLearning.md b/DeepLearning.md @@ -0,0 +1 @@ +:todo: diff --git a/EigenVector.md b/EigenVector.md @@ -0,0 +1 @@ +:todo: diff --git a/GradientDescent.md b/GradientDescent.md @@ -0,0 +1 @@ +:todo: diff --git a/Kernels.md b/Kernels.md @@ -0,0 +1 @@ +:todo: diff --git a/LogisticRegression.md b/LogisticRegression.md @@ -0,0 +1 @@ +:todo: diff --git a/MachineLearning.md b/MachineLearning.md @@ -0,0 +1,35 @@ +:ml: +# Machine Learning + +Links to ML Notes + +**Definition:** Field of study that gives computers the ability to learn without being explicitly programmed. + +## Questions I would like to answer + +1. How do I create new ML models +2. Create chess ML program + +## Main Links + +ML Categories: + +[[SupervisedLearning.md]] +[[UnsupervisedLearning.md]] +[[ReinforcementLearning.md]] + +Concepts: + +[[RegressionProblem.md]] +[[ClassificationProblem.md]] +[[SupportVectorMachine.md]] +[[ClusteringAlgorithms.md]] + +To do: + +[[LogisticRegression.md]] +[[DeepLearning.md]] +[[Kernels.md]] +[[Backpropagation.md]] +[[EigenVector.md]] +[[GradientDescent.md]] diff --git a/RegressionProblem.md b/RegressionProblem.md @@ -0,0 +1,10 @@ +:ml: +# Regression Problem + +ML L1 + +## Notes + +**Definition:** A regression problem is a problem where the value trying to be predicted is continuous (think graphing not yes/no). + +Yes/no problem is a [[ClassificationProblem.md]]. diff --git a/ReinforcementLearning.md b/ReinforcementLearning.md @@ -0,0 +1,12 @@ +:ml: +# Reinforcement Learning + +ML L1 + +## Notes + +**Definition:** Reinforce good behavior and punish bad behavior to get closer to goals. + +If there is not an 'optimal' way to do something, you train the system to do stuff that works. Think like a dog, you let the dog do what it wants and then reinforce good behavior and punish bad behavior. + +This would probably be what you would want to create a chess model. diff --git a/SupervisedLearning.md b/SupervisedLearning.md @@ -0,0 +1,10 @@ +:ml: +# Supervised Learning + +ML L1 + +## Notes + +**Definition:** Training a model by giving it inputs and valid associated outputs. + +Most widely used form of model training. diff --git a/SupportVectorMachine.md b/SupportVectorMachine.md @@ -0,0 +1,8 @@ +:ml: +# Support Vector Machine (SVM) + +ML L1 + +## Notes + +**Definition:** Algorithm that allows for an infinite dimensional vector as an input. diff --git a/UnsupervisedLearning.md b/UnsupervisedLearning.md @@ -0,0 +1,14 @@ +:ml: +# Unsupervised Learning + +ML L1 + +## Notes + +**Definition:** Given a dataset with no labels, find some structure in the underlying data. + +[[ClusteringAlgorithms.md]] are often created using unsupervised learning. + +Another example of unsupervised learning is the cocktail party problem where you have multiple microphones in a room that is noisy, how do you separate out individual voices? + + diff --git a/index.md b/index.md @@ -13,6 +13,7 @@ This is the index for my main note classifications. I will maintain this as a ho ## Other [[ComputerArchitecture.md]] +[[MachineLearning.md]] [[LinuxStuff.md]] ## Technology Books to Read