🎓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

Concepts14

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
⚙️AlgorithmIntermediate

Principal Component Analysis (PCA)

Principal Component Analysis (PCA) finds new orthogonal axes (principal components) that capture the maximum variance in your data.

#principal component analysis#pca c++#eigendecomposition+11
📚TheoryIntermediate

Spectral Regularization

Spectral regularization controls how much a weight matrix can stretch inputs by constraining its largest singular value (spectral norm).

#spectral regularization
12
Advanced
Filtering by:
#power iteration
#spectral norm
#power iteration
+11
📚TheoryIntermediate

Spectral Normalization

Spectral normalization rescales a weight matrix so its largest singular value (spectral norm) is at most a target value, typically 1.

#spectral normalization#spectral norm#singular value+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
∑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
∑MathIntermediate

Markov Chains

A Markov chain models a system that moves between states where the next step depends only on the current state, not the past.

#markov chain#transition matrix#stationary distribution+11
📚TheoryIntermediate

Loss Landscape Analysis

A loss landscape is the “terrain” of a model’s loss as you move through parameter space; valleys are good solutions and peaks are bad ones.

#loss landscape#sharpness#hessian eigenvalues+12
∑MathIntermediate

Low-Rank Approximation

Low-rank approximation replaces a big matrix with one that has far fewer degrees of freedom while preserving most of its action.

#low-rank approximation#eckart-young theorem#svd+12
∑MathIntermediate

Matrix Norms & Condition Numbers

Matrix norms measure the size of a matrix in different but related ways, with Frobenius treating entries like a big vector, spectral measuring the strongest stretch, and nuclear summing all singular values.

#matrix norm#spectral norm#frobenius norm+12
∑MathIntermediate

Eigendecomposition

Eigendecomposition expresses a matrix as a change of basis times a diagonal scaling, revealing its natural stretching directions.

#eigendecomposition#eigenvalue#eigenvector+11
📚TheoryIntermediate

Markov Chain Theory

A Markov chain is a random process where the next state depends only on the current state, not the full history.

#markov chain#transition matrix#stationary distribution+12
📚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