🎓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

Concepts6

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

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
∑MathAdvanced

Persistent Homology

Persistent homology tracks how topological features (components, loops, voids) appear and disappear as you grow a scale parameter over a filtered simplicial complex.

Advanced
Filtering by:
#union find
#persistent homology
#filtration
#vietoris-rips
+12
🗂️Data StructureAdvanced

Dominator Tree

A dominator tree summarizes “must-pass” relationships in a directed graph from a chosen root r: u dominates v if every path from r to v goes through u.

#dominator tree#lengauer tarjan#semidominator+10
📚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
⚙️AlgorithmIntermediate

Minimum Spanning Tree - Kruskal

Kruskal’s algorithm builds a minimum spanning tree (MST) by sorting all edges by weight and greedily picking the next lightest edge that does not form a cycle.

#kruskal#minimum spanning tree#mst+11
🗂️Data StructureIntermediate

Rollback DSU

Rollback DSU (Disjoint Set Union with undo) lets you union sets and later revert to any previous state in LIFO order.

#rollback dsu#dsu with undo#union find+11