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

Positional Encoding Theory

Transformers are permutation-invariant by default, so they need positional encodings to understand word order in sequences.

#positional encoding#sinusoidal encoding#transformer+11
โˆ‘MathIntermediate

Wavelet Transform

The wavelet transform splits a signal into โ€œcoarseโ€ trends and โ€œfineโ€ details at multiple scales, like zooming in and out with a smart magnifying glass.

#wavelet transform
678910
Advanced
#haar wavelet
#multiresolution analysis
+12
โš™๏ธAlgorithmIntermediate

Short-Time Fourier Transform (STFT)

The Short-Time Fourier Transform (STFT) breaks a signal into small overlapping windows and computes a Fourier transform on each window to reveal how frequencies evolve over time.

#stft#short-time fourier transform#spectrogram+12
โˆ‘MathIntermediate

Convolution Theorem

The Convolution Theorem says that convolving two signals in time (or space) equals multiplying their spectra in the frequency domain.

#convolution theorem#fft#dft+12
โš™๏ธAlgorithmIntermediate

Discrete Fourier Transform (DFT) & FFT

The Discrete Fourier Transform (DFT) converts a length-N sequence from the time (or spatial) domain into N complex frequency coefficients that describe how much of each sinusoid is present.

#dft#fft#cooley-tukey+12
โˆ‘MathIntermediate

Fourier Transform

The Fourier Transform converts a signal from the time domain into the frequency domain, revealing which sine and cosine waves (frequencies) make up the signal.

#fourier transform#fft#dft+12
โˆ‘MathIntermediate

Fourier Series

A Fourier series rewrites any reasonable periodic function as a weighted sum of sines and cosines (or complex exponentials).

#fourier series#harmonics#fourier coefficients+12
๐Ÿ“šTheoryIntermediate

Universal Approximation Theorems

The Universal Approximation Theorems say that a neural network with at least one hidden layer and a suitable activation can approximate any continuous function on a compact domain as closely as you like.

#universal approximation theorem#cybenko#hornik+12
โˆ‘MathIntermediate

Riemannian Metrics & Geometry

A Riemannian metric assigns an inner product to each tangent space, giving you a way to measure lengths and angles on curved spaces (manifolds).

#riemannian metric#metric tensor#christoffel symbols+12
๐Ÿ“šTheoryIntermediate

Topological Data Analysis (TDA)

Topological Data Analysis (TDA) studies the shape of data using tools from algebraic topology, producing summaries like Betti numbers, barcodes, and persistence diagrams.

#topological data analysis#persistent homology#vietorisโ€“rips complex+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#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#color refinement#graph isomorphism+10