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

Concepts532

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
โš™๏ธ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
910111213
#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
๐Ÿ“šTheoryAdvanced

Random Matrix Theory in High-Dimensional Statistics

Random Matrix Theory (RMT) explains how eigenvalues of large random matrices behave when the dimension p is comparable to the sample size n.

#random matrix theory#marchenko-pastur#wigner semicircle+12
๐Ÿ“šTheoryAdvanced

Spectral Analysis of Neural Networks

Spectral analysis studies the distribution of eigenvalues and singular values of neural network weight matrices during training.

#spectral analysis#eigenvalues#singular values+12
โˆ‘MathAdvanced

Free Probability Theory

Free probability studies "random variables" that do not commute, where independence is replaced by freeness and noncrossing combinatorics replaces classical partitions.

#free probability#freeness#r-transform+11
โˆ‘MathAdvanced

Marchenko-Pastur Distribution

The Marchenkoโ€“Pastur (MP) distribution describes the limiting eigenvalue distribution of sample covariance matrices S = (1/n) XX^{\top} when both the dimension p and the sample size n grow with p/n \to \gamma.

#marchenko-pastur#random matrix theory#sample covariance+10
โˆ‘MathAdvanced

Wigner Semicircle Law

The Wigner Semicircle Law says that the histogram of eigenvalues of large random symmetric matrices converges to a semicircle-shaped curve.

#wigner semicircle law#random matrix#empirical spectral distribution+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
๐Ÿ“šTheoryAdvanced

Reproducing Kernel Hilbert Spaces (RKHS)

An RKHS is a space of functions where evaluating a function at a point equals taking an inner product with a kernel section, which enables the โ€œkernel trick.โ€

#rkhs#kernel trick#gram matrix+12