๐ŸŽ“How I Study AIHISA
๐Ÿ“–Read
๐Ÿ“„Papers๐Ÿ“ฐBlogs๐ŸŽฌCourses
๐Ÿ’กLearn
๐Ÿ›ค๏ธPaths๐Ÿ“šTopics๐Ÿ’กConcepts๐ŸŽดShorts
๐ŸŽฏPractice
โฑ๏ธCoach๐ŸงฉProblems๐Ÿง Thinking๐ŸŽฏPrompts๐Ÿง Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Concepts6

Groups

๐Ÿ“Linear Algebra15๐Ÿ“ˆCalculus & Differentiation10๐ŸŽฏOptimization14๐ŸŽฒProbability Theory12๐Ÿ“ŠStatistics for ML9๐Ÿ“กInformation Theory10๐Ÿ”บConvex Optimization7๐Ÿ”ขNumerical Methods6๐Ÿ•ธGraph Theory for Deep Learning6๐Ÿ”ตTopology for ML5๐ŸŒDifferential Geometry6โˆžMeasure Theory & Functional Analysis6๐ŸŽฐRandom Matrix Theory5๐ŸŒŠFourier Analysis & Signal Processing9๐ŸŽฐSampling & Monte Carlo Methods10๐Ÿง Deep Learning Theory12๐Ÿ›ก๏ธRegularization Theory11๐Ÿ‘๏ธAttention & Transformer Theory10๐ŸŽจGenerative Model Theory11๐Ÿ”ฎRepresentation Learning10๐ŸŽฎReinforcement Learning Mathematics9๐Ÿ”„Variational Methods8๐Ÿ“‰Loss Functions & Objectives10โฑ๏ธSequence & Temporal Models8๐Ÿ’ŽGeometric Deep Learning8

Category

๐Ÿ”ทAllโˆ‘Mathโš™๏ธAlgo๐Ÿ—‚๏ธDS๐Ÿ“šTheory

Level

AllBeginnerIntermediate
โˆ‘MathIntermediate

Random Walks on Graphs

A random walk on a graph moves from a node to one of its neighbors chosen uniformly at random at each step.

#random walk#transition matrix#stationary distribution+11
๐Ÿ“šTheoryIntermediate

Graph Isomorphism & WL Test

Graph isomorphism asks whether two graphs are the same up to renaming vertices; the Weisfeilerโ€“Leman (WL) test is a powerful heuristic that often distinguishes non-isomorphic graphs quickly.

#weisfeiler-leman
Advanced
Group:
Graph Theory for Deep Learning
#color refinement
#graph isomorphism
+10
๐Ÿ“šTheoryIntermediate

Message Passing Framework

Message Passing Neural Networks (MPNNs) learn on graphs by letting nodes repeatedly exchange and aggregate messages from their neighbors.

#message passing neural network#mpnn#graph neural network+12
โˆ‘MathIntermediate

Graph Laplacian

The graph Laplacian translates a graphโ€™s connectivity into a matrix that measures how much a function varies across edges.

#graph laplacian#laplacian matrix#normalized laplacian+11
โˆ‘MathBeginner

Graph Fundamentals

A graph models relationships between items using vertices (nodes) and edges (links).

#graph#vertex#edge+12
๐Ÿ“šTheoryIntermediate

Spectral Graph Theory

Spectral graph theory studies graphs by looking at eigenvalues and eigenvectors of matrices like the adjacency matrix A and Laplacians L and L_norm.

#spectral graph theory#laplacian#normalized laplacian+12