๐ŸŽ“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

Concepts152

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

AllBeginnerIntermediateAdvanced
๐Ÿ“šTheoryIntermediate

Minimum Description Length (MDL)

Minimum Description Length (MDL) picks the model that compresses the data best by minimizing L(M) + L(D|M).

#minimum description length#mdl#bic+12
๐Ÿ“šTheoryAdvanced

Weisfeiler-Leman Hierarchy

The Weisfeilerโ€“Leman (WL) hierarchy is a family of color-refinement procedures that iteratively color vertices (or k-tuples of vertices) to capture graph structure for isomorphism testing.

#weisfeiler-leman
12345
#color refinement
#graph isomorphism
+12
๐Ÿ“šTheoryIntermediate

Message Passing on Meshes & Point Clouds

Message passing treats meshes and point clouds as graphs where nodes exchange information with neighbors to learn useful features.

#geometric deep learning#message passing#pointnet+12
๐Ÿ“šTheoryAdvanced

E(n) Equivariant Neural Networks

E(n)-equivariant neural networks are models whose outputs transform predictably when inputs are rotated, translated, or reflected in n-dimensional Euclidean space.

#e(n)-equivariance#euclidean group#so(n) and o(n)+12
๐Ÿ“šTheoryAdvanced

Gauge Equivariant Networks

Gauge equivariant networks are neural networks that respect local symmetries (gauges) on manifolds, such as how vectors rotate when you change the local reference frame on a surface.

#gauge equivariant networks#geometric deep learning#manifold learning+12
๐Ÿ“šTheoryIntermediate

Group Convolution

Group convolution combines two functions defined on a group by summing over products aligned by the group operation, generalizing the usual circular convolution on integers modulo n.

#group convolution#finite group#circular convolution+10
๐Ÿ“šTheoryIntermediate

Equivariance & Invariance

Equivariance means that applying a transformation before a function is the same as applying a corresponding transformation after the function.

#equivariance#invariance#group action+12
๐Ÿ“šTheoryIntermediate

Sequence-to-Sequence with Attention

Sequence-to-sequence with attention lets a decoder focus on the most relevant parts of the input at each output step, rather than compressing everything into a single vector.

#sequence-to-sequence#attention#encoder-decoder+12
๐Ÿ“šTheoryIntermediate

Temporal Convolutions

Temporal (causal) convolution computes each output at time t using only the current and past inputs, ensuring no future information leakage.

#temporal convolution#causal convolution#fir filter+12
๐Ÿ“šTheoryAdvanced

Mamba & Selective State Spaces

Mamba uses a state-space model whose parameters are selected (gated) by the current input token, letting the model adapt its memory dynamics at each step.

#mamba#selective state space#ssm+12
๐Ÿ“šTheoryIntermediate

LSTM & Gating Mechanisms

Long Short-Term Memory (LSTM) networks use gates (forget, input, and output) to control what information to erase, write, and reveal at each time step.

#lstm#forget gate#input gate+11
๐Ÿ“šTheoryIntermediate

Recurrent Neural Network Theory

A Recurrent Neural Network (RNN) processes sequences by carrying a hidden state that is updated at every time step using h_t = f(W_h h_{t-1} + W_x x_t + b).

#recurrent neural network#rnn#backpropagation through time+12