commit 1888c35238bfd791588eaf4faefc7ff79db3a021
parent 96a72055277e638550c4fd7c6b55324ef3ac877e
Author: Andrew Laack <andrew@laack.co>
Date: Sun, 24 May 2026 16:14:54 -0500
Formatting
Diffstat:
24 files changed, 0 insertions(+), 48 deletions(-)
diff --git a/docs/ActiveAttacks.md b/docs/ActiveAttacks.md
@@ -4,8 +4,6 @@
**Chapter:** 1.3
-
-
**Definition:** Active attacks are attacks that are attacks that manipulate data streams.
diff --git a/docs/Affinity.md b/docs/Affinity.md
@@ -2,8 +2,6 @@
ML D5
-
-
**Definition:** Affinity is any measure of how well an instance fits into a given cluster.
This is closely related to unsupervised clustering algorithms.
diff --git a/docs/Bandwidth.md b/docs/Bandwidth.md
@@ -2,8 +2,6 @@
Stats D3
-
-
**Definition:** Bandwidth is a hyperparameter used in smoothing techniques that describes the width of kernels.
With regard to kdes, a higher value means the graph will be more smooth while the inverse is true as well.
diff --git a/docs/Boosting.md b/docs/Boosting.md
@@ -2,8 +2,6 @@
ML D5
-
-
**Definition:** Boosting is the process of combining several weak learners into one strong learner.
The idea of this is to sequentially train predictors to correct the output of prior models.
diff --git a/docs/BulkSynchronousProcessing.md b/docs/BulkSynchronousProcessing.md
@@ -2,8 +2,6 @@
CA L2
-
-
**Definition:** Completing parallel processing and then using [BarrierSynchronization](BarrierSynchronization.md) to join together threads of execution.
This is called bulk because it can be done all concurrently while also having synchronization in the form of a thread join.
diff --git a/docs/ConditionalDisjunction.md b/docs/ConditionalDisjunction.md
@@ -2,6 +2,4 @@
1.3.2
-
-
**Definition:** The conditional disjunction rule states $p \to q \equiv \neg p \vee q$.
diff --git a/docs/ConditionalProbabilities.md b/docs/ConditionalProbabilities.md
@@ -2,8 +2,6 @@
Stats D2 - Prob L2
-
-
**Definition:** Conditional probabilities are probabilities of some outcome given some assumed condition.
An example of this is there is an 80% chance that a republican will be in favor of something. This is a conditional probability where the condition is being republican and the probability is 80%. This is in contrast with the overall probability of being republican and being in favor which also shares a sample space with republican's who aren't, liberals who are, liberals who aren't, independents who are, and independents who aren't. Given this, the overall probability is far lower than the conditional probability which is generally the case.
diff --git a/docs/CumulativeRelativeFrequency.md b/docs/CumulativeRelativeFrequency.md
@@ -2,6 +2,4 @@
Khan
-
-
**Definition:** The cumulative relative frequency of some value is all prior probabilities added up along with the current value's probability.
diff --git a/docs/FisherYatesShuffle.md b/docs/FisherYatesShuffle.md
@@ -1,7 +1,5 @@
# Fisher Yates Shuffle
-
-
**Definition:** The Fisher-Yates sorting algorithm is the most common sorting algorithm whereby you iterate backwards through the list swapping the current index with an arbitrary index that is less than the current until reaching the 0th index.
Implementation:
diff --git a/docs/Isomorphic.md b/docs/Isomorphic.md
@@ -4,8 +4,6 @@
**Chapter:** 3
-
-
---
Linear Algebra:
diff --git a/docs/LasVegasMethod.md b/docs/LasVegasMethod.md
@@ -2,6 +2,4 @@
SS
-
-
**Definition:** The Las Vegas method is similar to the monte carlo method as it uses random sampling, but it always gives the correct answer whereas the monte carlo method does not guarantee a correct answer.
diff --git a/docs/MixedRandomVariable.md b/docs/MixedRandomVariable.md
@@ -2,8 +2,6 @@
Prob L8
-
-
**Definition:** A mixed random variable is a [RandomVariables](RandomVariables.md) comprised of some continuous and discrete randomness.
An example is a random variable where there is a 1/2 chance of flipping a coin (discrete) to get 1 dollar and a 1/2 chance of getting a random number of dollars between 0 and 1 (continuous). This is a tree where the first split is between coin flip and random value then there is another layer where you flip the coin or get the random amount of money.
diff --git a/docs/OnPolicyLearning.md b/docs/OnPolicyLearning.md
@@ -2,8 +2,6 @@
L5
-
-
**Definition:** On policy learning is learning by following the policy.
We sample actions from the policy whilst evaluating the policy.
diff --git a/docs/PProblem.md b/docs/PProblem.md
@@ -2,6 +2,4 @@
U 2.3
-
-
**Definition:** A P problem is a problem that can be both solved and verified in polynomial time.
diff --git a/docs/PartiallyOrderedSet.md b/docs/PartiallyOrderedSet.md
@@ -2,8 +2,6 @@
Ch 9.6
-
-
**Definition:** (S,R) is a partial ordered set (poset) if the relation R is reflexive, antisymmetrice, and transitive with respect to the set S.
Basically, we can define R as {(1,1), (2,2), (3,3), (3,2)} and since this is a partial ordering (reflexive, antisymmetric, and transitive), if we define S as {1,2,3} we see (S,R) is a poset.
diff --git a/docs/RegularLanguages.md b/docs/RegularLanguages.md
@@ -4,6 +4,4 @@
**Lecture:** 1
-
-
**Definition:** A language is a regular language if there exists a finite automaton that recognizes it (ie. the FA's language is the language in question).
diff --git a/docs/Singularity.md b/docs/Singularity.md
@@ -2,6 +2,4 @@
Superintelligence - Bostrom
-
-
**Definition:** The singularity is a future point in time where tech growth becomes uncontrollable and irreversible.
diff --git a/docs/Sparse.md b/docs/Sparse.md
@@ -2,8 +2,6 @@
Ch 4
-
-
**Definition:** A sparse matrix is a matrix mostly containing zeroes.
## Implementation
diff --git a/docs/TargetEncoding.md b/docs/TargetEncoding.md
@@ -2,8 +2,6 @@
ML CH2
-
-
**Definition:** Target encoding is the process of mapping some feature to a representative value that is calculated.
This is different than [LabelEncoding](LabelEncoding.md) as label encoding uses an arbitrary mapping instead of a representative one.
diff --git a/docs/TemporalDifferenceLearning.md b/docs/TemporalDifferenceLearning.md
@@ -2,8 +2,6 @@
L4
-
-
**Definition:** Temporal difference learning is a reinforcement learning process where we update the estimate of being in any given state by using the discounted value of next steps.
This is different than MC because it does not require us to finish the episode, instead we can rely upon other states to calculate our expected return.
diff --git a/docs/Transpose.md b/docs/Transpose.md
@@ -2,8 +2,6 @@
ML P627
-
-
**Definition:** The transpose of a matrix is the matrix flipped over the diagnol by switching the rows and columns.
2 4 1 2 3 4
diff --git a/docs/Tuple.md b/docs/Tuple.md
@@ -2,8 +2,6 @@
Ch 1
-
-
**Definition:** A tuple is an ordered list of elements (like a set but ordered).
A tuple in 2d is an ordered pair.
diff --git a/docs/Walk.md b/docs/Walk.md
@@ -2,6 +2,4 @@
Ch 4
-
-
**Definition:** A walk is a sequence of adjacent nodes where each node can appear multiple times.
diff --git a/docs/WellDefined.md b/docs/WellDefined.md
@@ -2,6 +2,4 @@
1.3.2
-
-
**Definition:** For an object to be well defined it must be unambiguous.
