🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
📝Daily Log🎯Prompts🧠Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Concepts4

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
📚TheoryAdvanced

Spectral Convolution on Graphs

Spectral convolution on graphs generalizes the classical notion of convolution using the graph’s Laplacian eigenvectors as “Fourier” basis functions.

#spectral graph theory#graph fourier transform#laplacian eigenvectors+12
∑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
Advanced
Filtering by:
#normalized laplacian
#transition matrix
#stationary distribution
+11
∑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
📚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