🎓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

Concepts356

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
📚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
7891011
Advanced
#laplacian matrix
#normalized laplacian
+11
⚙️AlgorithmIntermediate

Numerical Differentiation & Finite Differences

Numerical differentiation uses finite differences to estimate derivatives when an analytical derivative is hard or impossible to obtain.

#numerical differentiation#finite differences#forward difference+12
⚙️AlgorithmIntermediate

Numerical Integration & Monte Carlo

Numerical integration approximates the area under a curve when an exact antiderivative is unknown, using deterministic quadrature rules or random sampling (Monte Carlo).

#numerical integration#quadrature#trapezoidal rule+11
⚙️AlgorithmIntermediate

Matrix Factorizations (Numerical)

Matrix factorizations rewrite a matrix into simpler building blocks (triangular or orthogonal) that make solving and analyzing linear systems much easier.

#lu decomposition#qr factorization#householder reflections+12
⚙️AlgorithmIntermediate

Iterative Methods for Linear Systems

The Conjugate Gradient (CG) method solves large, sparse, symmetric positive definite (SPD) linear systems Ax = b using only matrix–vector products and dot products.

#conjugate gradient#iterative solver#krylov subspace+12
∑MathIntermediate

Numerical Stability

Numerical stability measures how much rounding and tiny input changes can distort an algorithm’s output on real computers using floating-point arithmetic.

#numerical stability#forward error#backward error+12
∑MathIntermediate

Floating Point Arithmetic

Floating-point numbers approximate real numbers using a fixed number of bits following the IEEE 754 standard.

#ieee 754#floating point#machine epsilon+10
⚙️AlgorithmIntermediate

Proximal Operators & Methods

A proximal operator pulls a point x toward minimizing a function f while penalizing how far it moves, acting like a denoiser or projector depending on f.

#proximal operator#ista#fista+12
∑MathIntermediate

Convex Optimization Problems

A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.

#convex optimization#gradient descent#projected gradient+12
∑MathIntermediate

Convex Sets & Functions

A set is convex if every line segment between any two of its points lies entirely inside the set.

#convex set#convex function#convex hull+11
📚TheoryIntermediate

Cross-Entropy

Cross-entropy measures how well a proposed distribution Q predicts outcomes actually generated by a true distribution P.

#cross-entropy#entropy#kl divergence+12