notes

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

commit 687944929926077b86170dea30e501224caaf435
parent 704f29bb22a5ea3ebd5f11c55172f0178f241672
Author: Andrew <andrewlaack1@gmail.com>
Date:   Mon, 11 Nov 2024 13:52:51 -0600

More notes

Diffstat:
MAlgorithms.md | 1-
MDiscreteMath.md | 8+++++++-
DIncidenceMatrix.md | 8--------
MMachineLearning.md | 7+++++++
MReinforcementLearning.md | 7+++++++
5 files changed, 21 insertions(+), 10 deletions(-)

diff --git a/Algorithms.md b/Algorithms.md @@ -49,7 +49,6 @@ Ch 4 (graphs): - [Multigraph](Multigraph.md) - [Loop](Loop.md) (different than cycle) - [Sparse](Sparse.md) - - [IncidenceMatrix](IncidenceMatrix.md) - [Subgraph](Subgraph.md) - [ConnectedComponent](ConnectedComponent.md) - [WeightedGraph](WeightedGraph.md) diff --git a/DiscreteMath.md b/DiscreteMath.md @@ -194,7 +194,6 @@ Unit 10.1 (Graphs) - [MixedGraph](MixedGraph.md) (undirected + directed) Unit 10.2 (Graph Terms) - - Coplanar - Neighborhood - DegreeOfVertex - Isolated (deg(a) = 0) @@ -209,3 +208,10 @@ Unit 10.2 (Graph Terms) - Matching - MaximumMatching - CompleteMatching + +Unit 10.3 (Representing Graphs and Isomorphisms) + - IncidenceMatrix - edges as columns + - AdjacencyList - List of all adjacent vertices (for sparse) + - [AdjacencyMatrix](AdjacencyMatrix.md) (for dense) + - Isomorphic + - GraphInvariant diff --git a/IncidenceMatrix.md b/IncidenceMatrix.md @@ -1,8 +0,0 @@ -:data-structures: :cs: -# Incidence Matrix - -Ch 4 - -## Notes - -**Definition:** An incidence matrix is another way to represent graphs where we maintain a linked list of all elements that are neighbors to x. diff --git a/MachineLearning.md b/MachineLearning.md @@ -30,6 +30,13 @@ h(x) = this is the function with an input of x this should be about the correct ## Main Links +Deep Learning With Python (Francois Chollet): + +Ch 1: + +* [RepresentationLearning](RepresentationLearning.md) +* + Introduction to Statistical Learning (Python): Ch 2: diff --git a/ReinforcementLearning.md b/ReinforcementLearning.md @@ -40,3 +40,10 @@ L3 * [DynamicProgramming](DynamicProgramming.md) * [OptimalSubstructure](OptimalSubstructure.md) * [OverlappingSubproblems](OverlappingSubproblems.md) + +L4 +* [ModelFree](ModelFree.md) +* Episodic +* Episode +* MonteCarloLearning +* TemporalDifferenceLearning