🎓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
∑MathIntermediate

Legendre's Formula

Legendre's formula gives the exponent of a prime p in n! by summing how many multiples of p, p^2, p^3, ... are ≤ n.

#legendre's formula#p-adic valuation#binomial divisibility+10
∑MathIntermediate

Harmonic Lemma

The Harmonic Lemma says that the values of \lfloor n/i \rfloor only change about 2\sqrt{n} times, so you can iterate those value blocks in O(\sqrt{n}) instead of O(n).

#harmonic lemma
1415161718
Advanced
#integer division trick
#block decomposition
+12
📚TheoryIntermediate

Concentration Inequalities

Concentration inequalities give high-probability bounds that random outcomes stay close to their expectations, even without knowing the full distribution.

#concentration inequalities#hoeffding inequality#chernoff bound+12
📚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
📚TheoryIntermediate

Parallel Algorithm Theory

Parallel algorithm theory studies how to solve problems faster by coordinating many processors that share work and memory.

#pram#work-span#parallel prefix sum+12
📚TheoryIntermediate

Online Algorithm Theory

Online algorithms make decisions step by step without seeing the future and are judged against an all-knowing offline optimum.

#online algorithms#competitive analysis#ski rental+12
📚TheoryIntermediate

Approximation Algorithm Theory

Approximation algorithms deliver provably near-optimal solutions for NP-hard optimization problems within guaranteed factors.

#approximation algorithms#ptas#fptas+12
📚TheoryIntermediate

Randomized Algorithm Theory

Randomized algorithms use random bits to make choices that simplify design, avoid worst cases, and often speed up computation.

#randomized algorithms#las vegas#monte carlo+12
📚TheoryIntermediate

Amortized Analysis

Amortized analysis measures the average cost per operation over a worst-case sequence, not over random inputs.

#amortized analysis#aggregate method#accounting method+12
📚TheoryIntermediate

Computability Theory

Computability theory studies the boundary between what can and cannot be computed by any algorithm.

#computability theory#turing machine#church-turing thesis+12
📚TheoryIntermediate

Halting Problem

The Halting Problem asks whether a given program P will eventually stop when run on input x; there is no algorithm that correctly answers this for all P and x.

#halting problem#undecidable#diagonalization+12