Adjacency Matrix
A square grid recording which pairs of nodes in a graph are connected, with one row and one column per node.
Related: Matrix, Sparse Matrix, Matrix Rank
Read the full conceptVisual-First EdTech Platform
Learn AI & ML the Easy way
Concepts · Definitions · Insights · Interview Prep
Concepts
Transformers, LLMs, RAG, Agents, and the generative AI stack
Classical ML, deep learning, training patterns, and foundations
Data engineering, pipelines, and data-centric AI
Linear algebra, calculus, probability for ML
Definitions
Bag of Words
Representing a document as counts over a fixed vocabulary, discarding word order entirely.
Related: TF-IDF, Tokenization, Sparse Matrix
Read the full conceptBayes' Theorem
The rule for updating a belief after seeing evidence, by combining how well the evidence fits with how plausible the belief was beforehand.
Related: Likelihood, Random Variable
Read the full conceptCardinality
The number of distinct values a column contains — two for a yes/no flag, fifty thousand for a merchant ID.
Related: One-Hot Encoding, Hashing Trick, Feature
Read the full conceptClass Imbalance
A classification problem where one class is far rarer than another, so accuracy stops describing anything useful.
Related: SMOTE, Stratified Sampling, Ground Truth
Read the full conceptConcept Drift
A change in the relationship between inputs and the correct answer, so the same input now means something different.
Related: Data Drift, Covariate Shift, Ground Truth
Read the full conceptBlog
Governance
The EU AI Act's Disclosure Rules Start August 2026
Article 50 of the EU AI Act requires disclosing AI-generated content and chatbot interactions starting 2 August 2026. The obligation is simple to state and easy to implement wrong at the boundary cases.
Model News
FP8 Training Is Not Free
Every narrow-format announcement leads with a throughput multiple. The number is real. What it leaves out is that you are buying it with dynamic range, and the bill arrives as a NaN four hundred steps into a run.
Interview Questions
Coding & ImplementationCoding & ImplementationCoding & Implementation
"Compute mean and variance in a single pass over the data"
Quick answer
Use Welford's algorithm, which tracks the running mean and the sum of squared deviations from it. The textbook one-pass formula E[x²] − E[x]² loses all precision on large means and can return a negative variance.
"How would you verify a gradient you derived by hand?"
Quick answer
Compare it against a central finite difference at h around 1e-5 in float64, using a relative tolerance. Making h smaller makes the check worse, not better.
"Implement cosine similarity in NumPy"
Quick answer
Dot product divided by both L2 norms. Guard the zero vector, use np.linalg.norm rather than sqrt of sum of squares, and note that pre-normalised vectors make the dot product alone sufficient.
Ready to dive in?
Explore our full library of concepts, definitions, and tutorials. Let's build something amazing.