commit 512c4f241c024ee9692e1bee68c80a13954ac089 parent f672e47ef840711d665d7c291b39b4bce7b0ba52 Author: AndrewLockVI <andrewlaack1@gmail.com> Date: Tue, 4 Feb 2025 06:41:35 -0600 Updated formatting and styling Diffstat:
674 files changed, 675 insertions(+), 706 deletions(-)
diff --git a/convertLinks.py b/convertLinks.py @@ -1,27 +0,0 @@ -import re -import os - -def split_camel_case(match): - """Insert spaces into CamelCase words.""" - text = match.group(1) - spaced_text = re.sub(r'(?<=[a-z])(?=[A-Z])', ' ', text) - return f'[{spaced_text}]' - -def update_links(text): - """Finds links in brackets and updates CamelCase words.""" - return re.sub(r'\[(\w+)\]', split_camel_case, text) - -def process_directory(directory): - """Processes all files in a given directory.""" - for filename in os.listdir(directory): - filepath = os.path.join(directory, filename) - if os.path.isfile(filepath): - with open(filepath, 'r', encoding='utf-8') as file: - content = file.read() - updated_content = update_links(content) - with open(filepath, 'w', encoding='utf-8') as file: - file.write(updated_content) - -# Example usage -directory_path = "./docs" -process_directory(directory_path) diff --git a/custom_theme/stylesheets/custom.css b/custom_theme/stylesheets/custom.css @@ -70,7 +70,7 @@ background-color: white; width: 100%; margin: 0 auto; - padding-left: 150px; + padding-left: 141px; box-sizing: border-box; } .landing { @@ -111,7 +111,7 @@ position: fixed; /* Keeps it in place */ top: 0; left: 0; - padding-top: 10px; + padding-top: 0px; overflow-y: auto; /* Scroll if needed */ border-right: 2px solid #eeeeee; } @@ -119,7 +119,7 @@ /* Sidebar navigation links */ .sidebar ul { list-style: none; - padding: 0; + padding: 0px; } .sidebar li { @@ -139,7 +139,6 @@ /* Content area to avoid overlap */ .content { - margin-left: 0px; padding-top: 75px; - width: 83%; + width: 86%; } diff --git a/docs/AISafety.md b/docs/AISafety.md @@ -13,7 +13,7 @@ How to define AGI? How to test for AGI? -## Notes + #### Superintelligence - Nick Bostrom diff --git a/docs/AbstractDataType.md b/docs/AbstractDataType.md @@ -2,7 +2,7 @@ CS 202 L14 -## Notes + **Definition:** An ADT is a datatype that specifies it's interfaces but not implementation. This is similar to the relationship between an [[ISA.md]] and [[MicroArchitecture.md]]. diff --git a/docs/Abstraction.md b/docs/Abstraction.md @@ -2,7 +2,7 @@ Abstraction cpu architecture L1 -## Notes + Abstraction hides away the implementation details to higher levels. You only see the interfaces provided to you. diff --git a/docs/Accuracy.md b/docs/Accuracy.md @@ -2,7 +2,7 @@ ML D2 -## Notes + **Definition:** Accuracy in machine learning describes the overall correctness of a model. diff --git a/docs/ActiveAttacks.md b/docs/ActiveAttacks.md @@ -4,7 +4,7 @@ **Chapter:** 1.3 -## Notes + **Definition:** Active attacks are attacks that are attacks that manipulate data streams. diff --git a/docs/AdaBoost.md b/docs/AdaBoost.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Adaboost is a boosting algorithm that boosts training instances that the prior model underfit (missed). diff --git a/docs/AdaGrad.md b/docs/AdaGrad.md @@ -2,7 +2,7 @@ ML P584 -## Notes + **Definition:** Adaptively adjusts learning rate based on historical gradients. diff --git a/docs/Adam.md b/docs/Adam.md @@ -2,7 +2,7 @@ ML P587 -## Notes + **Definition:** Adam combines momentum with RMSProp to calculate gradients based on momentum and historical gradients. diff --git a/docs/AdjacencyMatrix.md b/docs/AdjacencyMatrix.md @@ -2,7 +2,7 @@ Ch 4 -## Notes + **Definition:** An adjacency matrix is a matrix where each column represents a node as do the rows. In each position there is either a true or false denoting whether or not there is an edge between the two nodes. diff --git a/docs/Affinity.md b/docs/Affinity.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Affinity is any measure of how well an instance fits into a given cluster. diff --git a/docs/Algorithm.md b/docs/Algorithm.md @@ -2,7 +2,7 @@ Computer Architecture L2 -## Notes + **Definition:** A step by step procedure to solve a problem where each step is definite (quantifiable), computable, and finite (ends eventually). diff --git a/docs/AmbientSpace.md b/docs/AmbientSpace.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** The ambient space is the space surrounding some object. diff --git a/docs/Amortization.md b/docs/Amortization.md @@ -2,6 +2,6 @@ L2 -## Notes + **Definition:** Amortization is the process of averaging out more complex actions across many events even if the smaller events are not actually doing anything related to the complex action. diff --git a/docs/AngleBetweenVectors.md b/docs/AngleBetweenVectors.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The angle between two vectors is the angle between the two vectors when their tails are positioned at the zero vector. diff --git a/docs/Animation.md b/docs/Animation.md @@ -2,7 +2,7 @@ CG W13 L3 -## Notes + **Definition:** Animation is the process of making still images appear as continuous movement. diff --git a/docs/AnimationController.md b/docs/AnimationController.md @@ -2,7 +2,7 @@ CG W13 L3 -## Notes + **Definition:** An animation controller is a finite state machine that can be represented as a graph where the verticies are states and the edges are transitions between states. Note that this is a directed graph. diff --git a/docs/AnomalyDetection.md b/docs/AnomalyDetection.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Anomaly detection is the task of detecting anomalous samples. diff --git a/docs/Antisymmetric.md b/docs/Antisymmetric.md @@ -2,6 +2,6 @@ Ch 9.1 -## Notes + **Definition:** An antisymmetric relation is one such that if xRy then yRx is false where x != y. diff --git a/docs/Arccos.md b/docs/Arccos.md @@ -2,6 +2,6 @@ SS -## Notes + **Definition:** Arccos is the inverse of cosine. diff --git a/docs/Arcsin.md b/docs/Arcsin.md @@ -2,6 +2,6 @@ SS -## Notes + **Definition:** Arcsin is the inverse of sine. diff --git a/docs/ArithmeticComputations.md b/docs/ArithmeticComputations.md @@ -2,6 +2,6 @@ Ch 5 -## Notes + **Definition:** Arithmetic computations, with respect to hashing, are computations that use arithmetic operators to go from some key (or portion of a key) to a hash value (or portion). diff --git a/docs/Armature.md b/docs/Armature.md @@ -1,7 +1,7 @@ # Armature -## Notes + **Definition:** An armature is a set of bones with parent child relationships. This set can be disjoint where not all bones can be traversed do by moving from parents to children or vice versa. diff --git a/docs/Ascii.md b/docs/Ascii.md @@ -2,6 +2,6 @@ W2 -## Notes + **Definition:** Ascii is another character encoding scheme that uses only 1 byte per character. diff --git a/docs/Asset.md b/docs/Asset.md @@ -2,7 +2,7 @@ CS 331 W12 L3 -## Notes + **Definition:** Assets are all resources in untiy. diff --git a/docs/Associative.md b/docs/Associative.md @@ -2,7 +2,7 @@ MML Ch 2.2 -## Notes + **Definition:** Associativity of an operation means that regardless of the location of parenthesis the resulting computation is still the same assuming the order of values is also the same. diff --git a/docs/AstronomicalUnit.md b/docs/AstronomicalUnit.md @@ -2,7 +2,7 @@ CM L1 -## Notes + **Definition:** An astronomical unit is a measure of distance defined as the mean distance between the earth and the sun. diff --git a/docs/AsymptoticNotation.md b/docs/AsymptoticNotation.md @@ -2,7 +2,7 @@ L1 MIT -## Notes + **Definition:** Asymptotic notation describes the running time of an algorithm. diff --git a/docs/Authentication.md b/docs/Authentication.md @@ -4,7 +4,7 @@ **Chapter:** 1.4 -## Notes + **Definition:** Authentication is a service to ensure communication is authentic. diff --git a/docs/Autoencoder.md b/docs/Autoencoder.md @@ -2,7 +2,7 @@ ML General -## Notes + **Definition:** An autoencoder is an unsupervised neural network that takes inputs, compresses them into a smaller representation while trying to maintain as much information as possible, and then reconstructs the compressed representation into a new full representation. diff --git a/docs/Availability.md b/docs/Availability.md @@ -4,6 +4,6 @@ **Chapter:** 1.1 -## Notes + **Definition:** Availability ensures systems work promptly and service is not denied to authorized users. diff --git a/docs/BCD.md b/docs/BCD.md @@ -1,7 +1,7 @@ CA L3 -## Notes + **Definition:** Binary coded decimal (BCD) is the process of encoding a decimal where each digit is a fixed number of bits. diff --git a/docs/Backpropagation.md b/docs/Backpropagation.md @@ -2,7 +2,7 @@ ML D6 -## Notes + **Definition:** Backpropagation is the combination of reverse-mode autodiff and gradient descent to iteratively improve models based on expected outputs by given inputs by following the gradient for each [[Weight.md]] and [[Bias.md]]. diff --git a/docs/Bagging.md b/docs/Bagging.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Bagging is the process of training the same model multiple times with a different subset of the data. Bagging is different than pasting as bagging does not take samples that are selected as part of the random sample for training out of the options to add to the random sample. This means one model (predictor) can be trained with multiple instances of the same sample. diff --git a/docs/Baking.md b/docs/Baking.md @@ -2,7 +2,7 @@ CS 331 W11 Lecture 2 -## Notes + **Definition:** The process of precomputing. Another term for this is statically computed (not dynamically computed ie realtime). diff --git a/docs/Bandits.md b/docs/Bandits.md @@ -2,7 +2,7 @@ L1 -## Notes + **Definition:** Bandits are a class of problems in RL where an agent repeatedly chooses from a set of actions which give a reward drawn from an unknown probability distribution. diff --git a/docs/Bandwidth.md b/docs/Bandwidth.md @@ -2,7 +2,7 @@ Stats D3 -## Notes + **Definition:** Bandwidth is a hyperparameter used in smoothing techniques that describes the width of kernels. diff --git a/docs/BarrierSynchronization.md b/docs/BarrierSynchronization.md @@ -1,7 +1,7 @@ Computer Architecture L2 -## Notes + **Definition:** This is a way to block all execution until all inputs are ready. This can be thought of as thread syncing and is closely related to [[DataFlow.md]] execution. diff --git a/docs/BasicVariables.md b/docs/BasicVariables.md @@ -2,6 +2,4 @@ Ch 2.2 -## Notes - **Definition:** Basic variables of a set of linear equations (or of a matrix) are variables that have a definite value which can be noted from the fact that they are the only 1 in the column when in RREF. diff --git a/docs/BasisOfSubspace.md b/docs/BasisOfSubspace.md @@ -2,6 +2,6 @@ Khan -## Notes + **Definition:** The basis of a subspace is list of vectors V := (v_1, v_2, ..., v_m) such that V spans the subspace and is linearly independent. diff --git a/docs/BatchNormalization.md b/docs/BatchNormalization.md @@ -2,7 +2,7 @@ ML P569 -## Notes + **Definition:** Batch normalization is the process of adding layers to a neural network that perform normalization upon inputs and output the normalized values. diff --git a/docs/BayesTheroem.md b/docs/BayesTheroem.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** Bayes theroem is $P(A|B) = \frac{P(B|A)P(A)}{P(B)}$ diff --git a/docs/BayesianInference.md b/docs/BayesianInference.md @@ -2,7 +2,7 @@ Stats D5 -## Notes + **Definition:** Bayesian inference is the principal that p(something) can often be described based on prior inferences that may make p(something) more or less likely thus factoring them into the probability. diff --git a/docs/BekensteinBound.md b/docs/BekensteinBound.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** The Bekenstein bound gives the most amount of energy that can be contained in a sphere prior to it becoming a blackhole. diff --git a/docs/BellmanEquation.md b/docs/BellmanEquation.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** The Bellman equation is an equation that states the value of the optimal choice right now is the value of the next choice + the value of the current choice. diff --git a/docs/BernoulliProcess.md b/docs/BernoulliProcess.md @@ -2,7 +2,7 @@ Prob L13 -## Notes + **Definition:** A Bernoulli process is a sequence of binary trials (random variables). diff --git a/docs/BernoulliRandomVariable.md b/docs/BernoulliRandomVariable.md @@ -2,7 +2,7 @@ Prob L8 -## Notes + **Definition:** A bernoulli random variable is a random variable that has a bernoulli distribution where the outcome is binary. diff --git a/docs/Bias.md b/docs/Bias.md @@ -2,7 +2,7 @@ ML D5 -## Notes + ### Stats diff --git a/docs/Biconditional.md b/docs/Biconditional.md @@ -2,7 +2,7 @@ 1.1.2 -## Notes + **Definition:** The biconditional is the [[Connectives.md]] that states the antecedent and consequent have the same truth values. diff --git a/docs/BigONotation.md b/docs/BigONotation.md @@ -2,7 +2,7 @@ Ch 2 -## Notes + **Definition:** Big O Notation is a system agnostic way to describe worst case runtime for an algorithm. With Big O Notation we formally state f(x) = O(g(x)) for some c and N such that f(n) <= c(g(x)) for all x >= N. diff --git a/docs/BigThetaNotation.md b/docs/BigThetaNotation.md @@ -2,6 +2,6 @@ CS 303 Ch 2 -## Notes + **Definition:** We use big theta notation to state that an algorithm has exactly the same asymptotic complexity as some other algorithm. This means big theta of f is equivalent to big theta of g where each of them will (almost always) have a unique value for c (constant multiplier) and a unique value for N (where N <=x). diff --git a/docs/Bijective.md b/docs/Bijective.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** For a function to be bijective it must be both [[Surjective.md]] and [[Injective.md]]. diff --git a/docs/BijectiveProof.md b/docs/BijectiveProof.md @@ -2,7 +2,7 @@ Ch 6.3 -## Notes + **Definition:** A bijective proof is a proof where we prove the compared sets can be represented as a bijective function and thus have the same cardinality. diff --git a/docs/BinaryCode.md b/docs/BinaryCode.md @@ -2,7 +2,7 @@ Ch 6 -## Notes + **Definition:** A binary code for S is a function c from S -> {0,1} * . diff --git a/docs/BinaryOperations.md b/docs/BinaryOperations.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** Binary operations are operations that take two inputs. diff --git a/docs/BinaryTree.md b/docs/BinaryTree.md @@ -2,7 +2,7 @@ CS202 L14 -## Notes + **Definition:** For any node n, all elements in the left subtree are less than the current node and everything in the right subtree is greater than the current node. diff --git a/docs/Binomial.md b/docs/Binomial.md @@ -2,7 +2,7 @@ Ch 1.3 -## Notes + **Definition:** A binomial is the combination of two values in the form of (x + y). diff --git a/docs/BinomialCoefficient.md b/docs/BinomialCoefficient.md @@ -2,7 +2,7 @@ L4 -## Notes + **Definition:** A binomial coefficient is represented by two numbers and has a singular evaluation. The evaluation describes the number of unique subsets of the length denoted by the bottom value that can be created given a set of the length denoted by the top value. diff --git a/docs/BinomialDistribution.md b/docs/BinomialDistribution.md @@ -2,7 +2,7 @@ Stats D1 -## Notes + **Definition:** A binomial distribution is a distribution such that each point is the probability of some true or false condition. diff --git a/docs/Bipartite.md b/docs/Bipartite.md @@ -2,7 +2,7 @@ Ch 4 -## Notes + **Definition:** A bipartite graph is a graph that can be divided into two sets where every edge connects a vertex in one set to the other set, but never the same set. diff --git a/docs/BitSteering.md b/docs/BitSteering.md @@ -2,7 +2,7 @@ CA L3 -## Notes + **Definition:** This is a bit in an instruction that determines how later bits are interpreted. diff --git a/docs/Blender.md b/docs/Blender.md @@ -2,7 +2,7 @@ CS331 W12 L3 -## Notes + The default file format is FBX (Filmbox) which can be imported into [[Unity.md]]. diff --git a/docs/BlenderShortcuts.md b/docs/BlenderShortcuts.md @@ -2,7 +2,7 @@ Shortcuts from lectures -## Notes + "Z" - Switch between solid and wireframe (useful to select everything from a mesh from all sides) diff --git a/docs/Boosting.md b/docs/Boosting.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Boosting is the process of combining several weak learners into one strong learner. diff --git a/docs/Boxplots.md b/docs/Boxplots.md @@ -2,7 +2,7 @@ Stats D4 -## Notes + **Definition:** A boxplot is a plot that shows the distribution of quartiles. diff --git a/docs/BreadthFirstSearch.md b/docs/BreadthFirstSearch.md @@ -2,7 +2,7 @@ CS 202 L14 -## Notes + **Definition:** Search algorithm that moves its way outward from the root node. This is different than [[DepthFirstSearch.md]] as it does not go all the way down and then search but instead moves away from the root. diff --git a/docs/Broadcasting.md b/docs/Broadcasting.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** Broadcasting is the process of iteratively applying a lower dimensional operation on higher dimensional structures. diff --git a/docs/BucketAddressing.md b/docs/BucketAddressing.md @@ -2,6 +2,6 @@ Ch 5 -## Notes + **Definition:** Bucket addressing is the process of using a finitely sized collection to store objects that collide. diff --git a/docs/BulkSynchronousProcessing.md b/docs/BulkSynchronousProcessing.md @@ -2,7 +2,7 @@ CA L2 -## Notes + **Definition:** Completing parallel processing and then using [[BarrierSynchronization.md]] to join together threads of execution. diff --git a/docs/CART.md b/docs/CART.md @@ -2,7 +2,7 @@ ML D4 -## Notes + **Definition:** The CART algorithm is used to train decision trees and works by splitting a training set into two parts using a single feature k where k is the feature that produces the purest subsets weighted by size. This is then repeated at each step (greedy) until reaching either a max depth, or until reaching some depth whereby it can not find a split that will reduce impurity. diff --git a/docs/CNN.md b/docs/CNN.md @@ -2,7 +2,7 @@ ML SS -## Notes + **Definition:** A convolutional neural network is a neural network that has convolutional layers that perform filtering functions upon the input data. diff --git a/docs/Cache.md b/docs/Cache.md @@ -1,5 +1,5 @@ # Cache -## Notes + diff --git a/docs/CaesarCipher.md b/docs/CaesarCipher.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** A Caesar Cipher is monoalphabetic substitution whereby we encode characters as numbers shift the numbers by a constant amount and then decode them. diff --git a/docs/CanaryValue.md b/docs/CanaryValue.md @@ -2,7 +2,7 @@ CS202 SelfStudy -## Notes + **Definition:** A canary value is used to detect buffer overflows by placing dummy data to be validated at some future time to ensure buffer overflows do not occur. diff --git a/docs/CartesianProduct.md b/docs/CartesianProduct.md @@ -2,7 +2,7 @@ Throughout textbook -## Notes + **Definition:** The Cartesian Product of two sets is the set of all ordered pairs a,b where a is contianed in A and b is contained in B. diff --git a/docs/Cases.md b/docs/Cases.md @@ -2,6 +2,6 @@ U 1.8.1 -## Notes + **Definition:** Proof by cases is a form of proof whereby we show every specific type of case is true. diff --git a/docs/CategoricalCrossEntropy.md b/docs/CategoricalCrossEntropy.md @@ -2,7 +2,7 @@ ML D6 -## Notes + **Definition:** Categorical cross entropy is a loss calculation used for classification algorithms. diff --git a/docs/Ceiling.md b/docs/Ceiling.md @@ -2,7 +2,7 @@ U2.3.4 -## Notes + **Definition:** The ceiling function specifies to round up the input to the nearest integer. diff --git a/docs/CentralLimitTheroem.md b/docs/CentralLimitTheroem.md @@ -2,6 +2,6 @@ L20 -## Notes + **Definition:** The CLT states that as the number of trials increases distributions tend towards a normal distribution. diff --git a/docs/ChainRule.md b/docs/ChainRule.md @@ -2,6 +2,6 @@ Leonard -## Notes + **Definition:** The chain rule is a derivation rule used when we have a function within another function. The rule states $\frac{d}{dx} (g(f(x))) = g'(f(x)) \cdot f'(x)$. diff --git a/docs/Chaining.md b/docs/Chaining.md @@ -2,6 +2,6 @@ Ch 5 -## Notes + **Definition:** Chaining is the process of using a linked list to resolve collisions that result from duplicate hashcodes. diff --git a/docs/ChangeOfBasis.md b/docs/ChangeOfBasis.md @@ -2,7 +2,7 @@ Khan U3 -## Notes + **Definition:** Change of basis in linear algebra is the process of assuming the basis vectors to be some arbitrary linearly independent vectors. diff --git a/docs/CharacteristicEquation.md b/docs/CharacteristicEquation.md @@ -2,7 +2,7 @@ Ch 8.2 -## Notes + **Definition:** A characteristic equation is an equation for a linear homogeneous recurrence relation that uses a_n = r^n to substitute into the equation. diff --git a/docs/CharacteristicRoots.md b/docs/CharacteristicRoots.md @@ -2,6 +2,6 @@ Ch 8.2 -## Notes + **Definition:** A characteristic root in discrete math are values that satisfy a [Characteristic Equation](CharacteristicEquation.md). diff --git a/docs/ChineseRemainderTheorem.md b/docs/ChineseRemainderTheorem.md @@ -4,6 +4,6 @@ **Chapter:** 2.7 -## Notes + **Definition:** The Chinese Remainder Theorem states... diff --git a/docs/CircuitTechnology.md b/docs/CircuitTechnology.md @@ -2,6 +2,6 @@ Discussion of materials, gates, and things of that sort. -## Notes + diff --git a/docs/CircularDoublyLinkedList.md b/docs/CircularDoublyLinkedList.md @@ -1,7 +1,7 @@ CS202 L14 -## Notes + **Definition:** This is a doubly linked list where the last pointer points to the first and the first pointer of the first element points to the last. diff --git a/docs/CircularLinkedList.md b/docs/CircularLinkedList.md @@ -1,7 +1,7 @@ CS202 L14 -## Notes + **Definition:** This is a singly linked list where the last node points back to the first node. diff --git a/docs/Clip.md b/docs/Clip.md @@ -2,7 +2,7 @@ CG W13 L3 -## Notes + **Definition:** Prerecorded set of frames representing an object in motion. diff --git a/docs/Closure.md b/docs/Closure.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** Closure means that performing some arbitrary operation (pick one, but not necessarily all) on any member of a set will result in another element of a set. diff --git a/docs/ClusteringAlgorithms.md b/docs/ClusteringAlgorithms.md @@ -2,7 +2,7 @@ ML L1 -## Notes + **Definition:** An algorithm that groups data together with other like items. diff --git a/docs/Codeword.md b/docs/Codeword.md @@ -2,7 +2,7 @@ Ch 6 -## Notes + **Definition:** A codeword is an element c(x) where c is a binary code and x is a message. diff --git a/docs/Codomain.md b/docs/Codomain.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The codomain of a function is a set that contains all possible mappings from the domain of inputs to outputs. This set can also contain values that are not mapped to from the domain by the function. diff --git a/docs/Collection.md b/docs/Collection.md @@ -2,6 +2,6 @@ Ch 0 -## Notes + **Definition:** Collection datatypes are datatypes that can, theoretically, store an arbitrarily large number of elements. diff --git a/docs/Collision.md b/docs/Collision.md @@ -2,6 +2,6 @@ Ch 5 -## Notes + **Definition:** A collision, with respect to hash tables, is when we try to place an element into a position in the array that is already taken. diff --git a/docs/ColumnSpace.md b/docs/ColumnSpace.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The column space of a matrix the space that contains all combinations of the columns. diff --git a/docs/Combination.md b/docs/Combination.md @@ -2,7 +2,7 @@ TB 6.3 -## Notes + **Definition:** A combination is a unique selection of elements from a given set. diff --git a/docs/CombinatorialProof.md b/docs/CombinatorialProof.md @@ -2,7 +2,7 @@ Ch 6.3 -## Notes + **Definition:** A combinatorial proof is a proof that shows we are counting the same set and thus they are equivalent. diff --git a/docs/Combinatorics.md b/docs/Combinatorics.md @@ -2,7 +2,7 @@ Ch 6.1 -## Notes + **Definition:** Combinatorics is the study of counting. diff --git a/docs/Commutative.md b/docs/Commutative.md @@ -2,7 +2,7 @@ 1.3.2 -## Notes + **Definition:** The commutative property states the order by which the objects are placed does not effect the outcome of said operation. diff --git a/docs/Complement.md b/docs/Complement.md @@ -2,7 +2,7 @@ L1 -## Notes + **Definition:** The complement of a set is the set of all elements not in the original set, but in the consideration space (often sample space). diff --git a/docs/ComplexVectorSpace.md b/docs/ComplexVectorSpace.md @@ -2,6 +2,6 @@ Ch 1 -## Notes + **Definition:** A complex vector space is a vector space on the complex numbers (C). diff --git a/docs/CompositeNumber.md b/docs/CompositeNumber.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** A composite number is a number that is not prime and thus is composed of two or more prime numbers. diff --git a/docs/ComputationalGraph.md b/docs/ComputationalGraph.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** A computational graph in machine learning is a graph that shows every computation required to go from input to output. diff --git a/docs/ConditionalDisjunction.md b/docs/ConditionalDisjunction.md @@ -2,6 +2,6 @@ 1.3.2 -## Notes + **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,7 +2,7 @@ Stats D2 - Prob L2 -## Notes + **Definition:** Conditional probabilities are probabilities of some outcome given some assumed condition. diff --git a/docs/ConditionalProbability.md b/docs/ConditionalProbability.md @@ -2,7 +2,7 @@ Ch 1.4 -## Notes + **Definition:** Conditional probability is the probability of a given event assuming another event has already occurred. diff --git a/docs/ConditionalProbabilityTheroem.md b/docs/ConditionalProbabilityTheroem.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** Conditional probability theroem is $P(A|B) = \frac{P(A \cap B)}{P(B)}$. diff --git a/docs/Confidentiality.md b/docs/Confidentiality.md @@ -4,7 +4,7 @@ **Chapter:** 1.1 -## Notes + **Definition:** Confidentiality ensures confidential information is not available to unauthorized individuals and that individuals have control over what information about them may be collected, stored, and disclosed to whom. diff --git a/docs/ConfusionMatrix.md b/docs/ConfusionMatrix.md @@ -2,6 +2,6 @@ ML CH3 -## Notes + **Definition:** A confusion matrix is a matrix that describes the number of confused sample predictions a model has broken down by both the actual and predicted values. diff --git a/docs/Congruence.md b/docs/Congruence.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** Congruence describes the relationship between two numbers such that $a \equiv b (mod c)$. diff --git a/docs/CongruenceClass.md b/docs/CongruenceClass.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** A congruence class is the set of all integers such that $a \equiv b (modc)$ for all integers a. diff --git a/docs/Connected.md b/docs/Connected.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** Connected, in graph theory, means that there is a way to get from any node to any other node in the graph. diff --git a/docs/ConnectedComponent.md b/docs/ConnectedComponent.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A connected component is a subgraph in which each component of the subgraph is conected. diff --git a/docs/Connectives.md b/docs/Connectives.md @@ -2,7 +2,7 @@ 1.1.1 -## Notes + **Definition:** Connectives are necessary for the creation of compound propositions and they are the following: diff --git a/docs/Contingency.md b/docs/Contingency.md @@ -2,7 +2,7 @@ 1.3.1 -## Notes + **Definition:** A contingency is a proposition that is neither always true nor always false. diff --git a/docs/ContinuousProbability.md b/docs/ContinuousProbability.md @@ -2,7 +2,7 @@ Stats Ch1 -## Notes + **Definition:** A continuous probability is one where there are an uncountable number of outcomes. diff --git a/docs/Contradiction.md b/docs/Contradiction.md @@ -2,7 +2,7 @@ Throughout textbook -## Notes + **Definition:** Contradiction is used to prove if then statements. This is done by assuming the then is true and the if is not true which would imply the statement is false. From here, you then show this causes a contradiction thus if the if is true then the then is true. diff --git a/docs/Contrapositive.md b/docs/Contrapositive.md @@ -2,7 +2,7 @@ Throughout TB - U1.7.2 Discrete TB -## Notes + **Definition:** To prove an if then statement with contrapositive we assume the then statement is false. Following from here we then prove the if part must also be true for the then to be false. So it follows that if the first is true then the second is also true because the second is never true when the first is false. diff --git a/docs/Converse.md b/docs/Converse.md @@ -2,7 +2,7 @@ 1.1.2 -## Notes + **Definition:** The converse of a statement is to switch both sides of an implication statement. diff --git a/docs/Coordinate.md b/docs/Coordinate.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** A coordinate is a singular component of a vector or list. diff --git a/docs/Correlation.md b/docs/Correlation.md @@ -2,7 +2,7 @@ Stats D2 -## Notes + **Definition:** Correlation is the strength and direction relationship between two variables. This value is bounded between -1 and 1 where 0 is no correlation, 1 is pure positive linear relationship, and -1 is a pure negative linear relationship. diff --git a/docs/CorrelationCoefficient.md b/docs/CorrelationCoefficient.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** The correlation coefficient is a floating point number that represents the strength of a linear relationship between two variables x and y. diff --git a/docs/CountSort.md b/docs/CountSort.md @@ -2,6 +2,6 @@ L5 -## Notes + **Definition:** Count sort is a non-comparative sorting algorithm where we count the total number of instances of a given value and then reassemble a sorted output by creating a datastructure that contains the number of each value specified by the count. diff --git a/docs/CounterExample.md b/docs/CounterExample.md @@ -2,6 +2,6 @@ Abstract Math Proof Technique -## Notes + **Definition:** Counter example proofs are similar to [[DirectProof.md]], but instead of assuming that they are true you assume they are false. From this assumption you then need to show that this is in some way fallacious. diff --git a/docs/CountingPrinciple.md b/docs/CountingPrinciple.md @@ -2,6 +2,6 @@ Ch 0 -## Notes + **Definition:** The counting principle is an enumeration technique where you determine the branching factor at each step and multiply all branching factors to find the total number of possible paths. diff --git a/docs/Covariance.md b/docs/Covariance.md @@ -2,7 +2,7 @@ Stats D2 -## Notes + **Definition:** Covariance is the strength of a linear relationship between two different variables. When this number is larger it indicates that higher numbers for one of the variables is associated with higher numbers for the other. The inverse is also true (negative results in negative cov) diff --git a/docs/CramersRule.md b/docs/CramersRule.md @@ -2,7 +2,7 @@ 3B1B -## Notes + **Definition:** Cramer's rule is an alternative to [[GaussianElimination.md]] for solving systems of equations. diff --git a/docs/CreditAssignmentProblem.md b/docs/CreditAssignmentProblem.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** The credit assigment problem is an RL problem where we need to determine how to rate choices in the near term given their long term consequences. diff --git a/docs/CrossProduct.md b/docs/CrossProduct.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The cross product of two vectors is the vector orthogonal to them. diff --git a/docs/CrossValidation.md b/docs/CrossValidation.md @@ -2,7 +2,7 @@ ML CH3 -## Notes + **Definition:** Cross validation is the process of creating a subset of your data and then training the model on some subset of said data. diff --git a/docs/Crosstabulation.md b/docs/Crosstabulation.md @@ -2,7 +2,7 @@ Stats D4 -## Notes + **Definition:** Crosstabulation in stats is a way to display three dimensional information. Across the top and side you have some classes and then in the table itself we have the information of the cross-sectional group. diff --git a/docs/Cryptography.md b/docs/Cryptography.md @@ -4,7 +4,7 @@ **Chapter:** 1.6 -## Notes + **Definition:** Cryptography is the transformation of data from one form to another. diff --git a/docs/CumulativeDensityFunction.md b/docs/CumulativeDensityFunction.md @@ -2,7 +2,7 @@ Prob L8 -## Notes + **Definition:** A cumulative density function is a function of a random variable where any given value is the probability of getting an output less than or equal to the current value. diff --git a/docs/CumulativeRelativeFrequency.md b/docs/CumulativeRelativeFrequency.md @@ -2,6 +2,6 @@ Khan -## Notes + **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/Cybersecurity.md b/docs/Cybersecurity.md @@ -4,7 +4,7 @@ **Chapter:** 1.1 -## Notes + **Definition:** Protection of information stored, transmitted, and processed on computing devices. diff --git a/docs/Cycle.md b/docs/Cycle.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A cycle is a path with (when removing the last node) that starts and ends at the same node where the sequence is at least 3 long. diff --git a/docs/DBSCAN.md b/docs/DBSCAN.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** DBSCAN is a clustering algorithm that groups clusters by continuous regions of high density. diff --git a/docs/DRAM.md b/docs/DRAM.md @@ -2,7 +2,7 @@ DRAM is what we think of as RAM. See [[Memory.md]] for other links. -## Notes + [[DRAMBanks.md]] are a 2d matrix of [[DRAMCell.md]] and it is accessed by rows. When the processor wants a row, it activates the row, sends it to the [[RowBuffer.md]], and then sends the data out. Subsequent accesses of a different column are very fast because the row is already in a buffer. This can be thought of cached rows. diff --git a/docs/DRAMBanks.md b/docs/DRAMBanks.md @@ -1,5 +1,5 @@ # DRAM Banks -## Notes + **Definition:** 2d bank of [[DRAMCell.md]] that is accessed by a row at a time rows may be around 8kb in size. diff --git a/docs/DRAMCell.md b/docs/DRAMCell.md @@ -1,6 +1,6 @@ # DRAM Cell -## Notes + A DRAM Cell is the cell used to store one bit of information. It is made of a capacitor and an access transistor. The data is stored in the charge of the capacitor. diff --git a/docs/DRAMChips.md b/docs/DRAMChips.md @@ -1,5 +1,5 @@ # DRAM Chips -## Notes + DRAM Chips are the chips that contain the [[DRAMBanks.md]] along with associated circuitry. There are many chips (I think normally 8) that make up a RAM module. diff --git a/docs/DRAMRefresh.md b/docs/DRAMRefresh.md @@ -1,6 +1,6 @@ # DRAM Refresh -## Notes + This is the process of refreshing the energy stored in a [[DRAMCell.md]]'s capacitor so that losses in energy over time do not cause loss of data (bitrot). diff --git a/docs/DRAMRowHammer.md b/docs/DRAMRowHammer.md @@ -1,6 +1,6 @@ Computer Architecture L1 -## Notes + See [[DisturbanceErrors.md]] for more information as it describes this vulnerability. diff --git a/docs/DataAugmentation.md b/docs/DataAugmentation.md @@ -2,7 +2,7 @@ ML P773 -## Notes + **Definition:** Data augmentation is the process of changing training data in such a way to make the training data set larger and more robust. diff --git a/docs/DataFlow.md b/docs/DataFlow.md @@ -1,7 +1,7 @@ Computer Architecture L2 -## Notes + **Definition:** This is a theory of computation that stipulates execution of code should be on a dependence basis instead of in order. If one instruction is dependent upon another that has not been executed it should not be executed, but if all dependencies have been executed then the code can be executed, if chosen to. diff --git a/docs/DataStructureAugmentation.md b/docs/DataStructureAugmentation.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** Data structure augmentation is adding something to a data structure to improve it in some way. diff --git a/docs/DecisionThreshold.md b/docs/DecisionThreshold.md @@ -2,7 +2,7 @@ ML CH3 -## Notes + **Definition:** In classical classification, a decision threshold is the position on some line where greater values are classified in some way and lesser value another way. diff --git a/docs/DecisionTrees.md b/docs/DecisionTrees.md @@ -2,7 +2,7 @@ ML D4 -## Notes + **Definition:** Decision trees are a machine learning algorithm that does true/false comparison to go left and right until reaching a leaf node. This leaf node will then describe the output. diff --git a/docs/Degree.md b/docs/Degree.md @@ -2,6 +2,6 @@ CG W13 L2 -## Notes + **Definition:** Degree is a term used to describe the number of edges meeting a [[Vertex.md]]. diff --git a/docs/DemorgansLaw.md b/docs/DemorgansLaw.md @@ -2,7 +2,7 @@ 1.3.2 -## Notes + **Definition:** These are two fundamental laws of boolean algebra that can be simply derived. diff --git a/docs/DensityEstimation.md b/docs/DensityEstimation.md @@ -2,7 +2,7 @@ Stats D3 -## Notes + **Definition:** Density estimation is the process of modeling the probability of given values for a dataset. diff --git a/docs/DepthFirstSearch.md b/docs/DepthFirstSearch.md @@ -2,7 +2,7 @@ CS202 L14 -## Notes + **Definition:** Searching algorithm that traverses until reaching a leaf node then going back by one and doing the same on the other subtree. diff --git a/docs/DerivedDistribution.md b/docs/DerivedDistribution.md @@ -2,7 +2,7 @@ L10 -## Notes + **Definition:** Derived distributions are distributions where we take a function of a random variable. diff --git a/docs/DesignPoint.md b/docs/DesignPoint.md @@ -2,7 +2,7 @@ CA L3 -## Notes + **Definition:** The point of a computer's design including constraints of the system. diff --git a/docs/Determinant.md b/docs/Determinant.md @@ -2,7 +2,7 @@ CS331 - Linear Algebra - Khan U2 -## Notes + **Definition:** The determinant is the scaling factor of some area (or volume in 3d space) from before to after a linear transformation. Note that this is only useful in 3d and 2d as the notion of volume in higher dimensions ([[Hypervolume.md]]) is a bit abstract. diff --git a/docs/DeterministicFiniteAutomata.md b/docs/DeterministicFiniteAutomata.md @@ -4,7 +4,7 @@ **Lecture:** 2 -## Notes + **Definition:** A deterministic finite automaton is a 5-tuple (Q, Sigma, delta, q_0, F) where each coordinate represents the following: diff --git a/docs/DiagonalMatrices.md b/docs/DiagonalMatrices.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** Diagonal matricies are matricies that have zeroes in all positions except for the diagonal from 1,1 to m,n. diff --git a/docs/DigitalSignature.md b/docs/DigitalSignature.md @@ -4,6 +4,6 @@ **Chapter:** 1.6 -## Notes + **Definition:** A digital signature is a value computed with an algorithm and data that outputs a deterministic signature to verify the origin and integrity of the data. diff --git a/docs/Digraph.md b/docs/Digraph.md @@ -2,7 +2,7 @@ Ch 4 -## Notes + **Definition:** A digraph is a directed graph meaning each edge has only one direction in which traversal is possible. diff --git a/docs/DimensionalityReduction.md b/docs/DimensionalityReduction.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** This is where you have the goal of reducing the required data without losing too much information. This is like lossy compression. diff --git a/docs/Dimensions.md b/docs/Dimensions.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** The dimension of a vector space is defined as the length of any basis of the vector space. diff --git a/docs/DirectProof.md b/docs/DirectProof.md @@ -2,6 +2,6 @@ Abstract Math + Discrete Math U1.7.1 -## Notes + **Definition:** Direct proof is the assumption that the initial statement is true. You then show that it being true is true for all cases. These statements start with, "Let's assume x is true" we then continue on to prove what it is that x implies. diff --git a/docs/DirectSum.md b/docs/DirectSum.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** A direct sum is a sum of two vector spaces that are disjoint except for the zero vector. diff --git a/docs/DiscountFactor.md b/docs/DiscountFactor.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** The discount factor in RL is the value gamma we use to describe how much or little we care about long term rewards with respect to the value function. diff --git a/docs/DiscreteProbability.md b/docs/DiscreteProbability.md @@ -2,6 +2,6 @@ Stats ch1 -## Notes + **Definition:** A discrete probability is one where there are a finite set of outcomes or a countably infinite set of outcomes. diff --git a/docs/DiscreteRandomVariable.md b/docs/DiscreteRandomVariable.md @@ -2,6 +2,6 @@ Ch 2.1 -## Notes + **Definition:** A discrete random variable is a random variable with an outcome space of finite or countably infinite size. diff --git a/docs/DiscreteUniformLaw.md b/docs/DiscreteUniformLaw.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** The discrete uniform law states that if all outcomes in a [[SampleSpace.md]] are equally probable then P(A) where A is a set is the same as |A| / |Omega| where Omega is the entire sample space. diff --git a/docs/DisjointSet.md b/docs/DisjointSet.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** Disjoint sets are multiple sets where they have no elements in common. diff --git a/docs/DistanceCalculation.md b/docs/DistanceCalculation.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** Distance calculation in any dimension is defined as sqrt((x_1 - y_1)^2 + (x_2 - y_2)^2 ...) diff --git a/docs/DistanceToPlane.md b/docs/DistanceToPlane.md @@ -2,7 +2,7 @@ Distance from arbitrary point to plane -## Notes + If we take any point on the plane and then find the length of the opposite side of the new right triangle we then have the distance from the plane to the point. diff --git a/docs/Distinguishable.md b/docs/Distinguishable.md @@ -2,6 +2,6 @@ Ch 6.5 -## Notes + **Definition:** Distinguishable means items are different in some way such that switching them results in a new permutation. diff --git a/docs/DistinguishablePermutation.md b/docs/DistinguishablePermutation.md @@ -2,6 +2,6 @@ Ch 1.3 -## Notes + **Definition:** A distinguishable permutation is a permutation that can be distinguished from all other permutations. diff --git a/docs/DistributedRepresentation.md b/docs/DistributedRepresentation.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** Distributed learning is the idea of using multiple neurons to learn one thing. diff --git a/docs/Distributive.md b/docs/Distributive.md @@ -2,6 +2,6 @@ Ch 2.2 -## Notes + **Definition:** Distributivity is a property of operators such that a(b+c) = ab + ac. diff --git a/docs/DistributiveLaw.md b/docs/DistributiveLaw.md @@ -2,7 +2,7 @@ 1.3.2 -## Notes + **Definition:** The distributive law of disjunction states $p \vee (q \wedge r) \equiv (p\vee q) \wedge (p \vee r)$. diff --git a/docs/DisturbanceErrors.md b/docs/DisturbanceErrors.md @@ -1,6 +1,6 @@ # Disturbance Errors -## Notes + Also referred to as [[DRAMRowHammer.md]] diff --git a/docs/Div.md b/docs/Div.md @@ -2,7 +2,7 @@ U 2.4 -## Notes + **Definition:** Div is a mathmatical function whereby we find the largest integer such that the second number times divisor is less than or equal to the first number. diff --git a/docs/DivideAndConquer.md b/docs/DivideAndConquer.md @@ -2,7 +2,7 @@ CLRS 2.3.1 -## Notes + **Definition:** Divide and conquer algorithms are algorithms that break a problem down into smaller sub-problems and then solve each subproblem. diff --git a/docs/DivisionAlgorithm.md b/docs/DivisionAlgorithm.md @@ -4,7 +4,7 @@ **Chapter:** 2.1 -## Notes + **Definition:** The division algorithm is the theorem that given a = qn + r, 0 <= r < n; q = floor(a/n). diff --git a/docs/DivisionRule.md b/docs/DivisionRule.md @@ -2,7 +2,7 @@ Ch 6.1 -## Notes + **Definition:** The division rule is a rule that describes the total size of the outcome space of some function. diff --git a/docs/DivisionRules.md b/docs/DivisionRules.md @@ -4,7 +4,7 @@ **Chapter:** 2.1 -## Notes + IMPORTANT RULES THAT MIGHT NOT BE OBVIOUS RIGHT AWAY: diff --git a/docs/DotProduct.md b/docs/DotProduct.md @@ -2,7 +2,7 @@ CS331 + Khan -## Notes + **Definition:** The dot product of two vectors is the sum of their corresponding components. diff --git a/docs/DoublyLinkedList.md b/docs/DoublyLinkedList.md @@ -2,7 +2,7 @@ CS 221 W 11 Lecture 13. -## Notes + **Definition:** This is a linked list that has a pointer to the tail and head that are accessible, and every element in the list has a pointer to the previous and next nodes. diff --git a/docs/Dropout.md b/docs/Dropout.md @@ -2,7 +2,7 @@ ML P604 -## Notes + **Definition:** Dropout is a regularization technique for deep neural networks where upon each pass every neuron has a constant probability of being 'dropped out' meaning the output is 0. diff --git a/docs/Duality.md b/docs/Duality.md @@ -2,7 +2,7 @@ 3B1B -## Notes + **Definition:** Duality is a natural but surprising correspondence between two types of things. diff --git a/docs/DynamicProgramming.md b/docs/DynamicProgramming.md @@ -2,7 +2,7 @@ L3 -## Notes + **Definition:** Dynamic programming is the idea that we can break down a problem into subproblems, solve those subproblems, and then use the results to find the problem's overall solution. diff --git a/docs/EarlyStopping.md b/docs/EarlyStopping.md @@ -2,7 +2,7 @@ ML D3 -## Notes + **Definition:** Early stopping is the process of stopping a model early in training (assuming it uses GD or something akin to that) as a form of regularization. diff --git a/docs/EigenVector.md b/docs/EigenVector.md @@ -2,7 +2,7 @@ Self Study -## Notes + **Definition:** An Eigen Vector is a non-zero vector that when a linear transformation is performed upon it, the resulting vector is only moved by a scalar multiple (remains on the same line). diff --git a/docs/ElasticNetRegression.md b/docs/ElasticNetRegression.md @@ -2,7 +2,7 @@ ML D3 -## Notes + **Definition:** Elastic net regression is another form of linear regression that adds a regularization term to the loss function which is a middle ground between ridge and lasso regression. diff --git a/docs/ElementaryTransformations.md b/docs/ElementaryTransformations.md @@ -2,7 +2,7 @@ Ch 2.2 -## Notes + **Definition:** Elementary transformations are transformations done to matricies that do not change the validity of the system of equations. diff --git a/docs/EligibilityTraces.md b/docs/EligibilityTraces.md @@ -2,7 +2,7 @@ L4 -## Notes + **Definition:** Eligibility traces combine both the frequency and recency heuristics to solve the credit assignment problem. diff --git a/docs/Embedding.md b/docs/Embedding.md @@ -2,7 +2,7 @@ ML P722 -## Notes + **Definition:** Embeddings are a high dimensional dense representation of data. diff --git a/docs/EmptyGraph.md b/docs/EmptyGraph.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** The empty graph is a graph that does not have any nodes and subsequently does not have any edges. diff --git a/docs/Ensembles.md b/docs/Ensembles.md @@ -2,6 +2,6 @@ CH2 -## Notes + **Definition:** Ensembles are models composed of multiple models. These models can be the same like with random forests or different models put together. diff --git a/docs/Entropy.md b/docs/Entropy.md @@ -2,7 +2,7 @@ Ch 6 -## Notes + **Definition:** Entropy is the average number of bits communicated by one message if message hoarding is allowed. diff --git a/docs/Episode.md b/docs/Episode.md @@ -2,6 +2,6 @@ L4 -## Notes + **Definition:** In episode in RL is a given evaluation of a policy from start to finish. diff --git a/docs/Episodic.md b/docs/Episodic.md @@ -2,6 +2,6 @@ L4 -## Notes + **Definition:** Episodic, with resepect to RL, means that there are episodes as opposed to non-episodic which means something continues on forever. diff --git a/docs/EquationOfAPlane.md b/docs/EquationOfAPlane.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The equation of a plane is the equation that defines all points on the plane as a combination of n variables where n is the number of dimensions we are in. This is the definition of plane when in 3d space and a hyperplane in higher dimensions. diff --git a/docs/EquivalenceClass.md b/docs/EquivalenceClass.md @@ -2,7 +2,7 @@ AM W14 Video -## Notes + **Definition:** An equivalence class is a subset of a set relation that describes a given output and all elements of the sort denoted by [X]. diff --git a/docs/EquivalenceRelation.md b/docs/EquivalenceRelation.md @@ -2,6 +2,6 @@ Ch 9.5 -## Notes + **Definition:** An equivalence relation is a relation that is reflexive (xRx), symmetric (xRy -> yRx), and transitive (xRy and yRz -> xRz). diff --git a/docs/EuclideanAlgorithm.md b/docs/EuclideanAlgorithm.md @@ -2,7 +2,7 @@ Ch 2.4 -## Notes + **Definition:** The Euclidean algorithm is an algorithm used to determine the greatest common factor of two positive integers. diff --git a/docs/EulersTheorem.md b/docs/EulersTheorem.md @@ -4,7 +4,7 @@ **Chapter:** 2.5 -## Notes + **Definition:** Euler's theorem states that for every $a$ and $n$ that are relatively prime $a^{\phi(n)} \equiv 1 \text{(mod )} n \text{)}$. diff --git a/docs/EulersTotientFunction.md b/docs/EulersTotientFunction.md @@ -4,7 +4,7 @@ **Chapter:** 2.5 -## Notes + **Definition:** Euler's totient function, denoted as $\phi$, is the number of positive integers less than $n$ and relatively prime to $n$. diff --git a/docs/Evaluation.md b/docs/Evaluation.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** Evaluation in RL is the process of seeing how good a policy is. diff --git a/docs/Event.md b/docs/Event.md @@ -2,7 +2,7 @@ CH 1.2 -## Notes + **Definition:** An event is a subset of the sample space. diff --git a/docs/EvolutionaryMethods.md b/docs/EvolutionaryMethods.md @@ -2,6 +2,6 @@ RL Ch 1 -## Notes + **Definition:** Evolutionary methods are a class of RL strategies where learning is not done by interacting with the environment but rather by updating policies using a strategy akin to evolution where the best models continue on. diff --git a/docs/ExhaustiveProof.md b/docs/ExhaustiveProof.md @@ -2,7 +2,7 @@ U 1.8.2 -## Notes + **Definition:** An exhaustive proof is similar to proof by cases except we evaluate it for all specific examples which needs to be a relatively small number. diff --git a/docs/Expectation.md b/docs/Expectation.md @@ -2,7 +2,7 @@ L6 -## Notes + **Definition:** The expected value of a PMF is the weighted average of output. diff --git a/docs/ExplodingGradients.md b/docs/ExplodingGradients.md @@ -2,7 +2,7 @@ ML 550 -## Notes + **Definition:** Exploding gradients is a problem with training neural networks where lower levels have very high gradients and thus the gradient steps diverge from a proper solution. diff --git a/docs/Exploit.md b/docs/Exploit.md @@ -2,7 +2,7 @@ RL Ch 1 -## Notes + **Definition:** To exploit in RL means to take the known best move in the current state. diff --git a/docs/ExploratoryDataAnalysis.md b/docs/ExploratoryDataAnalysis.md @@ -2,6 +2,6 @@ Stats D3 -## Notes + **Definition:** Exploratory data analysis is the process of exploring a dataset to find patterns and to create models/statistics/visualizations. diff --git a/docs/Explore.md b/docs/Explore.md @@ -2,6 +2,6 @@ RL Ch 1 -## Notes + **Definition:** To explore in RL means to select an option that is either unknown or suboptimal and then continuing the evaluate that path with the hope it may lead to a better outcome than the known best option. diff --git a/docs/ExponentialDistribution.md b/docs/ExponentialDistribution.md @@ -2,7 +2,7 @@ Stats D1 -## Notes + **Definition:** An exponential distribution is one that is decreasing at a decreasing pace. Specifically, it can be stated in some form of lambda^-x where there may be constants or other things involved, but we find that as x increases, y decreases at a decreasing rate. diff --git a/docs/ExtraTrees.md b/docs/ExtraTrees.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Extra trees are decisions trees that incorporate extra randomness by randomizing splitting thresholds instead of using gini impurity of information gain to determine splitting thresholds. diff --git a/docs/FactorsOfVariation.md b/docs/FactorsOfVariation.md @@ -4,6 +4,6 @@ **Chapter:** 1 -## Notes + **Definition:** Factors of variation are features of the input that can be used to delineate between different labels or regression values. diff --git a/docs/Feature.md b/docs/Feature.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** A feature is a ml term used to describe either an individual feature of a sample or a given feature of all samples. diff --git a/docs/FeatureScaling.md b/docs/FeatureScaling.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** Feature scaling is the process of changing input features to be scaled in a similar way. diff --git a/docs/FermatsTheorem.md b/docs/FermatsTheorem.md @@ -4,7 +4,7 @@ **Chapter:** 2.5 -## Notes + **Definition:** Fermat's theorem states if p is prime and a is a positive integer not divisible by p then $a^{p-1} \equiv 1 \text{(mod } p \text{)}$. diff --git a/docs/FibonacciNumbers.md b/docs/FibonacciNumbers.md @@ -2,7 +2,7 @@ Abstract Math 10.5. -## Notes + **Definition:** The set of numbers in the form $F_n = F_{n-1} + F_{n-2}$ starting from 1 as the first value. diff --git a/docs/FiniteDimensional.md b/docs/FiniteDimensional.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** A vector space is finite dimensional if it contains a list of vectors that span the space. diff --git a/docs/FiniteField.md b/docs/FiniteField.md @@ -2,6 +2,6 @@ Ch 5 -## Notes + **Definition:** A finite field in abstract algebra is a set where addition, subtraction, multiplication, and division are defined and behave in a way similar to real numbers (field) that also contains a finite number of elements. diff --git a/docs/FisherYatesShuffle.md b/docs/FisherYatesShuffle.md @@ -1,6 +1,6 @@ # Fisher Yates Shuffle -## Notes + **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. diff --git a/docs/FlashCrash.md b/docs/FlashCrash.md @@ -2,6 +2,6 @@ Superintelligence - Bostrom -## Notes + **Definition:** The flash crash occurred in 2010 where two oppositional algorithmic traders began trading back and forth very quickly because their utility function specified they do so, but logically they should not have. diff --git a/docs/Floor.md b/docs/Floor.md @@ -2,7 +2,7 @@ U2.3.4 -## Notes + **Definition:** The floor function specifies to round down the input to the nearest integer. diff --git a/docs/Folding.md b/docs/Folding.md @@ -2,6 +2,6 @@ Ch 5 -## Notes + **Definition:** Folding is a process used in a hashing function where we split the key into discrete parts and then operate upon each of them seperately. diff --git a/docs/ForwardThoughts.md b/docs/ForwardThoughts.md @@ -2,7 +2,7 @@ Things that could be possible and necessary for future development -## Notes + There will need to be architecture capable of allowing higher levels of computation. We need to consider future scaling. diff --git a/docs/FreeVariables.md b/docs/FreeVariables.md @@ -2,7 +2,7 @@ Ch 2.2 -## Notes + **Definition:** Free variables are variables in RREF that are not alone in their column. diff --git a/docs/Frequency.md b/docs/Frequency.md @@ -2,7 +2,7 @@ Ch 1.1 -## Notes + **Definition:** Frequency describes the number of occurences of a given outcome from the trials of a random experiment. diff --git a/docs/FrequencyHeuristic.md b/docs/FrequencyHeuristic.md @@ -2,7 +2,7 @@ L4 -## Notes + **Definition:** The frequency heuristic is the idea that we assign credit based on how frequently things happen. diff --git a/docs/FrobeniusNorm.md b/docs/FrobeniusNorm.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** The Frobenius norm is a norm defined on matricies. This norm is defined as follows: diff --git a/docs/FunctionNotation.md b/docs/FunctionNotation.md @@ -2,6 +2,6 @@ Ch 0 -## Notes + **Definition:** Function notation is using formal math logic such as f(x) : X -> Y to define tasks. diff --git a/docs/FundamentalOperations.md b/docs/FundamentalOperations.md @@ -2,7 +2,7 @@ L1 -## Notes + **Definition:** Fundamental operations are operations that take constant time. diff --git a/docs/FundamentalTheoremOfArithmetic.md b/docs/FundamentalTheoremOfArithmetic.md @@ -2,7 +2,7 @@ Abstract Math 10.4. Can be proven through [[StrongInduction.md]] -## Notes + **Definition:** Any integer greater than 1 has a unique prime factorization. diff --git a/docs/FundamentalTheroemofCalculus.md b/docs/FundamentalTheroemofCalculus.md @@ -2,7 +2,7 @@ Khan U1 -## Notes + **Definition:** The (second) fundamental theroem of calculus states that the derivative of the integral of a function from a (constant) to x that is continuous is equivalent to the contained function with respect to x. diff --git a/docs/GCD.md b/docs/GCD.md @@ -2,7 +2,7 @@ U 2.4 -## Notes + **Definition:** The GCD of two numbers a and c is the largest integer such that a | b and a | c. diff --git a/docs/GameLoop.md b/docs/GameLoop.md @@ -2,7 +2,7 @@ CS 331 W12 L3 -## Notes + **Definition:** Each frame the loop function of each script is called. diff --git a/docs/GameObject.md b/docs/GameObject.md @@ -2,7 +2,7 @@ CS 331 W12 L3 -## Notes + **Definition:** This is the data type of objects in the game. This is a broad class that has some built in functionallity. diff --git a/docs/GaussianElimination.md b/docs/GaussianElimination.md @@ -2,7 +2,7 @@ Khan U1 -## Notes + **Definition:** Gaussian elimination is the process of simplifying a system of equations to [[ReducedRowEchelonForm.md]] to solve the system. diff --git a/docs/GaussianIntegers.md b/docs/GaussianIntegers.md @@ -2,6 +2,6 @@ AM W13 L1 -## Notes + **Definition:** This is the set of all numbers of the form a + bi such that a and b are integers and i^2 is -1. diff --git a/docs/GaussianMixtureModels.md b/docs/GaussianMixtureModels.md @@ -2,6 +2,6 @@ ML D5 -## Notes + **Definition:** Gaussian mixture models (GMMs) are probabilistic models that assume instances were generated using several gaussian distributions where each distribution forms its own cluster. diff --git a/docs/GeneralSolution.md b/docs/GeneralSolution.md @@ -2,6 +2,6 @@ Ch 2.2 -## Notes + **Definition:** A general solution to a system of linear equations is one that describes all possible solutions as combinations of each other. diff --git a/docs/GeneralizationError.md b/docs/GeneralizationError.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Generalization error or out-of-sample error, is the error rate of a model on data that is not in the training set. diff --git a/docs/GeneralizedPigeonholePrinciple.md b/docs/GeneralizedPigeonholePrinciple.md @@ -2,6 +2,6 @@ Ch 6.2 -## Notes + **Definition:** The generalized pigeonhole principle is \ceil{N/k} where N is the number of elements and k the number of groups. This gives us the maximally filled group given equitable distribution. diff --git a/docs/GradientBoosting.md b/docs/GradientBoosting.md @@ -1,7 +1,7 @@ ML D5 -## Notes + **Definition:** Gradient boosting sequentially adds predictors to an ensemble and fits subsequent models not by instance weights like adaboosting but by residual errors. diff --git a/docs/GradientClipping.md b/docs/GradientClipping.md @@ -2,7 +2,7 @@ ML P569 -## Notes + **Definition:** Gradient clipping is the process of clipping gradients during backpropogration so they never exceed some threshold. diff --git a/docs/GradientDescent.md b/docs/GradientDescent.md @@ -2,7 +2,7 @@ ML L2 -## Notes + **Definition:** Gradient Descent is an algorithm used to find a 'near' optimal approach to the given problem. This is used with [[LinearRegression.md]] to optimize the function by selecting a set of parameters $\theta$ and then repeatedly finding the direction that results in the fastest movement towards a cost function's value nearest to 0. This will find a local optimum. With linear regression however there will not be local optimum but only global. diff --git a/docs/GramSchmidtProcess.md b/docs/GramSchmidtProcess.md @@ -2,7 +2,7 @@ Khan U3 -## Notes + **Definition:** The Gram-Schmidt process is a process for finding an orthonormal basis of a subspace. diff --git a/docs/Graphs.md b/docs/Graphs.md @@ -2,7 +2,7 @@ Abstract Math 10.2. -## Notes + **Definition:** A graph is a configuration consisting of vertices and edges. diff --git a/docs/HadamardProduct.md b/docs/HadamardProduct.md @@ -2,7 +2,7 @@ Ch 2.2 -## Notes + **Definition:** The Hadamard product of two matricies (assuming they are the same size) is an index based multiplication of each element of both matricies. diff --git a/docs/HalfWord.md b/docs/HalfWord.md @@ -2,6 +2,6 @@ W1 -## Notes + **Definition:** This is half the size of a CPU's word. diff --git a/docs/Hamming.md b/docs/Hamming.md @@ -2,7 +2,7 @@ He was a person who was influential to computing -## Notes + **Hamming Distance:** The difference between two strings. This is defined as the number of positions that are different. diff --git a/docs/HarmonicMean.md b/docs/HarmonicMean.md @@ -2,7 +2,7 @@ ML D2 -## Notes + **Definition:** The harmonic mean is a metric used to describe the accuracy of a model. This value is representative of the precision and recall of a model. diff --git a/docs/HashFunction.md b/docs/HashFunction.md @@ -2,7 +2,7 @@ Ch. 5 -## Notes + **Definition:** A hash function is a function f(k) that takes a key value k (x.r = k where x is an object) and outputs a natural number. diff --git a/docs/HashTable.md b/docs/HashTable.md @@ -2,7 +2,7 @@ Ch 5 -## Notes + **Definition:** A hash table is a collection data structure that allows insertions of elements and checking for elements that uses a hashing function to place objects into an array for 'constant' time access. diff --git a/docs/HashValues.md b/docs/HashValues.md @@ -2,7 +2,7 @@ Ch 5 -## Notes + **Definition:** A hash value is the output of the hash function that describes which index we should try to place an element in. diff --git a/docs/Hashing.md b/docs/Hashing.md @@ -2,6 +2,6 @@ L4 - Ch5 (Rosen) -## Notes + **Definition:** Hashing is a process done whereby we use some function f(x) to map one value to another where the output value is generally an index or otherwise adressable place. diff --git a/docs/HasseDiagram.md b/docs/HasseDiagram.md @@ -2,7 +2,7 @@ Ch 9.6 -## Notes + **Definition:** A hasse diagram is a way to show a (finite) poset in a graphical way. diff --git a/docs/HistogramBasedGradientBoosting.md b/docs/HistogramBasedGradientBoosting.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Histogram based gradient boosting is an implementation of gradient boosting that uses binning of input features. diff --git a/docs/HistoricalDesigns.md b/docs/HistoricalDesigns.md @@ -2,6 +2,6 @@ Discussion of designs used historically and things we can take away. -## Notes + There is a trade off taken historically to use many cores instead of a single powerful core. It is much easier to architect simple cores that chain together than to architect one powerful core. This has a trade off in that it requires developers higher in the stack to ensure their code takes advantage of all of the cores using parallelization. diff --git a/docs/Homogeneous.md b/docs/Homogeneous.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** In linear algebra a homogeneous solution is one where the right side of the system is the zero vector. diff --git a/docs/Hyperparameter.md b/docs/Hyperparameter.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** A hyperparameter in ML is a parameter that is defined prior to training that is not influenced by samples. diff --git a/docs/Hyperplane.md b/docs/Hyperplane.md @@ -2,6 +2,6 @@ Khan U2 -## Notes + **Definition:** A hyperplane is a 3-dimensional or higher subspace with dimensionality that is one less than the [[AmbientSpace.md]]. diff --git a/docs/Hypervolume.md b/docs/Hypervolume.md @@ -2,6 +2,6 @@ Khan U2 -## Notes + **Definition:** Hypervolume much like [[Hyperplane.md]] is volume in dimensions higher than 3. diff --git a/docs/IPD.md b/docs/IPD.md @@ -1,7 +1,7 @@ CS 331 W16 -## Notes + **Definition:** This is the distance between the pupils. diff --git a/docs/IQR.md b/docs/IQR.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The IQR is the difference between the 75th percentile and 25th percentile as a value. diff --git a/docs/ISA.md b/docs/ISA.md @@ -2,7 +2,7 @@ Computer Architecture L(2,3) -## Notes + **Definition:** The design of the interconnection between hardware and software to create a functional computing system. diff --git a/docs/IdentityMatrix.md b/docs/IdentityMatrix.md @@ -2,7 +2,7 @@ Khan Unit 2 -## Notes + **Definition:** The identity matrix is the matrix in R^n such that any matrix in R^n multiplied by it is equal to itself. diff --git a/docs/Image.md b/docs/Image.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** The image of a function is the total set of all outputs of a given function (transformation for vectors). diff --git a/docs/ImitationLearning.md b/docs/ImitationLearning.md @@ -2,7 +2,7 @@ L1 -## Notes + **Definition:** Imitation learning is not RL. It is the process of training a model on expert data making it a form of supervised learning. diff --git a/docs/Imputation.md b/docs/Imputation.md @@ -2,7 +2,7 @@ CH2 -## Notes + **Definition:** Imputation is the process of filling in null values with some appropriate value. diff --git a/docs/Incremental.md b/docs/Incremental.md @@ -2,7 +2,7 @@ CLRS 2.3 -## Notes + **Definition:** Incremental algorithms are algorithms that solve the task in order (iteratively). diff --git a/docs/IncrementalMean.md b/docs/IncrementalMean.md @@ -2,7 +2,7 @@ L4 -## Notes + **Definition:** Incremental mean is a mean calculation where we update the mean according to the next sample without having to calculate the mean by summing all priors. diff --git a/docs/Independence.md b/docs/Independence.md @@ -2,7 +2,7 @@ L3 -## Notes + **Definition:** Independence in probability is the case where some even B occuring does not affect the conditional probability of A occuring. diff --git a/docs/IndependentEvents.md b/docs/IndependentEvents.md @@ -2,7 +2,7 @@ Ch 1.4 -## Notes + **Definition:** Independent events are events such that the conditional probability is equivalent to the unconditioned probability of the given event. diff --git a/docs/Indistinguishable.md b/docs/Indistinguishable.md @@ -2,6 +2,6 @@ Ch 6.5 -## Notes + **Definition:** Indistinguishable means two elements, when switches, do not result in a new permutation. diff --git a/docs/Individuals.md b/docs/Individuals.md @@ -2,6 +2,6 @@ Khan -## Notes + **Definition:** The individuals of a dataset are the objects being studied. diff --git a/docs/Induction.md b/docs/Induction.md @@ -2,7 +2,7 @@ Proof by induction from W11 abstract algebra. Induction is used to prove a statement relating to infinite sets of elements. This is not to be confused with inductive reasoning which is assumptions based on past data. -## Notes + **Definition:** This type of proof is done by proving that the first is true and how that subsequently means the rest are true (think dominoes). diff --git a/docs/Inertia.md b/docs/Inertia.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Inertia in machine learning is the sum of the squared distances from instances to their closest centroid. diff --git a/docs/Inference.md b/docs/Inference.md @@ -2,7 +2,7 @@ Ch2 -## Notes + **Definition:** Inference is the statistical process of finding relationships between data. diff --git a/docs/InformationContent.md b/docs/InformationContent.md @@ -2,6 +2,6 @@ Ch 6 -## Notes + **Definition:** The information content of a finite set of messages S is log_b(n) where n is the cardinality of S and b is the counting system (2 for binary). diff --git a/docs/InformationSecurity.md b/docs/InformationSecurity.md @@ -4,7 +4,7 @@ **Chapter:** 1.1 -## Notes + **Definition:** Information security is a subset of cybersecurity which is focused on confidentiality, integrity, and availability of information. diff --git a/docs/Inhomogeneous.md b/docs/Inhomogeneous.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** An inhomogeneous solution in linear algebra is a solution where the right side of the system of equations is not the zero vector. diff --git a/docs/Injective.md b/docs/Injective.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** For a function to be injective each value in the domain must map to a unique value in the codomain. diff --git a/docs/Input.md b/docs/Input.md @@ -2,7 +2,7 @@ CS 331 W12 L1 -## Notes + **Definition:** Input is the class used the get input from the user. diff --git a/docs/InsertionSort.md b/docs/InsertionSort.md @@ -2,7 +2,7 @@ CRLS 2.1 -## Notes + **Definition:** Insertion sort is a sorting algorithm with a worst case complexity of n^2 that selects the next element in the array, moves it to the left side in the correctly sorted position, and then iterates through the list for all items. diff --git a/docs/InstanceBasedLearning.md b/docs/InstanceBasedLearning.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Instance based learning is a system by which we identify information and when it occurs again, we are able to detect it. diff --git a/docs/Instruction.md b/docs/Instruction.md @@ -2,7 +2,7 @@ CA L3 -## Notes + **Definition:** An instruction is the most basic element of the hardware software interface which describes what to do and to who. diff --git a/docs/IntegerOverflow.md b/docs/IntegerOverflow.md @@ -2,6 +2,6 @@ W1 -## Notes + **Definition:** An integer overflow is where we carry a 1 past the end of an integer thus causing it to be 'lost'. diff --git a/docs/Integrity.md b/docs/Integrity.md @@ -4,6 +4,6 @@ **Chapter:** 1.1 -## Notes + **Definition:** Integrity of data means it is only changed in a specified and authorized manor and integrity of systems means systems perform their intended function in an unimpaired manner, free of manipulation. diff --git a/docs/IntelligenceExplosion.md b/docs/IntelligenceExplosion.md @@ -2,6 +2,6 @@ Superintelligence - Bostrom -## Notes + **Definition:** The intelligence explosion is the idea that once a system achieves human intelligence, it will then be able to recursively self improve causing an explosion in intelligence. diff --git a/docs/Intractable.md b/docs/Intractable.md @@ -2,7 +2,7 @@ U 2.3 -## Notes + **Definition:** An intractable problem is one that can not be solved in polynomial time. diff --git a/docs/Invariance.md b/docs/Invariance.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** Invariance in ML describes changes to objects such that the model should still interpret the object the same way. diff --git a/docs/Inverse.md b/docs/Inverse.md @@ -2,7 +2,7 @@ 1.1.2 -## Notes + **Definition:** The inverse of an implication statement is the negation of both terms. diff --git a/docs/InverseFunction.md b/docs/InverseFunction.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** The inverse function of f(x) is defined as f^-1(x) where f^-1(x) maps from the codomain of f(x) to the domain of f(x). diff --git a/docs/InverseMatrix.md b/docs/InverseMatrix.md @@ -4,7 +4,7 @@ **Lecture:** 2 -## Notes + **Definition:** The inverse matrix is the matrix such that A * A' = I. diff --git a/docs/InverseTransformation.md b/docs/InverseTransformation.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** The inverse of a transformation is the transformation that undoes the original transformation for the entire domain codomain of the original transformation. diff --git a/docs/Invertible.md b/docs/Invertible.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** For a matrix A to be invertible there must be another matrix B such that A * B = I and B * A = I where I is the identity matrix. diff --git a/docs/Isomorphic.md b/docs/Isomorphic.md @@ -4,7 +4,7 @@ **Chapter:** 3 -## Notes + --- diff --git a/docs/IteratedExpectations.md b/docs/IteratedExpectations.md @@ -2,7 +2,7 @@ L12 -## Notes + **Definition:** The law of iterated expectations states the expected value of a conditional expectation is the unconditional expectation. diff --git a/docs/Jerk.md b/docs/Jerk.md @@ -2,7 +2,7 @@ Section 2.8 -## Notes + **Definition:** A jerk is the third derivative of a position function. diff --git a/docs/JointDensityFunction.md b/docs/JointDensityFunction.md @@ -2,7 +2,7 @@ Prob L9 -## Notes + **Definition:** A joint density function is a function that takes two inputs and outputs a probability of the combination. diff --git a/docs/JointProbability.md b/docs/JointProbability.md @@ -2,7 +2,7 @@ Stats L2 + L6 -## Notes + **Definition:** A joint probability is the probability of multiple conditions. diff --git a/docs/KMeans.md b/docs/KMeans.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** K-means clustering is a clustering algorithm that clusters data together by finding the mean distance from clusteroids and places said element into said cluster. diff --git a/docs/KNearestNeighbor.md b/docs/KNearestNeighbor.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** k nearest neighbor is the idea of using the k nearest elements of some set to derive some information. diff --git a/docs/Kernel.md b/docs/Kernel.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The kernel of a linear transformation is the set of all vectors that are equal to the null vector under the L.T. diff --git a/docs/Key.md b/docs/Key.md @@ -2,7 +2,7 @@ Ch 5 -## Notes + **Definition:** A key is list of attribute of an object x that uniquely identifies it from all other elements of our universe. diff --git a/docs/KeyframeAnimation.md b/docs/KeyframeAnimation.md @@ -2,7 +2,7 @@ CG W13 L3 -## Notes + **Definition:** Keyframe animation is the process of animation used in blender where you specify keyframes and positions of objects at said times. diff --git a/docs/Keyless.md b/docs/Keyless.md @@ -4,7 +4,7 @@ **Chapter:** 1.6 -## Notes + **Definition:** Keyless cryptography is the transformation of data without using encryption keys. diff --git a/docs/KnowledgeBaseApproach.md b/docs/KnowledgeBaseApproach.md @@ -4,6 +4,6 @@ **Chapter:** 1 -## Notes + **Definition:** The knowledge base approach to machine learning is the idea that we hard code in a knowledge base into a system to make it intelligent. diff --git a/docs/L1Norm.md b/docs/L1Norm.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** L1 norm is computed as described by [Norm](Norm.md) and represents the sum of all coordinates of a given vector. diff --git a/docs/L2Norm.md b/docs/L2Norm.md @@ -4,6 +4,6 @@ **Chapter:** 2 -## Notes + **Definition:** L2 norm is the standard euclidean distance. diff --git a/docs/LCM.md b/docs/LCM.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** LCM is the least common multiple of two numbers meaning it is the smallest number that is divisible by both values. diff --git a/docs/LLE.md b/docs/LLE.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** LLE is a dimensionality reduction technique that uses manifold learning instead of projection. diff --git a/docs/LUDecomposition.md b/docs/LUDecomposition.md @@ -4,7 +4,7 @@ **Lecture:** 4 -## Notes + **Definition:** LU decomposition is the process of decomposing a matrix into an upper triangular matrix and a lower triangular matrix. diff --git a/docs/LabelEncoding.md b/docs/LabelEncoding.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** Label encoding is the process of encoding some arbitrary label as an arbitrary number. diff --git a/docs/Language.md b/docs/Language.md @@ -4,7 +4,7 @@ **Lecture:** 2 -## Notes + **Definition:** A language (alphabet) is a finite set of symbols. diff --git a/docs/LasVegasMethod.md b/docs/LasVegasMethod.md @@ -2,6 +2,6 @@ SS -## Notes + **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/LassoRegression.md b/docs/LassoRegression.md @@ -2,7 +2,7 @@ ML D3 -## Notes + **Definition:** Lasso regression is another form of linear regression that adds a regularization term to the loss function but weights it different than ridge regression. diff --git a/docs/LatentSpace.md b/docs/LatentSpace.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** Latent space is a lower dimensional embedding space used to represent higher dimensional information. diff --git a/docs/LawOfCosines.md b/docs/LawOfCosines.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** The law of cosines is defined as c^2 = a^2 + b^2 - 2ab cos(C) where a and b are side lengths and c is the side length to be found that is opposite of the angle C. diff --git a/docs/LawOfDetachment.md b/docs/LawOfDetachment.md @@ -2,7 +2,7 @@ U 1.6.1 -## Notes + **Definition:** The law of detachment is a law that specifies a form that valid arguments can take. diff --git a/docs/LawOfLargeNumbers.md b/docs/LawOfLargeNumbers.md @@ -2,7 +2,7 @@ L19 -## Notes + **Definition:** The average results from a large set of independent trials converges upon the true value. diff --git a/docs/LeakyReLU.md b/docs/LeakyReLU.md @@ -2,7 +2,7 @@ ML P554 -## Notes + **Definition:** Leaky ReLU is a variant of ReLU designed to solve the problem of neurons dying due to the use of ReLU. diff --git a/docs/LearningRate.md b/docs/LearningRate.md @@ -2,7 +2,7 @@ ML L2 -## Notes + **Definition:** The learning rate is a constant used to narrow in upon some value based on it's distance from an expected value. The further away from the value, the larger the change for a parameter(s) will be. diff --git a/docs/LexicographicOrdering.md b/docs/LexicographicOrdering.md @@ -2,7 +2,7 @@ Ch 9.6 -## Notes + **Definition:** Lexicographic ordering is the same as alphabetic ordering. diff --git a/docs/Lighting.md b/docs/Lighting.md @@ -2,7 +2,7 @@ CS 331 W12 L3 -## Notes + ### Light Options diff --git a/docs/LinearCombination.md b/docs/LinearCombination.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + ### In Linear Algebra diff --git a/docs/LinearCongruence.md b/docs/LinearCongruence.md @@ -2,6 +2,6 @@ Ch 2.4 -## Notes + **Definition:** A linear congruence is a congruence of the form ax \equiv b (mod c) where a,b,c are integers and x is a variable. diff --git a/docs/LinearEquations.md b/docs/LinearEquations.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** Linear equations are equations of the form y = mx+b where m and b are real coefficients. diff --git a/docs/LinearHomogeneousRecurrenceRelation.md b/docs/LinearHomogeneousRecurrenceRelation.md @@ -2,7 +2,7 @@ Ch 8.2 -## Notes + **Definition:** A linear homogeneous recurrence relation is a recurrence relation where each element is a linear combination of k prior elements (degree k). diff --git a/docs/LinearIndependence.md b/docs/LinearIndependence.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** Linear independence means that every column in a given matrix gives another degree of freedom. diff --git a/docs/LinearMaps.md b/docs/LinearMaps.md @@ -4,7 +4,7 @@ **Chapter:** 3 -## Notes + **Definition:** A linear map is a function f : V -> W where V and W are vector spaces, that has the following properties: diff --git a/docs/LinearProbing.md b/docs/LinearProbing.md @@ -2,7 +2,7 @@ Ch 5 -## Notes + **Definition:** Linear probing is a probing (open addressing) strategy that selects the next open index to place any objects that experienced a collission. diff --git a/docs/LinearRegression.md b/docs/LinearRegression.md @@ -2,7 +2,7 @@ ML L2 - Also referred to as ordinary least squares -## Notes + **Definition:** Fitting a straight line to data which allows for arbitrary inputs in the valid domain but not necessarily in the training set, to get accurate outputs. diff --git a/docs/LinearSubspace.md b/docs/LinearSubspace.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** A linear subspace is a subset (inclusive of the subset being the entire set) of a space of equal or greater cardinality where the linear subspace contains the zero vector. diff --git a/docs/LinearTransformation.md b/docs/LinearTransformation.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** A linear transformation is a function with an input and output vector that respects addition and scalar multiplication. diff --git a/docs/Linearithmic.md b/docs/Linearithmic.md @@ -2,6 +2,6 @@ Ch 2 -## Notes + **Definition:** Linearithmic time complexity (or linear log or just n log n) is a commonly used name to describe n log n time complexity. diff --git a/docs/LinkedLists.md b/docs/LinkedLists.md @@ -2,7 +2,7 @@ This is from CS 221 W11 Lecture 13. -## Notes + **Definition:** A linked list is a list of items that are linked together using pointers. As such they are not in contiguous memory. diff --git a/docs/LinuxStuff.md b/docs/LinuxStuff.md @@ -2,7 +2,7 @@ These are links to linux stuff that I want to remember, but sometimes forget. Consider, I am starting this on 24/04/16 so I will not include any basic things as I already know them well. -## Notes + - [rsync](rsync.md) - [sed](sed.md) diff --git a/docs/LoadFactor.md b/docs/LoadFactor.md @@ -2,6 +2,6 @@ Ch 5 -## Notes + **Definition:** The load factor of a hashtable is the percentage of the underlying array that is full. diff --git a/docs/LocalScale.md b/docs/LocalScale.md @@ -2,7 +2,7 @@ CS331 W12 L2 -## Notes + Member of transform class that can be assigned. This affects the local scale of the GameObject. diff --git a/docs/LogarithmicDifferentiation.md b/docs/LogarithmicDifferentiation.md @@ -2,7 +2,7 @@ Leonard -## Notes + **Definition:** Logarithmic differentiation is the process of applying logs to both sides of an equation to aid in our ability to find their derivative. diff --git a/docs/Loop.md b/docs/Loop.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A loop in a graph is a connection to one's self. diff --git a/docs/LoopInvariant.md b/docs/LoopInvariant.md @@ -2,7 +2,7 @@ CLRS 2.1 -## Notes + **Definition:** A loop invariant is a condition that is true before and after a loop is ran. diff --git a/docs/LossFunction.md b/docs/LossFunction.md @@ -2,7 +2,7 @@ Ch 1 -## Notes + **Definition:** A loss function is a function from E -> R where E is the set of all events (outcomes) and R is the set of all real numbers where the function describes how bad a given event E is. diff --git a/docs/Lvalue.md b/docs/Lvalue.md @@ -2,7 +2,7 @@ cs202 W14 L16 -## Notes + **Definition:** An lvalue is a value that is not temporary and cannot be moved. diff --git a/docs/MAE.md b/docs/MAE.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** MAE also known as average absolute deviation or mean absolute error is an error metric used to describe the accuracy of a model by taking the difference between the inference and actual values of a set of samples and averaging the value. diff --git a/docs/MCTS.md b/docs/MCTS.md @@ -2,6 +2,6 @@ ML SS -## Notes + **Definition:** diff --git a/docs/MLP.md b/docs/MLP.md @@ -1,7 +1,7 @@ ML D6 -## Notes + **Definition:** Multilayer perceptrons are a form of deep neural network that are a feedforward process where each output goes forward to the next layer of perceptrons until reaching the output layer. This is a subset of neural networks as not all NNs are fully connected like RNNs/CNNs. diff --git a/docs/MUX.md b/docs/MUX.md @@ -2,6 +2,6 @@ CA L3 -## Notes + **Definition:** A MUX is a multiplexer which allows multiple inputs and selects one to be the output. This is also known as a data selector. diff --git a/docs/ManifoldLearning.md b/docs/ManifoldLearning.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Manifold learning is the process of mapping a higher dimensional object to a lower dimensional manifold. diff --git a/docs/MarginalProbabilities.md b/docs/MarginalProbabilities.md @@ -2,6 +2,6 @@ Stats L2 -## Notes + **Definition:** Marginal probabilities are probabilities that are not conditional upon any other probabilities. diff --git a/docs/MarkovAssumption.md b/docs/MarkovAssumption.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** The Markov assumption is the assumption that prior events don't matter and all necessary information that dictates the future is in the current state. diff --git a/docs/MarkovChains.md b/docs/MarkovChains.md @@ -2,7 +2,7 @@ L13 -## Notes + **Definition:** A markov chain is a sequence of events where the probability of any given event is **entirely** based on the previous event. diff --git a/docs/MarkovDecisionProcesses.md b/docs/MarkovDecisionProcesses.md @@ -2,7 +2,7 @@ RL Ch 1 -## Notes + **Definition:** Markov decision processes describe an environment for reinforcement learning. diff --git a/docs/MarkovInequality.md b/docs/MarkovInequality.md @@ -2,6 +2,6 @@ L19 -## Notes + **Definition:** The Markov inequality gives the probability that a random variable is greater than or equal to some constant. diff --git a/docs/MarkovProcess.md b/docs/MarkovProcess.md @@ -2,6 +2,6 @@ Prob L16 -## Notes + **Definition:** Markov processes are multiple trials of [[MarkovChains.md]]. diff --git a/docs/MarkovRewardProcess.md b/docs/MarkovRewardProcess.md @@ -2,6 +2,6 @@ L2 -## Notes + **Definition:** A markov reward process is a markov chain with reward values associated with states or transitions. diff --git a/docs/MathConceptsCS331.md b/docs/MathConceptsCS331.md @@ -2,7 +2,7 @@ Math Relating to CS331. -## Notes + [Dot Product](DotProduct.md) [Determinant](Determinant.md) diff --git a/docs/Matrix.md b/docs/Matrix.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition** A matrix is a 2d grid of numerical values. diff --git a/docs/MatrixMultiplication.md b/docs/MatrixMultiplication.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** The product of A and B is defined as AB where each column of AB is Axb_n where n is the number of the column. diff --git a/docs/MaxNorm.md b/docs/MaxNorm.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** Max norm is denoated as L^inf and returns the largest coordinate value of a given vector. diff --git a/docs/MaxNormRegularization.md b/docs/MaxNormRegularization.md @@ -2,6 +2,6 @@ ML P612 -## Notes + **Definition:** Max-norm regularization is a regularization technique for neural networks that limits the combination (euclidean norm) of all incoming weights to a predefined range. If a step goes beyond this the weights are scaled accordingly to ensure compliance. diff --git a/docs/MaxPooling.md b/docs/MaxPooling.md @@ -2,7 +2,7 @@ ML SS -## Notes + **Definition:** Max pooling is a processing technique whereby a pool size is selected (2x2 as an example) and the values in the pool are compressed into one value. diff --git a/docs/Memory.md b/docs/Memory.md @@ -2,7 +2,7 @@ Memory information from computer architecture course -## Notes + Memory performance can affect compute speed of multiple applications running concurrently. This results in poorer performance for one despite having the clocks needed to computer correctly (denial of memory). Using nice does not change this which is the priority system for OSes. This is being caused by the DRAM memory controller being shared and thus causing a bottleneck. diff --git a/docs/MemoryManagement.md b/docs/MemoryManagement.md @@ -2,7 +2,7 @@ Memory management CS 202 ~W10 C++ -## Notes + Memory management in C++ is done using a few keywords shown below diff --git a/docs/MergeSort.md b/docs/MergeSort.md @@ -2,7 +2,7 @@ CLRS 2.3 -## Notes + **Definition:** Merge sort is an algoritmh that uses [[DivideAndConquer.md]] to sort a list in log linear (n log(n)) time. diff --git a/docs/MersennePrime.md b/docs/MersennePrime.md @@ -2,7 +2,7 @@ U 2.4 -## Notes + **Definition:** A mersenne prime is a prime number of the form (2^n) - 1. diff --git a/docs/Mesh.md b/docs/Mesh.md @@ -2,7 +2,7 @@ CS 331 W11 L2 -## Notes + **Definition:** A mesh is a representational grid of an object's surface used in [[SurfaceRepresentation.md]] diff --git a/docs/MeshFilter.md b/docs/MeshFilter.md @@ -2,6 +2,6 @@ [[Unity]] game engine component -## Notes + The mesh filter sets the shape of an object. Without a renderer, this does nothing, but this gives the general dimensions of the object (not scale though). diff --git a/docs/MeshRenderer.md b/docs/MeshRenderer.md @@ -2,6 +2,6 @@ [[Unity]] Component. -## Notes + A mesh renderer is the component that assigns a material to an object. This does not have shape just material. The default is the magenta material. diff --git a/docs/MicroArchitecture.md b/docs/MicroArchitecture.md @@ -2,7 +2,7 @@ Computer Architecture L2 -## Notes + **Definition:** The implementation of an agreed upon ISA. These are the underlying mechanics that are not exposed to the OS/System developer. diff --git a/docs/Microcontroller.md b/docs/Microcontroller.md @@ -2,7 +2,7 @@ W2 -## Notes + **Definition:** A microcontroller consists of a cpu, integrated memory, and the ability to use external memory. diff --git a/docs/Microprocessor.md b/docs/Microprocessor.md @@ -2,7 +2,7 @@ W2 -## Notes + **Definition:** A microprocessor is simply a processor by itself. diff --git a/docs/MillerRabinAlgorithm.md b/docs/MillerRabinAlgorithm.md @@ -4,7 +4,7 @@ **Chapter:** 2.6 -## Notes + **Definition:** The Miller-Rabin Algorithm uses the knowledge that if $n$ is prime then either the first element in the list of residues modulo $n$ equals 1; or some element in the list equals ($n-1$); otherwise $n$ is composite. This only guarantees a number is likely prime because this is necessary but not sufficient. diff --git a/docs/MinMaxScaling.md b/docs/MinMaxScaling.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** Min-max scaling also referred to as normalization is a shift from the current values to between two arbitrary values. diff --git a/docs/MinusOneTrick.md b/docs/MinusOneTrick.md @@ -2,7 +2,7 @@ Ch 2.2 -## Notes + **Definition:** The minus one trick is a method used to find general solutions to a system of equations by making a rectangular matrix a square matrix and adding -1 into each position along the diagnal that is not 1. diff --git a/docs/MixedGraph.md b/docs/MixedGraph.md @@ -2,6 +2,6 @@ 10.1 -## Notes + **Definition:** A mixed graph is a graph that allows directed and undirected edges, loops, and multi-edges. diff --git a/docs/MixedRandomVariable.md b/docs/MixedRandomVariable.md @@ -2,7 +2,7 @@ Prob L8 -## Notes + **Definition:** A mixed random variable is a [[RandomVariables.md]] comprised of some continuous and discrete randomness. diff --git a/docs/Mod.md b/docs/Mod.md @@ -2,7 +2,7 @@ U 2.4 -## Notes + **Definition:** Mod is a mathematical function where we find the value 0 <= n < a such that a = bk + n for some integer b. diff --git a/docs/Model.md b/docs/Model.md @@ -2,7 +2,7 @@ RL Ch 1 -## Notes + **Definition:** A model in RL is an agents representation of its environment that allows it to predict expected outcomes. diff --git a/docs/ModelBasedLearning.md b/docs/ModelBasedLearning.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Model based learning takes in inputs, does predictions, and gives an output. diff --git a/docs/ModelFree.md b/docs/ModelFree.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** A model free approach in RL means the agent does not know or estimate probabilities of state transitions and as such learns directly from experience. diff --git a/docs/Momentum.md b/docs/Momentum.md @@ -2,7 +2,7 @@ ML P580 -## Notes + **Definition:** Momentum optimization is an optimization algorithm that uses the idea of momentum to reach an optimum faster. diff --git a/docs/MonoBehaviour.md b/docs/MonoBehaviour.md @@ -2,7 +2,7 @@ CS 331 W12 L3 -## Notes + **Definition:** Monobehaviour is the default inherited class for scripts which contains start and update. diff --git a/docs/MonotonicFunction.md b/docs/MonotonicFunction.md @@ -2,7 +2,7 @@ Stats -## Notes + **Definition:** A monotonically increasing function is one where as the input increases the output either stays the same or increases. The inverse is also true with a monotonically decreasing function. The statement of monotonicity simply means always increasing or decreasing. diff --git a/docs/MonteCarloLearning.md b/docs/MonteCarloLearning.md @@ -2,7 +2,7 @@ L4 -## Notes + **Definition:** Monte Carlo learning is a learning method that uses episodes and averages their returns to optimize policies. diff --git a/docs/MonteCarloMethod.md b/docs/MonteCarloMethod.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** The monte carlo method is a class of algorithms that use repeated random sampling to converge upon a solution to a problem where there may be a true solution, but are too complex to analyze. diff --git a/docs/MooresLaw.md b/docs/MooresLaw.md @@ -2,7 +2,7 @@ Computer architecture L2. -## Notes + **Definition:**Component counts double every other year. diff --git a/docs/MosaicPlot.md b/docs/MosaicPlot.md @@ -2,6 +2,6 @@ Stats D4 -## Notes + **Definition:** A mosaic plot is a plot that shows cross tabulated information in a graphical way where each box is sized according to the actual values of the classes associated with the given position. diff --git a/docs/Movement.md b/docs/Movement.md @@ -2,7 +2,7 @@ CS 331 W12 L1 -## Notes + There are many different ways to implement movement. diff --git a/docs/MultiValuedFunction.md b/docs/MultiValuedFunction.md @@ -2,7 +2,7 @@ Ch 0 -## Notes + **Definition:** Multivalued functions are functions such that there exists two or more values in the codomain for at least one value in the domain. diff --git a/docs/MulticlassClassifier.md b/docs/MulticlassClassifier.md @@ -2,6 +2,6 @@ ML D2 -## Notes + **Definition:** A multiclass classifier is a classifier that classifies items into more than two classes (not binary classification). diff --git a/docs/Multigraph.md b/docs/Multigraph.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A multi-graph is a graph that can contain multiple edges to the same node. diff --git a/docs/MultilabelClassification.md b/docs/MultilabelClassification.md @@ -2,7 +2,7 @@ ML D2 -## Notes + **Definition:** Multilabel classification is classification where there may be multiple binary outputs that are true. diff --git a/docs/MultinomialCoefficient.md b/docs/MultinomialCoefficient.md @@ -2,7 +2,7 @@ Ch 1.3 -## Notes + **Definition:** A multinomial coefficient is a form of binomial coefficient where the bottom of the binomial coefficient is multiple numbers. diff --git a/docs/MultioutputClassification.md b/docs/MultioutputClassification.md @@ -2,6 +2,6 @@ ML D2 -## Notes + **Definition:** Multioutput classification is a type of multilabel classification where each output can be multiple classes. diff --git a/docs/Multiset.md b/docs/Multiset.md @@ -2,7 +2,7 @@ U2.2.5 -## Notes + **Definition:** A multiset is an unordered collection that can contain multiple instances of the same object. diff --git a/docs/MutuallyIndependent.md b/docs/MutuallyIndependent.md @@ -2,6 +2,6 @@ Ch 1.4 -## Notes + **Definition:** A set of mutually independent events is a set such that all conditional probabilities (any combination) are equivalent to the unconditioned probabilities. diff --git a/docs/NAG.md b/docs/NAG.md @@ -2,6 +2,6 @@ ML P582 -## Notes + **Definition:** NAG is an improvment upon the momentum optimization algorithm where instead of finding the gradient of the current position and adding this to the velocity, we instead find the gradient slightly ahead (in direction of momentum) and then add this factor to the velocity. diff --git a/docs/NLP.md b/docs/NLP.md @@ -2,6 +2,6 @@ ML Book CH1 -## Notes + **Definition:** NLP is the acronym for natural language processing. This is the process of taking in language data (written, audible, or some other form), and doing something with it. This may be classification or something else. diff --git a/docs/NPComplete.md b/docs/NPComplete.md @@ -2,6 +2,6 @@ U 2.3 -## Notes + **Definition:** NP complete problems are a set of problems of the NP family such that if any of them are found to be solvable in polynomial time then P=NP. diff --git a/docs/NPProblem.md b/docs/NPProblem.md @@ -2,6 +2,6 @@ U 2.3 -## Notes + **Definition:** An NP problem (non-deterministic polynomial) is a problem that can be verified in polynomial time but is not (believed to be) solvable in polynomial time. diff --git a/docs/NaiveBayes.md b/docs/NaiveBayes.md @@ -2,7 +2,7 @@ ML SS -## Notes + **Definition:** Naive Bayes is an algorithm used to find the probabilities of text being part of a given class. diff --git a/docs/NaryOperations.md b/docs/NaryOperations.md @@ -2,6 +2,6 @@ SS -## Notes + **Definition:** N-ary operations is a general term for operations that take a finite and specific number of inputs, but don't fall into the category of unary, binary, ternary, or in some cases quaternary. diff --git a/docs/NaturalLog.md b/docs/NaturalLog.md @@ -1,6 +1,6 @@ # Natural Log -## Notes + **Definition:** The natural log (ln) is an expression stating the output of the logarithm function is the value such that e^x is equal to the value being taken as the input. diff --git a/docs/Negation.md b/docs/Negation.md @@ -2,6 +2,6 @@ 1.1.1 -## Notes + **Definition:** Negation is the process of inverting the truthiness of a proposition. diff --git a/docs/NestedQuantifier.md b/docs/NestedQuantifier.md @@ -2,7 +2,7 @@ U 1.5.1 -## Notes + **Definition:** Nested quantifiers are when there are multiple quantifiers in the same scope. diff --git a/docs/NetworkSecurity.md b/docs/NetworkSecurity.md @@ -4,6 +4,6 @@ **Chapter:** 1.1 -## Notes + **Definition:** Protection of networks and their service. diff --git a/docs/NeuralNetworks.md b/docs/NeuralNetworks.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Artificial neural networks are machine learning models that mimick biological neurons to complete some task. diff --git a/docs/NonDeterministicFiniteAutomata.md b/docs/NonDeterministicFiniteAutomata.md @@ -4,7 +4,7 @@ **Lecture:** 3 -## Notes + **Definition:** An NFA is a machine that may have several choices for the next state at any point. This is to say some edges may have multiple labels. diff --git a/docs/NonRepudation.md b/docs/NonRepudation.md @@ -4,7 +4,7 @@ **Chapter:** 1.1 -## Notes + **Definition:** Non-repudation means that it is irrefutable an action was performed by an individual. diff --git a/docs/Norm.md b/docs/Norm.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** Norm is a function defined as follows: diff --git a/docs/NormalDistribution.md b/docs/NormalDistribution.md @@ -2,7 +2,7 @@ Stats D1 + Prob L8 -## Notes + **Definition:** A normal distribution is a unimodal one in which most observations cluster around the mound while fewer and fewer observations are farther away. diff --git a/docs/NormalVector.md b/docs/NormalVector.md @@ -2,6 +2,6 @@ Khan -## Notes + **Definition:** The normal vector of a hyperplane is a vector that is orthogonal to the hyperplane (there are infinitely many as this is simply a direction and the magnitude does not matter unless specifying unit normal vector). diff --git a/docs/NoveltyDetection.md b/docs/NoveltyDetection.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Novelty detection is used to detect new samples that appear different from other instances in the training set. diff --git a/docs/NullSpace.md b/docs/NullSpace.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The null space of matrix A is the set of vectors {$\vec{b} \in \R^n | \space \vec{b} \cdot A=\vec{0}$}. diff --git a/docs/Nullity.md b/docs/Nullity.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The nullity of a matrix is the dimensionallity of its [[NullSpace.md]]. diff --git a/docs/NumberTheory.md b/docs/NumberTheory.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** Number theory is a branch of mathematics that concerns itself with properties and functions on integers. diff --git a/docs/OSI.md b/docs/OSI.md @@ -4,7 +4,7 @@ **Chapter:** 1.2 -## Notes + **Definition:** OSI is an accepted standard for networking and security. diff --git a/docs/OffPolicyLearning.md b/docs/OffPolicyLearning.md @@ -2,6 +2,6 @@ L5 -## Notes + **Definition:** Off policy learning can be thought of as looking over someone else's shoulder to understand what will and will not result in high rewards. diff --git a/docs/OfflineLearning.md b/docs/OfflineLearning.md @@ -1,7 +1,7 @@ ML CH1 -## Notes + **Definition:** Offline learning is the process of learning and then implementing the learned behavior where the model can not learn incrementally. This is also referred to as batch learning. diff --git a/docs/OnPolicyLearning.md b/docs/OnPolicyLearning.md @@ -2,7 +2,7 @@ L5 -## Notes + **Definition:** On policy learning is learning by following the policy. diff --git a/docs/OneHotEncoding.md b/docs/OneHotEncoding.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** One hot encoding is the process of taking all unique features of a given feature and expanding these out to be individual boolean attributes of a sample. diff --git a/docs/OneVersusAll.md b/docs/OneVersusAll.md @@ -2,7 +2,7 @@ ML D2 -## Notes + **Definition:** One versus all classifiers are a sequence of binary classifiers that output probabilities where the highest probability is then selected as the output. diff --git a/docs/OneVersusOne.md b/docs/OneVersusOne.md @@ -2,7 +2,7 @@ ML D2 -## Notes + **Definition:** A one versus one classification strategy trains binary classifiers to output the probability of an input being part of one class or another. diff --git a/docs/OnesComplement.md b/docs/OnesComplement.md @@ -1,7 +1,7 @@ Self Study -## Notes + **Definition:** One's complement is an implementation of signed values such that a 1 in the MSB position indicates the number is negative. diff --git a/docs/OnlineLearning.md b/docs/OnlineLearning.md @@ -1,7 +1,7 @@ ML CH1 -## Notes + **Definition:** Online learning is the process of learning as a model is fed new data. diff --git a/docs/Opcode.md b/docs/Opcode.md @@ -2,7 +2,7 @@ CA L3 -## Notes + **Definition:** An opcode is the first part of an [[Instruction.md]] which describes what the instruction does. diff --git a/docs/OpenAddressing.md b/docs/OpenAddressing.md @@ -2,6 +2,6 @@ L4 -## Notes + **Definition:** Open addressing is the process of resolving collisions by probing for the next available location in a predefined manor to remove the need to resolve collisions with another data structure. diff --git a/docs/Operands.md b/docs/Operands.md @@ -2,7 +2,7 @@ CA L3 -## Notes + **Definition:** Operands describe who an [[Instruction.md]] should be done to. diff --git a/docs/OperatorNotation.md b/docs/OperatorNotation.md @@ -2,6 +2,6 @@ Ch 0 -## Notes + **Definition:** Operator notation is a way to define tasks in a way that uses complex operators such as x+y to define the addition of the ordered pair (x,y). diff --git a/docs/OptimalBayesianAgent.md b/docs/OptimalBayesianAgent.md @@ -2,6 +2,6 @@ Superintelligence - Bostrom -## Notes + **Definition:** An optimal bayesian agent is an agent that at all times takes the best possible action based on probabilities and expected values to maximize some utility/cost function. diff --git a/docs/OptimalSubstructure.md b/docs/OptimalSubstructure.md @@ -2,6 +2,6 @@ L3 -## Notes + **Definition:** Optimal substructure is a property of problems such that an overall (optimal) solution to the problem can be derived by finding out something about subproblems. diff --git a/docs/Optimizer.md b/docs/Optimizer.md @@ -2,7 +2,7 @@ ML P580 -## Notes + **Definition:** An optimizer is an algorithm to adjust the weights and biases of neural networks. diff --git a/docs/OracleComputer.md b/docs/OracleComputer.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** An oracle computer is a computer that can compute any computable problem. diff --git a/docs/OrderedSample.md b/docs/OrderedSample.md @@ -2,6 +2,6 @@ CH 1.3 -## Notes + **Definition:** An ordered sample is an outcome where the order of elements contributes to the uniqueness of the output. As such, an ordered sample is denoted using ordered pairs instead of a set as sets are innately unordered. diff --git a/docs/OrdinaryLeastSquares.md b/docs/OrdinaryLeastSquares.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** Ordinary least squares is a formula used to find the statistical line of best fit for some dataset where we are trying to minimize the square error. diff --git a/docs/OrthogonalComplement.md b/docs/OrthogonalComplement.md @@ -2,7 +2,7 @@ Khan U3 -## Notes + **Definition:** The orthogonal complement of a subspace is the subspace such that the dot product between any vectors (one from each subspace) are 0. diff --git a/docs/Orthonormal.md b/docs/Orthonormal.md @@ -2,7 +2,7 @@ U3 -## Notes + **Definition:** An orthonormal set is a set of linearly independent vectors that have been normalized (length = 1). diff --git a/docs/OutOfBag.md b/docs/OutOfBag.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Out of bag refers to samples that are not contained within a training sampling for a given predictor when using bagging/pasting. diff --git a/docs/OutOfOrderExecution.md b/docs/OutOfOrderExecution.md @@ -2,7 +2,7 @@ Computer Architecture L2 -## Notes + **Definition:** An optimization strategy that executes commands out of order to reduce the amount of clocks/time taken to complete computations. This is complex as it can be hard to determine if a command relies upon another command that came in earlier. diff --git a/docs/Overfitting.md b/docs/Overfitting.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Overfitting is when a model is trained on data and performs well on it but lacks the ability to generalize. diff --git a/docs/OverlappingSubproblems.md b/docs/OverlappingSubproblems.md @@ -2,6 +2,6 @@ L3 -## Notes + **Definition:** Overlapping subproblems is a property of a problem such that subproblems occur again and again meaning we are being more efficient by solving these subproblems than by trying to solve the original problem. diff --git a/docs/Oversmooothing.md b/docs/Oversmooothing.md @@ -2,7 +2,7 @@ Stats D3 -## Notes + **Definition:** Oversmoothing is the process of making the bandwidth of a kernel too large such that resulting visualizations smooth over important information. diff --git a/docs/PCA.md b/docs/PCA.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** PCA is a dimensionality reduction algorithm that finds a hyperplane that lies close to the data and then projects the data onto it. diff --git a/docs/PProblem.md b/docs/PProblem.md @@ -2,6 +2,6 @@ U 2.3 -## Notes + **Definition:** A P problem is a problem that can be both solved and verified in polynomial time. diff --git a/docs/PairwiseIndependence.md b/docs/PairwiseIndependence.md @@ -2,6 +2,6 @@ Ch 1.4 -## Notes + **Definition:** Pairwise independent events are two events such that the conditional probabilities of either are equivalent to the unconditioned probabilities. diff --git a/docs/PairwiseRelativelyPrime.md b/docs/PairwiseRelativelyPrime.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** Pairwise relatively primes are a set of numbers such that the gcd between any two numbers in the set is always 1. diff --git a/docs/PartialDerivative.md b/docs/PartialDerivative.md @@ -2,7 +2,7 @@ ML D2 -## Notes + **Definition:** The partial derivative is a derivative of a multivariate function with respect to a singular variable by considering the others as constants. diff --git a/docs/PartiallyObservableMarkovDecisionProcess.md b/docs/PartiallyObservableMarkovDecisionProcess.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** A partially observable markov decision process is a type of markov decision process where the agent doesn't have access to the entire current state. diff --git a/docs/PartiallyOrderedSet.md b/docs/PartiallyOrderedSet.md @@ -2,7 +2,7 @@ Ch 9.6 -## Notes + **Definition:** (S,R) is a partial ordered set (poset) if the relation R is reflexive, antisymmetrice, and transitive with respect to the set S. diff --git a/docs/ParticularSolution.md b/docs/ParticularSolution.md @@ -2,6 +2,6 @@ Ch 2.2 -## Notes + **Definition:** A particular solution to a set of linear equations are specific values that make all of the equalities of the system true. diff --git a/docs/Partition.md b/docs/Partition.md @@ -1,7 +1,7 @@ AM W14 Reading -## Notes + **Definition:** A partition of a set A is a set of non-empty subsets of A, such that the union of all the subsets equals A, and the intersection of any two different subsets is the null set. diff --git a/docs/PascalsIdentity.md b/docs/PascalsIdentity.md @@ -2,6 +2,6 @@ Ch 6.4 -## Notes + **Definition:** Pascal's identity is the idea that n+1 choose r is equivalent to n choose r plus n choose r-1. diff --git a/docs/PassiveAttacks.md b/docs/PassiveAttacks.md @@ -4,7 +4,7 @@ **Chapter:** 1.3 -## Notes + **Definition:** Passive attacks are attacks that monitor transmissions. diff --git a/docs/Pasting.md b/docs/Pasting.md @@ -2,6 +2,6 @@ ML D5 -## Notes + **Definition:** Pasting is the process of training multiple models of the same type on subsets of a dataset. This is different than bagging as pasting removes selected samples of the current subset subset from the current predictors options. This means the same predictor (model) can't be trained on the same sample twice, but different predictors may use some of the same samples. diff --git a/docs/Path.md b/docs/Path.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A path is a sequence of adjacent nodes where nodes can not be repeated. diff --git a/docs/Percentile.md b/docs/Percentile.md @@ -2,6 +2,6 @@ Khan -## Notes + **Definition:** Percentile is the percent of data that is below the specified amount or at or below the amount. diff --git a/docs/Perceptrons.md b/docs/Perceptrons.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Perceptrons are an artificial neural network architecture based on threshold logic untis (TLUs) or linear threshold units (LTUs). diff --git a/docs/PerfectNumbers.md b/docs/PerfectNumbers.md @@ -2,7 +2,7 @@ Math 310 -## Notes + **Definition:** Perfect numbers are numbers such that all divisors added up are equal to the number itself. diff --git a/docs/PeriodicChain.md b/docs/PeriodicChain.md @@ -2,7 +2,7 @@ L17 -## Notes + **Definition:** Periodic Markov chains are a specific type of Markov chain defined as a chain with groups such that all transitions frome one group lead to the next group. diff --git a/docs/PerlinNoise.md b/docs/PerlinNoise.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** Perlin noise is a procedural gradient texture generated using the perlin noise algorithm. diff --git a/docs/Permutation.md b/docs/Permutation.md @@ -2,7 +2,7 @@ CH 1.3 -## Notes + **Definition:** A permutation is an arrangement of elements length n. diff --git a/docs/PermutationMatrix.md b/docs/PermutationMatrix.md @@ -4,7 +4,7 @@ **Lecture:** 2 -## Notes + **Definition:** A permutation matrix is a matrix that when multiplied by exchanges rows of the other matrix. diff --git a/docs/Pictograph.md b/docs/Pictograph.md @@ -2,6 +2,6 @@ Khan -## Notes + **Definition:** A picture representation of statistics such as a chart, graph, or something else. diff --git a/docs/PigeonholePrinciple.md b/docs/PigeonholePrinciple.md @@ -2,6 +2,6 @@ Ch 6.2 -## Notes + **Definition:** The pigeonhole principle states that if there are n pigeons and z nests, if z is smaller than n there then must be at least one z such that z contains multiple pigeons. diff --git a/docs/PipelineControl.md b/docs/PipelineControl.md @@ -2,6 +2,6 @@ CA L3 -## Notes + **Definition:** Pipline control describes the management and coordinatei diff --git a/docs/Pipelining.md b/docs/Pipelining.md @@ -2,7 +2,7 @@ CA L3 -## Notes + **Definition:** Pipelining is the use of CPU hardware such that simultaneous execution of more than one instruction occurs at the same time. diff --git a/docs/PlaneToPlaneDistance.md b/docs/PlaneToPlaneDistance.md @@ -2,7 +2,7 @@ Khan -## Notes + See [[DistanceToPlane.md]] for distance from plane to point. diff --git a/docs/PoissonDistribution.md b/docs/PoissonDistribution.md @@ -2,7 +2,7 @@ Stats D1 -## Notes + **Definition:** A poisson distribution is a common distribution that gives the probability of something happening at a point in time (or position or volume) where the probability of it happening at any given time is known. diff --git a/docs/PoissonProcess.md b/docs/PoissonProcess.md @@ -2,7 +2,7 @@ Prob L14 -## Notes + **Definition:** A poisson process is a continous time version of the [[BernoulliProcess.md]]. diff --git a/docs/PolarCoordinates.md b/docs/PolarCoordinates.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** The polar coordinate system is a coordinate system where we define coordinates not by their distances but rather by the distance and also the angle theta made between the line segment and the origin. diff --git a/docs/Policy.md b/docs/Policy.md @@ -2,7 +2,7 @@ RL Ch 1 -## Notes + **Definition:** A policy in machine learning is a function from the current state to the action an agent will take. diff --git a/docs/PoolingLayers.md b/docs/PoolingLayers.md @@ -2,7 +2,7 @@ ML P762 -## Notes + **Definition:** Pooling layers are layers of a CNN that 'pool' together surrounding values to pass through a singular representative value. diff --git a/docs/Postcondition.md b/docs/Postcondition.md @@ -2,6 +2,6 @@ U 1.4.1 -## Notes + **Definition:** Postconditions are the expected outputs of a function or program which are predicated upon the specified [[Preconditions.md]]. diff --git a/docs/PosteriorProbability.md b/docs/PosteriorProbability.md @@ -2,6 +2,6 @@ Ch 1.6 -## Notes + **Definition:** Posterior probabilities are probabilities after some data has been collected/found/sampled (conditioned probability). diff --git a/docs/PowerSet.md b/docs/PowerSet.md @@ -2,7 +2,7 @@ AM Ch1 -## Notes + **Definition:** The power set is the set of all subesets of the input set. diff --git a/docs/Precision.md b/docs/Precision.md @@ -2,7 +2,7 @@ CH 3 -## Notes + **Definition:** The precision of a classifier (classification model) is the accuracy of positive predictions. diff --git a/docs/Preconditions.md b/docs/Preconditions.md @@ -2,6 +2,6 @@ U 1.4.1 -## Notes + **Definition:** Preconditions are necessarily specified inputs (or variables) to a function (or program) that are required prior to execution/evaluation. diff --git a/docs/Predicate.md b/docs/Predicate.md @@ -2,7 +2,7 @@ U 1.4.1 -## Notes + **Definition:** The predicate in a mathematical context is the part of a statement that gives us a truth value when variables are at play. diff --git a/docs/Prediction.md b/docs/Prediction.md @@ -2,7 +2,7 @@ Ch2 -## Notes + **Definition:** Prediction is the process of predicting an output given a sample. diff --git a/docs/Preimage.md b/docs/Preimage.md @@ -2,7 +2,7 @@ Khan Unit 2 -## Notes + **Definition:** The preimage of an image is the set of all values in the codomain such that their mappings are all in a specified image. This image may be the codomain or some other set. diff --git a/docs/PretrainedModels.md b/docs/PretrainedModels.md @@ -2,7 +2,7 @@ ML P570 -## Notes + **Definition:** Pretrained models are ML models that have been trained in the past and can be used for doing other things. diff --git a/docs/PrimeFactorization.md b/docs/PrimeFactorization.md @@ -2,7 +2,7 @@ U 2.4 -## Notes + **Definition:** The prime factorization of any given number is the multiplication of prime numbers that results in the number. diff --git a/docs/PrimeNumber.md b/docs/PrimeNumber.md @@ -2,7 +2,7 @@ U 2.4 -## Notes + **Definition:** A prime number is a number greater than 1 such that its only divisors are itself and 1. diff --git a/docs/PrincipleOfInclusionExclusion.md b/docs/PrincipleOfInclusionExclusion.md @@ -2,7 +2,7 @@ Ch 8.3 Rosen -## Notes + **Definition:** The principle of inclusion-exclusion is a principle used to count the number of elements in the union of a finite number of sets. diff --git a/docs/PriorProbability.md b/docs/PriorProbability.md @@ -2,6 +2,6 @@ Ch 1.6 -## Notes + **Definition:** Prior probabilities are probabilities prior to a conditional being applied to them (unconditioned probability). diff --git a/docs/ProbabilisticGraph.md b/docs/ProbabilisticGraph.md @@ -4,6 +4,6 @@ **Chapter:** 1 -## Notes + **Definition:** A probabilistic graph in ML is a graph that goes from input to output where each step is a probabilistic action being taken upon the inputs of the step. diff --git a/docs/Probability.md b/docs/Probability.md @@ -2,7 +2,7 @@ Stats CH1 -## Notes + **Definition:** The probability is the likelihood of something happening as a percentage between 0 and 1 or 0% and 100%. diff --git a/docs/ProbabilityDensityFunctions.md b/docs/ProbabilityDensityFunctions.md @@ -2,7 +2,7 @@ Stats ch1 -## Notes + **Definition:** A probability density function shows the probability of outcomes for [[ContinuousProbability.md]] problems. diff --git a/docs/ProbabilityLaw.md b/docs/ProbabilityLaw.md @@ -2,7 +2,7 @@ L1 -## Notes + **Definition:** The probability law assigns some set A (event) a nonnegative P(A) that describes the likelihood fo the elements of A. diff --git a/docs/ProbabilityMassFunction.md b/docs/ProbabilityMassFunction.md @@ -2,7 +2,7 @@ L4 -## Notes + **Definition:** A PMF describes the probability of some mapping of a [[RandomVariable.md]] from inputs to a specific output. diff --git a/docs/ProbingFunction.md b/docs/ProbingFunction.md @@ -2,7 +2,7 @@ Ch 5 -## Notes + **Definition:** A probing function is a function that takes in an ordered pair of inputs, the first which is a hashcode and the second which is the iteration and outputs a position between 0 and m-1. diff --git a/docs/ProductRule.md b/docs/ProductRule.md @@ -2,6 +2,6 @@ Leonard -## Notes + **Definition:** The product rule is used when taking the derivative of two functions that are multiplied together. The rule is as follows $\frac{d}{dx}(g(x)f(x)) = g'(x)f(x) + f'(x)g(x)$ diff --git a/docs/Prognosticator.md b/docs/Prognosticator.md @@ -2,6 +2,6 @@ Superintelligence - Bostrom -## Notes + **Definition:** A prognosticator is someone who tells of the future. diff --git a/docs/ProgrammerVisibleState.md b/docs/ProgrammerVisibleState.md @@ -2,7 +2,7 @@ CA L3 -## Notes + **Definition:** Programmer visible state is all state of program execution that is visible to programs. diff --git a/docs/Proposition.md b/docs/Proposition.md @@ -2,6 +2,6 @@ Discrete 1.1 -## Notes + **Definition:** A proposition is a statement that is either true or false. diff --git a/docs/PropositionalFunction.md b/docs/PropositionalFunction.md @@ -2,7 +2,7 @@ U 1.4.1 -## Notes + **Definition:** A propositional function is a function that takes an arbitrary number of inputs and outputs a truth value. diff --git a/docs/ProveSetEquality.md b/docs/ProveSetEquality.md @@ -2,6 +2,6 @@ AM TB Ch8 -## Notes + To prove that two sets are equivalent (A and B), we first prove that A contains B. We then show that B also contains A thus all elements must be the same making the sets equivalent. Equivalence of sets is done using the = sign not the $\equiv$ sign. diff --git a/docs/PseudoGraphs.md b/docs/PseudoGraphs.md @@ -2,6 +2,6 @@ Ch 10.1 -## Notes + **Definition:** A pseudo graph is a graph that allows multi edges and loops, but is directed. diff --git a/docs/QuadraticProbing.md b/docs/QuadraticProbing.md @@ -2,7 +2,7 @@ Ch 5 -## Notes + **Definition:** Quadratic probing is a probing strategy where we start with the input and then alternately move right and left by successive perfect squares. diff --git a/docs/Quantifiers.md b/docs/Quantifiers.md @@ -2,7 +2,7 @@ U 1.4.2 -## Notes + **Definition:** Quantifiers are operators that describe the number of individuals in a domain that satisfy something. diff --git a/docs/Quantile.md b/docs/Quantile.md @@ -2,7 +2,7 @@ Stats D3 -## Notes + **Definition:** Quantiles are logic divisions in a dataset to classify certain information. diff --git a/docs/Quaternions.md b/docs/Quaternions.md @@ -2,7 +2,7 @@ CS 331 W11 L2 -## Notes + **Definition:** These are four values that describe something which can be stated as (x,y,z,w). In Unity, quaternions are used to describe rotations about axis. diff --git a/docs/Queue.md b/docs/Queue.md @@ -2,7 +2,7 @@ CS202 L14 / CS303 Ch 1 -## Notes + **Definition:** This is a datatype that works on a first in first out basis. This is often implemented using a [[SinglyLinkedList.md]] with a link to the tail (where more nodes would be added). This is also often implemented such that you add to the end and remove from the start. diff --git a/docs/RCombination.md b/docs/RCombination.md @@ -2,7 +2,7 @@ Ch 6.3 -## Notes + **Definition:** An r-Combination is a combination of length r. diff --git a/docs/RMSE.md b/docs/RMSE.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** This is the most common form of error measuring for regression problems where you take the difference between each inference and the actual output, square it, do this with all samples, divide by the number of samples, and then take the square root. diff --git a/docs/ROC.md b/docs/ROC.md @@ -2,7 +2,7 @@ ML D3 -## Notes + **Definition:** The ROC curve plots the rate of true positives for a dataset against the rate of false positives as the decision threshold changes. diff --git a/docs/RPermutation.md b/docs/RPermutation.md @@ -2,7 +2,7 @@ TB 6.3 -## Notes + **Definition:** r-Permutations are permutations that have a lenght of r. diff --git a/docs/RadialBasisFunction.md b/docs/RadialBasisFunction.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** A radial basis function is a function whose values depend only on the distance between the input and some fixed point. diff --git a/docs/RamseyNumbers.md b/docs/RamseyNumbers.md @@ -2,6 +2,6 @@ Ch 6.2 -## Notes + **Definition:** A Ramsey number R(m,n) where m,n are natural numbers and n is greater than or equal to 2, is the minimum number of people at a party such that there are either m mutual friends or n mutual enemies. diff --git a/docs/RandomExperiment.md b/docs/RandomExperiment.md @@ -2,7 +2,7 @@ Ch 1.1 -## Notes + **Definition:** A random experiment is a specified set of procedures that result in a truly random outcome (not necessarily uniformly) in the sample space. diff --git a/docs/RandomForest.md b/docs/RandomForest.md @@ -2,7 +2,7 @@ ML D4 -## Notes + **Definition:** A random forest is an [[Ensembles.md]] of [[DecisionTrees.md]] used to make predictions based on majority voting or some other cost function. diff --git a/docs/RandomPatches.md b/docs/RandomPatches.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** The random patches method for random sampling uses bagging (sometimes pasting) as well as selecting a random subset of features. diff --git a/docs/RandomProjection.md b/docs/RandomProjection.md @@ -1,6 +1,6 @@ # Random Projection -## Notes + **Definition:** Random projection is an algorithm that selects dimensions at random to project onto. diff --git a/docs/RandomSubspaces.md b/docs/RandomSubspaces.md @@ -2,6 +2,6 @@ ML D5 -## Notes + **Definition:** The random subspaces method is similar to [[RandomPatches.md]] except it keeps all training instances and only samples features. diff --git a/docs/RandomVariables.md b/docs/RandomVariables.md @@ -2,7 +2,7 @@ L4 + Khan -## Notes + **Definition:** Random variables in stats and probability are functions that map processes to outcomes that depend on random events. diff --git a/docs/Range.md b/docs/Range.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The range of a function is the set of all possible outputs of the function given the domain of the function. diff --git a/docs/Rank.md b/docs/Rank.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** Rank, similar to [Nullity](Nullity.md), is a way to describe the dimensionallity of the vector space generated by the columns of a matrix. diff --git a/docs/RealVectorSpace.md b/docs/RealVectorSpace.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** A real vector space is a [Vector Space](VectorSpace.md) on $R$ where $R$ is the set of real numbers. diff --git a/docs/RecencyHeuristic.md b/docs/RecencyHeuristic.md @@ -2,7 +2,7 @@ L4 -## Notes + **Definition:** The recency heuristic is a solution to the credit assignment problem where we assign credit to reward/punishment to the most recent state(s). diff --git a/docs/RecurrenceRelation.md b/docs/RecurrenceRelation.md @@ -2,7 +2,7 @@ U2.4.2 -## Notes + **Definition:** A recurrence relation is an equation that expresses some a_n in terms of one or more prior terms from the sequence. As such, we must specify initial conditinos such that the sequence can be calculated (think basecase). diff --git a/docs/ReducedRowEchelonForm.md b/docs/ReducedRowEchelonForm.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** Reduced row echelon form is a form of matrix where each row has a 1 after the zeoes that are all on the left side of the one. Additionally, each row above another row must have its 1 further to the left than the prior one, and all values to the right of the one should be zeroes if possible. diff --git a/docs/Reflexive.md b/docs/Reflexive.md @@ -2,6 +2,6 @@ Ch 9.1 -## Notes + **Definition:** A reflexive relation is a relation that is always true for an ordered pair where both elements are the same. diff --git a/docs/ReflexiveClosure.md b/docs/ReflexiveClosure.md @@ -2,7 +2,7 @@ Ch 9.4 -## Notes + **Definition:** A reflexive closure is a closure of a relation with respect to some property such that xRx for all x=x. diff --git a/docs/RegressionProblem.md b/docs/RegressionProblem.md @@ -2,7 +2,7 @@ ML L1 -## Notes + **Definition:** A regression problem is a problem where the value trying to be predicted is continuous (think graphing not yes/no). diff --git a/docs/RegressionToTheMean.md b/docs/RegressionToTheMean.md @@ -2,6 +2,6 @@ L19 -## Notes + **Definition:** Regression to the mean is the idea that if an unlikely event occurs it is likely the next sampling will be closer to the mean of the distribution. diff --git a/docs/RegularLanguages.md b/docs/RegularLanguages.md @@ -4,6 +4,6 @@ **Lecture:** 1 -## Notes + **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/Relation.md b/docs/Relation.md @@ -2,7 +2,7 @@ CH 9.1 -## Notes + **Definition:** A relation, in math, is a way to describe a connection between elements in the codomain and domain. diff --git a/docs/RelationOnASet.md b/docs/RelationOnASet.md @@ -2,7 +2,7 @@ Ch 9.1 -## Notes + **Definition:** A relation on a set is a relation where the domain and the codomain are the same set. diff --git a/docs/RelativeFrequency.md b/docs/RelativeFrequency.md @@ -2,7 +2,7 @@ Ch 1.1 -## Notes + **Definition:** Relative frequency is the value f/n where f is the [[Frequency.md]] of an event under a [[RandomExperiment.md]]. diff --git a/docs/RelativelyPrime.md b/docs/RelativelyPrime.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** Relatively prime numbers are prime numbers such that gcd(a,b) = 1. diff --git a/docs/RepresentationLearning.md b/docs/RepresentationLearning.md @@ -2,7 +2,7 @@ ML P722 -## Notes + **Definition:** Representation learning is the iterative process of learning a representation of some value. diff --git a/docs/Representative.md b/docs/Representative.md @@ -2,7 +2,7 @@ Ch 9.5 -## Notes + **Definition:** A representative is any element of an equivalence class chosen to describe the class. diff --git a/docs/Return.md b/docs/Return.md @@ -2,6 +2,6 @@ L2 -## Notes + **Definition:** Return is the sum of future rewards taking into account discount factor. diff --git a/docs/RewardSignal.md b/docs/RewardSignal.md @@ -2,7 +2,7 @@ RL Ch 1 -## Notes + **Definition:** The reward signal is a one time signal sent to an agent telling them that the something right now is good. diff --git a/docs/RidgeRegression.md b/docs/RidgeRegression.md @@ -2,7 +2,7 @@ ML D3 -## Notes + **Definition:** Ridge regression uses a different cost function than standard linear regression to limit the size of coefficients. diff --git a/docs/RightHandRule.md b/docs/RightHandRule.md @@ -2,7 +2,7 @@ 3B1B -## Notes + **Definition:** The right hand rule describes the relation between the axis components in R^3. diff --git a/docs/Rotate.md b/docs/Rotate.md @@ -2,7 +2,7 @@ CS331 W12 L2 -## Notes + Rotate is a function of the Transform class that allows rotation relative to the local rotation. diff --git a/docs/Rotation.md b/docs/Rotation.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** A rotation is a linear transformation (assuming the rotation axis passes through the zero vector) that rotates about some axis theta degrees **counter clockwise**. diff --git a/docs/RowBuffer.md b/docs/RowBuffer.md @@ -1,6 +1,6 @@ # Row Buffer -## Notes + **Definition:** The row buffer is the buffer used to cache a row that is from [[DRAM.md]]. This is used because it is 2-3 times more efficient to query a buffered memory address than it is to query for a new row in memory. This is handled by the DRAM memory controller. diff --git a/docs/RowEchelonForm.md b/docs/RowEchelonForm.md @@ -2,7 +2,7 @@ Ch 2.2 -## Notes + **Definition:** Row echelon form is a form such that all rows have more than or the same number of 0's starting from the left side as the row above them. diff --git a/docs/RuleLearning.md b/docs/RuleLearning.md @@ -3,7 +3,7 @@ ML CH1 -## Notes + **Definition:** Rule learning is the process of taking in lots of data and finding associations between data. diff --git a/docs/RuleOfSarrus.md b/docs/RuleOfSarrus.md @@ -2,7 +2,7 @@ Khan U2 -## Notes + **Definition:** The rule of Sarrus is a shortcut for finding the determinant of a 3x3 matrix. diff --git a/docs/Rvalue.md b/docs/Rvalue.md @@ -2,7 +2,7 @@ cs202 W14 L16 -## Notes + **Definition:** An rvalue is a temporary value that can be moved. diff --git a/docs/SMOTE.md b/docs/SMOTE.md @@ -2,7 +2,7 @@ ML P775 -## Notes + **Definition:** SMOTE is the process of manipulating minority samples in the dataset to increase their representation and improve a model's classification of them. diff --git a/docs/SVM.md b/docs/SVM.md @@ -2,7 +2,7 @@ ML D3 -## Notes + **Definition:** Support vector machines are models that create lines to separate different outputs by drawing lines between them leaving as much space possible between the different classes. They also have edges to the "street" where there is a line up the middle and these edges are only affected by instances located on the edge of the street and not by instances far off. These are the support vectors. diff --git a/docs/SampleSpace.md b/docs/SampleSpace.md @@ -2,7 +2,7 @@ L1 -## Notes + **Definition:** The sample space is the space of all possible outcomes of a random experiment. diff --git a/docs/Satisfiable.md b/docs/Satisfiable.md @@ -2,7 +2,7 @@ 1.3.5 -## Notes + **Definition:** A proposition is satisfiable if there is some assignment of truth values to its variables such that the outcome is true. diff --git a/docs/Scheduling.md b/docs/Scheduling.md @@ -1,5 +1,5 @@ # Scheduling -## Notes + CPU Scheduling is done on the OS level and is generally simply about the clocks given. This can cause issues with [[DRAM.md]] because the DRAM controller prioritizes requests associated with buffered rows of memory meaning that even if two processes have the same priority they will not necessarily get the same access to memory because of optimizations done in the DRAM controller. diff --git a/docs/Script.md b/docs/Script.md @@ -2,7 +2,7 @@ CS 331 W12 L3 -## Notes + **Definition:** Scripts are where custom code can be added to accompany gameobjects they are associated with. diff --git a/docs/Segmentation.md b/docs/Segmentation.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Segmentation in machine learning is the process of breaking up a large group into smaller ones. diff --git a/docs/SelfSupervisedLearning.md b/docs/SelfSupervisedLearning.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Self-supervised learning is the process of chaning input data and the model predicting the output where the output is known to it. diff --git a/docs/SemiSupervisedLearning.md b/docs/SemiSupervisedLearning.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** This is training a model with some labeled and some unlabeled data. diff --git a/docs/SentinelValue.md b/docs/SentinelValue.md @@ -2,7 +2,7 @@ CS202 (personal learning) -## Notes + **Definition:** A sentinel value is a constant value used to end an execution loop. diff --git a/docs/Sequence.md b/docs/Sequence.md @@ -2,7 +2,7 @@ U2.4.1 -## Notes + **Definition:** Sequences are ordered lists mapped to by the integers. diff --git a/docs/Set.md b/docs/Set.md @@ -2,7 +2,7 @@ U 2.1.1 -## Notes + **Definition:** A set is an unordered list of elements. diff --git a/docs/SetFunction.md b/docs/SetFunction.md @@ -2,7 +2,7 @@ Stats CH1 -## Notes + **Definition:** A set function is a function defined as u : X -> Y where X is a collection of sets and Y is anything. diff --git a/docs/SharedPointers.md b/docs/SharedPointers.md @@ -4,7 +4,7 @@ **Chapter:** N/A -## Notes + **Definition:** A shared pointer is a pointer that keeps a reference counter so when the final reference to it goes out of scope, the memory will be freed. diff --git a/docs/Shear.md b/docs/Shear.md @@ -2,7 +2,7 @@ 3B1B -## Notes + **Definition:** A shear is a type of linear transformation where one axis is 'slid' while the other reamins the same. diff --git a/docs/SignedExtension.md b/docs/SignedExtension.md @@ -2,7 +2,7 @@ W1 -## Notes + **Definition:** Signed extension is used to extend the size of a signed value. diff --git a/docs/SimilarityFeature.md b/docs/SimilarityFeature.md @@ -2,7 +2,7 @@ ML 4 -## Notes + **Definition:** A similarity feature is an added feature that describes how similar some feature is to a particular landmark. This value generally ranges from 1 being the same to nearly or exactly 0 (depending on RBF used) being entirely different. diff --git a/docs/SimpsonsParadox.md b/docs/SimpsonsParadox.md @@ -2,7 +2,7 @@ Ch 1.1 -## Notes + **Definition:** Simpson's paradox is the seeming paradox that some outcome can be overall more common despite all individual cases making it seem less likely. diff --git a/docs/SingleKey.md b/docs/SingleKey.md @@ -4,7 +4,7 @@ **Chapter:** 1.6 -## Notes + **Definition:** Single key cryptography is data transformation that uses only a singular key in the transformation process. diff --git a/docs/SinglyLinkedList.md b/docs/SinglyLinkedList.md @@ -2,7 +2,7 @@ CS 221 W11 Lecture 13. -## Notes + **Definition:** Singly linked lists are lists that only contain pointers to the next item in the list. This is in contrast with [[DoublyLinkedList.md]] which have a pointer forward and backward. diff --git a/docs/Singular.md b/docs/Singular.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** For a matrix to be singular it must be a square matrix with a deteminant of zero. diff --git a/docs/Singularity.md b/docs/Singularity.md @@ -2,6 +2,6 @@ Superintelligence - Bostrom -## Notes + **Definition:** The singularity is a future point in time where tech growth becomes uncontrollable and irreversible. diff --git a/docs/SkeletalAnimation.md b/docs/SkeletalAnimation.md @@ -2,7 +2,7 @@ CG W14 L2 -## Notes + **Definition:** The animation of bones. diff --git a/docs/SmallestCounterExample.md b/docs/SmallestCounterExample.md @@ -2,7 +2,7 @@ Abstract Math 10.3. This is similar to [[Induction.md]] and [[StrongInduction.md]] -## Notes + **Definition:** Assume that the first element of a series is true and that not all other elements of the series are also true. We find the first element that is untrue denoted as $S_k$ and show that $S_{k-1}$ being true and $S_k$ being untrue is contradictory. diff --git a/docs/SoftmaxRegression.md b/docs/SoftmaxRegression.md @@ -2,7 +2,7 @@ ML D3 -## Notes + **Definition:** Softmax regression is the process of running linear regression for k classes for a sample and then using the softmax function to determine the probability of it being a member of each class. diff --git a/docs/Span.md b/docs/Span.md @@ -4,7 +4,7 @@ **Chapter:** 2 -## Notes + **Definition:** The span of (v_1, ..., v_m) is the set of all [Linear Combination](LinearCombination.md) of (v_1, ..., v_m). diff --git a/docs/Sparse.md b/docs/Sparse.md @@ -2,7 +2,7 @@ Ch 4 -## Notes + **Definition:** A sparse matrix is a matrix mostly containing zeroes. diff --git a/docs/Stack.md b/docs/Stack.md @@ -2,7 +2,7 @@ CS202 L14 / CS303 Ch 1 -## Notes + **Definition:** This is a data structure that uses the lifo approach where you add to the top and remove from the top of the struct. diff --git a/docs/Stacking.md b/docs/Stacking.md @@ -2,7 +2,7 @@ ML D5 -## Notes + **Definition:** Stacking is the idea that we should create a dedicated model to act as a voting machine for an ensemble of predictive models. diff --git a/docs/StandardBasis.md b/docs/StandardBasis.md @@ -4,6 +4,6 @@ **Chapter:** 2 -## Notes + **Definition:** The standard basis is the [Basis Of Subspace](BasisOfSubspace.md) where each vector is made up of all 0's and one 1. diff --git a/docs/StandardDeviation.md b/docs/StandardDeviation.md @@ -2,7 +2,7 @@ Stats D2 -## Notes + **Definition:** This is the average difference between each value in a dataset and the mean of the dataset. diff --git a/docs/StandardMatrix.md b/docs/StandardMatrix.md @@ -2,6 +2,6 @@ Khan U2 -## Notes + **Definition:** The standard matrix of a linear transformation is the matrix we multiply the input of the function by to obtain the mapping of the input. diff --git a/docs/Standardization.md b/docs/Standardization.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** Standardization is the process of scaling values such that the value is equivalent to itself subtracing the mean and dividing by the standard deviation. diff --git a/docs/StateAnalysis.md b/docs/StateAnalysis.md @@ -2,7 +2,7 @@ Ch 3 -## Notes + **Definition:** State analysis, in the context of algorithms, is a strategy for computing the time complexity of an algorithm that analyzes the current state of the algorithm instead of describing each line of code and their associated complexity which becomes unruly as algorithms become more complex. diff --git a/docs/StatisticalInference.md b/docs/StatisticalInference.md @@ -2,6 +2,6 @@ Ch 1.1 -## Notes + **Definition:** Statistical inference is the process of using statistical findings to make predictions about future events (emphasis on future). diff --git a/docs/StemAndLeafPlot.md b/docs/StemAndLeafPlot.md @@ -2,6 +2,6 @@ Khan -## Notes + **Definition:** In a stem and leaf plot we have the left side where there is a stem and the right side where there is a leaf. The stem is the base value, as an example 1 and the right is a list of instances where the variable is some value in the range as an example 9. This element would mean there was some instance with a value of 19. diff --git a/docs/StirlingsFormula.md b/docs/StirlingsFormula.md @@ -2,6 +2,6 @@ Ch 3 -## Notes + **Definition:** Stirling's formula is a closed form approximation for factorials. diff --git a/docs/StochasticAlgorithm.md b/docs/StochasticAlgorithm.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** A stochastic algorithm is an optimization algorithm that uses randomness. diff --git a/docs/StratifiedSampling.md b/docs/StratifiedSampling.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** Stratified sampling is the process of selecting samples based on the likelihood of samples being from strata. diff --git a/docs/String.md b/docs/String.md @@ -2,7 +2,7 @@ W2 -## Notes + **Definition:** A string is a collection of ordered characters. diff --git a/docs/StrongAI.md b/docs/StrongAI.md @@ -2,6 +2,6 @@ Superintelligence - Bostrom -## Notes + **Definition:** Strong AI is an AI system that has very broad intelligence. diff --git a/docs/Subgraph.md b/docs/Subgraph.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A subgraph of G(V,E) is a graph H(W,F) such that W is in V and F is in E. diff --git a/docs/Subsequence.md b/docs/Subsequence.md @@ -2,6 +2,6 @@ Ch 6.2 -## Notes + **Definition:** A subsequence is a selection, or all, elements of a sequence kept in order. diff --git a/docs/Subset.md b/docs/Subset.md @@ -2,7 +2,7 @@ U 2.1.2 -## Notes + **Definition:** The set A is a subset of B which means all elements of A are in B. diff --git a/docs/Subspace.md b/docs/Subspace.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + ### Linear Algebra Context diff --git a/docs/SubtractionRule.md b/docs/SubtractionRule.md @@ -2,6 +2,6 @@ Ch 6.1 -## Notes + **Definition:** The subtraction rule (inclusion-exclusion principle) is the idea that the cardinality of the union of two sets is the individual cardinalities minus the elements in both sets (ensure not double counting). diff --git a/docs/SumOfGeometricSeries.md b/docs/SumOfGeometricSeries.md @@ -2,7 +2,7 @@ Ch 6.1 -## Notes + **Definition:** The sum of the geometric series is the formula to solve a sequence of the form ab^0 + ab^1 .... ab^n. diff --git a/docs/SumOfVectorSpaces.md b/docs/SumOfVectorSpaces.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** The sum of two vector spaces is another vector space which is formed by all sums of vectors in both spaces (think combining each vector with every other vector). diff --git a/docs/SumRule.md b/docs/SumRule.md @@ -2,7 +2,7 @@ Ch 6.1 -## Notes + **Definition:** The sum rule states that the total number of possible choices is the sum of all choices. diff --git a/docs/SuperScalar.md b/docs/SuperScalar.md @@ -2,6 +2,6 @@ Computer Architecture L2 -## Notes + **Definition:** Execute multiple instructions per cycle. diff --git a/docs/SupervisedLearning.md b/docs/SupervisedLearning.md @@ -2,7 +2,7 @@ ML L1 -## Notes + **Definition:** Training a model by giving it inputs and valid associated outputs. diff --git a/docs/SupportVectorMachine.md b/docs/SupportVectorMachine.md @@ -2,6 +2,6 @@ ML L1 -## Notes + **Definition:** Algorithm that allows for an infinite dimensional vector as an input. diff --git a/docs/SurfaceRepresentation.md b/docs/SurfaceRepresentation.md @@ -2,7 +2,7 @@ CS 331 W11 L2 -## Notes + **Definition:** Modelling the surface of a continuous object in a discrete computing environment. diff --git a/docs/Surjective.md b/docs/Surjective.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** For a function to be surjective each value in the codomain must be mapped to at least once. diff --git a/docs/Symmetric.md b/docs/Symmetric.md @@ -2,7 +2,7 @@ Ch 9.1 -## Notes + **Definition:** A symmetric relation is a relation such that if xRy then yRx for all (x,y). diff --git a/docs/SymmetricClosure.md b/docs/SymmetricClosure.md @@ -2,6 +2,6 @@ Ch 9.4 -## Notes + **Definition:** A symmetric closure is the closure of some relation under some property such that if xRy then yRx. diff --git a/docs/SymmetricMatrix.md b/docs/SymmetricMatrix.md @@ -2,7 +2,7 @@ Ch 2.2 -## Notes + **Definition:** A symmetric matrix is a matrix whereby A = A^T. diff --git a/docs/SystemsOfEquations.md b/docs/SystemsOfEquations.md @@ -2,6 +2,6 @@ Khan -## Notes + **Defintition:** Systems of equations are sets of equations that are to be solved together. diff --git a/docs/TargetEncoding.md b/docs/TargetEncoding.md @@ -2,7 +2,7 @@ ML CH2 -## Notes + **Definition:** Target encoding is the process of mapping some feature to a representative value that is calculated. diff --git a/docs/Task.md b/docs/Task.md @@ -2,7 +2,7 @@ Ch 0 -## Notes + **Definition:** A task is a function from I to O where I is the set of all valid inputs and O is the set of all valid outputs. diff --git a/docs/Tautology.md b/docs/Tautology.md @@ -2,7 +2,7 @@ 1.3.1 -## Notes + **Definition:** A tautology is a statement that is always true. diff --git a/docs/TemporalDifferenceLearning.md b/docs/TemporalDifferenceLearning.md @@ -2,7 +2,7 @@ L4 -## Notes + **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. diff --git a/docs/Tensor.md b/docs/Tensor.md @@ -2,7 +2,7 @@ ML P626 -## Notes + **Definition:** A tensor is a multidimensional array of any dimensionallity. diff --git a/docs/Texture.md b/docs/Texture.md @@ -2,7 +2,7 @@ CS 331 W11 Lecture 2 -## Notes + **Definition:** The texture of an object is it's surface and how it looks. diff --git a/docs/TimeComplexity.md b/docs/TimeComplexity.md @@ -2,6 +2,6 @@ Ch 2 -## Notes + **Definition:** Let A be an algorithm. The worst case, best case, or average case time complexity of A is the function f: N->N where f(n) is the max, min, or average number of instructions executed by the algorithm for all inputs of size n bytes. diff --git a/docs/TotalProbabilityTheroem.md b/docs/TotalProbabilityTheroem.md @@ -2,7 +2,7 @@ L2 -## Notes + **Definition:** Total probability theorem states that the probability of some event is equal to the summed probability of each possible way for the event to occur. diff --git a/docs/Tractable.md b/docs/Tractable.md @@ -2,7 +2,7 @@ U 2.3 -## Notes + **Definition:** A tractable problem is a problem that can be solved in polynomial time (reasonable amount of time). diff --git a/docs/TransferLearning.md b/docs/TransferLearning.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Transfer learning is the process of transferring knowledge from one task to another. diff --git a/docs/Transformations.md b/docs/Transformations.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** Transoformations are functions that take an input vector and output another vector. diff --git a/docs/Transitive.md b/docs/Transitive.md @@ -2,6 +2,6 @@ Ch 9.1 -## Notes + **Definition:** A transitive relation holds the transitive property namely that if xRy and yRz then xRz for all x,y,z. diff --git a/docs/TransitiveClosure.md b/docs/TransitiveClosure.md @@ -2,7 +2,7 @@ Ch 9.4 -## Notes + **Definition:** A transitive closure is the closure of a relation under some property such that each element where there is a path from one to another is directly connected. diff --git a/docs/Translate.md b/docs/Translate.md @@ -2,7 +2,7 @@ CS331 W12 L2 -## Notes + This is a method of Unity's Transform class that moves the GameObject by the distance specified with respect to the local coordinate system. diff --git a/docs/Transpose.md b/docs/Transpose.md @@ -2,7 +2,7 @@ ML P627 -## Notes + **Definition:** The transpose of a matrix is the matrix flipped over the diagnol by switching the rows and columns. diff --git a/docs/Tree.md b/docs/Tree.md @@ -2,8 +2,6 @@ Abstract Math and CS202 -## Notes - **Definition:** Trees are connected graphs without cycles. There is no implication about split numbers or anything of the sort, but something interesting is that in all cases it must be true that the number of edges is one less than the number of vertices. This can be proved through [[StrongInduction.md]]. diff --git a/docs/TreeDiagram.md b/docs/TreeDiagram.md @@ -2,7 +2,7 @@ Ch 6.1 -## Notes + **Definition:** A tree diagram is a diagram that shows all possible choices (outcomes) along with their branching. diff --git a/docs/Trichotomy.md b/docs/Trichotomy.md @@ -2,7 +2,7 @@ CLRS 3.2 -## Notes + **Definition:** Trichotomy is a property of real numbers such that for any two real numbers one of the following must be true: diff --git a/docs/TripleProductExpansion.md b/docs/TripleProductExpansion.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** The triple product expansion states the combined cross product of three vectors a x (b x c) = b(a dot c) - c(a dot b) diff --git a/docs/TruePositiveRate.md b/docs/TruePositiveRate.md @@ -2,7 +2,7 @@ ML CH3 -## Notes + **Definition:** This is the ratio of positive instances that are correctly classified. diff --git a/docs/Trust.md b/docs/Trust.md @@ -4,6 +4,6 @@ **Chapter:** 1.8 -## Notes + **Definition:** Trust is one's willingness to be vulnerable to the actions of another party based on the expectation the other party will perform an action important to the truster without necessarily being able to monitor or control the other party. diff --git a/docs/TruthSet.md b/docs/TruthSet.md @@ -2,6 +2,6 @@ U 2.1.2 -## Notes + **Definition:** The truth set of a function P(x) is the set of all elements of the domain such that P(x) is true. diff --git a/docs/Tuple.md b/docs/Tuple.md @@ -2,7 +2,7 @@ Ch 1 -## Notes + **Definition:** A tuple is an ordered list of elements (like a set but ordered). diff --git a/docs/TwoKey.md b/docs/TwoKey.md @@ -4,7 +4,7 @@ **Chapter:**1.6 -## Notes + **Definition:** Two key cryptography is data transformation where there are two different keys involved in the process. diff --git a/docs/TwosComplement.md b/docs/TwosComplement.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** Two's complement is an implementation of negative numbers where a leading one and flipped bits are used to represent negative numbers. diff --git a/docs/UVMaps.md b/docs/UVMaps.md @@ -2,7 +2,7 @@ CG W13 L1 -## Notes + **Definition:** A UV map is a function that takes a mesh and returns an image. This describes how to "color in" the mesh. diff --git a/docs/UnaryOperations.md b/docs/UnaryOperations.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** Unary operations are operations that only take one input. diff --git a/docs/Underfitting.md b/docs/Underfitting.md @@ -2,7 +2,7 @@ ML CH1 -## Notes + **Definition:** Using a model that is too simple to learn the underlying structure of data. diff --git a/docs/Undersmoothing.md b/docs/Undersmoothing.md @@ -2,6 +2,6 @@ Stats D3 -## Notes + **Definition:** Undersmoothing is when a bandwidth value that is too small is selected for the kernel bandwidth of a kde and by doing this is overfits the dataset. diff --git a/docs/Unicode.md b/docs/Unicode.md @@ -2,6 +2,6 @@ W2 -## Notes + **Definition:** Unicode is a character encoding systems that uses two bytes to represent almost all characters across languages. diff --git a/docs/UniquePointers.md b/docs/UniquePointers.md @@ -4,7 +4,7 @@ **Chapter:** N/A -## Notes + **Definition:** A unique pointer in c++ is a pointer that can not be copied and once out of scope, automatically deallocates associated memory. diff --git a/docs/UnitVector.md b/docs/UnitVector.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** A unit vector is any vector with length of 1. diff --git a/docs/Unity.md b/docs/Unity.md @@ -2,7 +2,7 @@ Unity is a popular game engine, no duh. -## Notes + ### General Stuff diff --git a/docs/UniversalSet.md b/docs/UniversalSet.md @@ -2,6 +2,6 @@ L1 -## Notes + **Definition:** The universal set either denoted by U or Omega is the set of all objects that are of interest in a particular context. diff --git a/docs/Universe.md b/docs/Universe.md @@ -2,7 +2,7 @@ U 1.4.1 -## Notes + **Definition:** The universe in math is the set of all objects that bear consideration. diff --git a/docs/Unsolvable.md b/docs/Unsolvable.md @@ -2,7 +2,7 @@ U 2.3 -## Notes + **Definition:** Unsolvable problems are problems that can't be solved in even exponential time. diff --git a/docs/UnstableGradients.md b/docs/UnstableGradients.md @@ -2,7 +2,7 @@ ML 550 -## Notes + **Definition:** Unstable gradients are the idea that different layers of a neural network can learn at widely different rates. diff --git a/docs/UnsupervisedLearning.md b/docs/UnsupervisedLearning.md @@ -2,7 +2,7 @@ ML L1 -## Notes + **Definition:** Given a dataset with no labels, find some structure in the underlying data. diff --git a/docs/UnsupervisedPretraining.md b/docs/UnsupervisedPretraining.md @@ -2,7 +2,7 @@ ML P576 -## Notes + **Definition:** Unsupervised pretraining is the process of pretraining a model on unlabeled data and then adding layers on top of the model using labelled data to get predictions. diff --git a/docs/UtilityFunction.md b/docs/UtilityFunction.md @@ -2,6 +2,6 @@ Ch 1 -## Notes + **Definition:** A utility function is a function from E -> R where E is the set of events, R is the set of real numbers, and the mapping describes how good the event is. diff --git a/docs/VacuousProof.md b/docs/VacuousProof.md @@ -2,6 +2,6 @@ U 1.7 -## Notes + **Definition:** A vacuous proof is for proofs of the form if p then q where we then show that p is always false thus there is no need to evaluate for q. diff --git a/docs/ValueFunction.md b/docs/ValueFunction.md @@ -2,7 +2,7 @@ RL Ch 1 -## Notes + **Definition:** The value function describes the overall expected reward for an agent. diff --git a/docs/VandermondesIdentity.md b/docs/VandermondesIdentity.md @@ -2,7 +2,7 @@ Ch 6.4 -## Notes + **Definition:** Vandermonde's identity is an identity that describes n+m choose k as a sum of all ways to select 0 of one and k of the other 1 of one and k-1 of the other and so on. diff --git a/docs/VanishingGradients.md b/docs/VanishingGradients.md @@ -2,7 +2,7 @@ ML 550 -## Notes + **Definition:** Vanishing gradients is a neural network problem where lower levels (earlier hidden layers) have such small gradients that gradient steps make tiny changes and the model never converges upon an a good solution. diff --git a/docs/Variables.md b/docs/Variables.md @@ -2,6 +2,6 @@ Khan -## Notes + **Definition:** Variables are characteristics that can in some way be measure, counted, or categorized. diff --git a/docs/VariadicOperations.md b/docs/VariadicOperations.md @@ -2,7 +2,7 @@ SS -## Notes + **Definition:** Variadic operations are operations that can take a varying number of inputs. diff --git a/docs/Vector.md b/docs/Vector.md @@ -1,6 +1,6 @@ # Vector (C++) -## Notes + **Definition:** Vectors in c++ are dynamically allocated arrays that use the heap instead of the stack. diff --git a/docs/Vector3.md b/docs/Vector3.md @@ -2,7 +2,7 @@ CS 331 W12 L3 -## Notes + **Definition:** The Vector3 class in unity is used to represent x,y, and z coordinates in a singular object. This object stores each axis value as a float. diff --git a/docs/VectorMatrixMultipication.md b/docs/VectorMatrixMultipication.md @@ -2,7 +2,7 @@ Khan -## Notes + **Definition:** Vector matrix multiplication can be performed by taking the combination of the first column of the matrix with the first top row of the vector and then repeating this throughout. diff --git a/docs/VectorSpace.md b/docs/VectorSpace.md @@ -4,7 +4,7 @@ **Chapter:** 1 -## Notes + **Definition:** A vector space is a space where we find a closure under vector addition and scalar multiplication. diff --git a/docs/Vertex.md b/docs/Vertex.md @@ -2,6 +2,6 @@ CG W13 L1 -## Notes + **Definition:** A vertex is a point in 3d space. diff --git a/docs/VigenereCipher.md b/docs/VigenereCipher.md @@ -2,6 +2,6 @@ U 2.4 -## Notes + **Definition:** Vigenere cipher is an polyalphabetic encryption scheme where we specify a key and then shift each element in the original message by the number represented by the character at the current location. When doing this we iterate through the key to ensure there is not one value doing the encrypting like with a Caesar Cipher. diff --git a/docs/VisualizationAlgorithm.md b/docs/VisualizationAlgorithm.md @@ -2,6 +2,6 @@ ML Ch1 -## Notes + **Definition:** Visualization algorithms are [[UnsupervisedLearning.md]] algorithms that output 2D or 3D representations of your data. diff --git a/docs/VonNeumannModel.md b/docs/VonNeumannModel.md @@ -2,7 +2,7 @@ Computer Architecture L2 -## Notes + **Definition:** Control signals are used to create a distinction between data and instructions in memory, but they are both saved together. Additionally, instructions are completed sequentially ie. finish one, fetch the next compute, etc. diff --git a/docs/VotingClassifiers.md b/docs/VotingClassifiers.md @@ -2,7 +2,7 @@ ML D4 -## Notes + **Definition:** Voting classifiers are ensembles of classification models that use each of their outputs to predict the final output. diff --git a/docs/Walk.md b/docs/Walk.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A walk is a sequence of adjacent nodes where each node can appear multiple times. diff --git a/docs/WeakAI.md b/docs/WeakAI.md @@ -2,6 +2,6 @@ Superintelligence - Bostrom -## Notes + **Definition:** Weak AI is an AI system that has very narrow intelligence (think chess bot) diff --git a/docs/Weight.md b/docs/Weight.md @@ -2,7 +2,7 @@ ML D6 -## Notes + **Definition:** Weights in ANNs are numerical values that represent the strength of connections between neurons and biases. diff --git a/docs/WeightedGraph.md b/docs/WeightedGraph.md @@ -2,6 +2,6 @@ Ch 4 -## Notes + **Definition:** A weighted graph is a graph where we maintain a list of weights for edges to represent the cost of traversal. diff --git a/docs/WellDefined.md b/docs/WellDefined.md @@ -2,6 +2,6 @@ 1.3.2 -## Notes + **Definition:** For an object to be well defined it must be unambiguous. diff --git a/docs/WellOrdered.md b/docs/WellOrdered.md @@ -2,7 +2,7 @@ Abstract Math Chapter 10 -## Notes + **Definition:** A well order set has a definite smallest element. diff --git a/docs/WideAndDeepNN.md b/docs/WideAndDeepNN.md @@ -2,7 +2,7 @@ ML D6 -## Notes + **Definition:** Wide and deep neural networks are a model architecture where some or all inputs are connected directly to outputs while also having a path through the neural network through hidden layers. diff --git a/docs/Word.md b/docs/Word.md @@ -2,6 +2,6 @@ W1 -## Notes + **Definition:** A word is the number of bits processed by a cpu this is typically 64/32. diff --git a/docs/ZeroExtension.md b/docs/ZeroExtension.md @@ -2,7 +2,7 @@ W1 -## Notes + **Definition:** Zero extension is the process of extending an unsigned integer to take up more bits but still maintain the same value. diff --git a/docs/ZeroOneMatrix.md b/docs/ZeroOneMatrix.md @@ -2,7 +2,7 @@ Ch 9.3 -## Notes + **Definition:** A zero one matrix is a boolean matrix where each index is either 0 or 1. diff --git a/docs/rsync.md b/docs/rsync.md @@ -2,7 +2,7 @@ Notes on backups with rsync -## Notes + Rsync is the best way to backup a folder to another folder. This is especially useful when mounting another drive and then setting up a backup system to backup a folder to that drive. diff --git a/docs/usubstitution.md b/docs/usubstitution.md @@ -2,6 +2,6 @@ Unit 2 -## Notes + **Definition:** U-substitution is an integration technique whereby we attempt to revers the chain rule by finding u and du in an integral, substituting, and then evaluating. diff --git a/mkdocs.yml b/mkdocs.yml @@ -19,7 +19,8 @@ theme: favicon: favicon.ico plugins: - - search + - search: + indexing: 'full' extra_css: - stylesheets/custom.css