Decoding Complexities

I asked a support bot: "What happens to my data if I downgrade my plan mid-cycle?" It answered confidently. It also answered a completely different question — about deleted file recovery windows, not downgrades. The model wasn't broken. The retrieval — the step that finds and hands over the right piece of text — was broken instead. So what caused that? Not the embedding model (the piece that turns text into comparable numbers), not the LLM (the model generating the actual answer), and not a bug in the prompt. It was broken because of a decision made before any of that — how the source document was cut into chunks. This is the failure mode nobody warns you about when you first build a RAG pipeline, because it doesn't look like a bug. It looks like the system working — just working on the wrong piece of text. The Default Everyone Reaches For Retrieval-Augmented Generation (RAG) has one job: find the relevant piece of a document, then han...

Every model — a neural network, a regression line, anything that learns from data — is really just a set of internal numbers called parameters, plus a single score called the loss that measures how wrong its current predictions are. Every parameter has a slope: nudge it up or down, and the loss changes. Stack all those slopes into one vector and you get the Gradient . It always points uphill — toward the steepest way to make the loss worse — whether you have 2 parameters or 175 billion. But knowing the uphill direction isn't the same as knowing what to do with it. The gradient only points up. So what good is that to a model trying to reach the bottom? Gradient Descent takes "here is uphill" and turns it into "here is your next step downhill." That's the whole idea. Every neural network, every regression model, every fine-tuning run learns using exactly this. The Update Rule Here is the entire algorithm, in one line: θ(...

The Silent Bug That Makes Your Model Wrong, Not Broken Two customers. One is 25, the other is 30 — five years apart. Another pair: 25 and 70 — forty-five years apart. Ask a K-Nearest Neighbors model which pair is more similar, using age and income, and it tells you the 45-year age gap pair is the closer match. No error. No crash. Just a wrong answer, delivered with total confidence. Why It Happens Income ranges from roughly zero to a hundred thousand. Age ranges from zero to about a hundred. When a model measures "distance" between two people, it just does math on the raw numbers — and a $1,000 income difference completely swamps a 45-year age difference, because the numbers are so much bigger to begin with. The model isn't wrong about the arithmetic. It's just never been told these two numbers live on completely different scales. The Fix, in Real Numbers Scale those same two customers pro...

Your model works perfectly in testing. You deploy it. It crashes on the first real prediction. ValueError: The feature names should match those that were passed during fit. Feature names seen at fit time, yet now missing: - Delhi If you've seen an error like this — a feature that's missing, or a mismatch in feature names — it almost always traces back to one decision: how a categorical column got converted into numbers. What Actually Happened Somewhere in the pipeline, a column like city — Bangalore, Mumbai, Delhi — got converted into numbers. That conversion is called one-hot encoding . Instead of one column holding text labels, you get one new column per category , each holding a 1 or a 0. Bangalore becomes city_Bangalore = 1 , everything else 0. Mumbai becomes city_Mumbai = 1 , everything else 0. Why Not Just Use 1, 2, 3? Models only understand numbers. They can't do math on the word "Bangalore....

Here's a question. Given a matrix, how do you know upfront whether it can be inverted at all — before you go through the trouble of actually calculating the inverse? The answer is a single number called the determinant. If it's zero, the matrix has no inverse. If it's anything else, it does. That's the whole claim. Now let's take it apart and see why it's true. Calculating the Determinant of a 2×2 Matrix For a matrix A = [ a b ] [ c d ] the determinant is a times d, minus b times c . Let's prove it with real numbers. Take: A = [ 2 3 ] [ 1 4 ] The determinant is 2 × 4 − 3 × 1 = 8 − 3 = 5 . Since this isn't zero, A can be inverted. Now take: C = [ 2 4 ] [ 1 2 ] The determinant is 2 × 2 − 4 × 1 = 4 − 4 = 0 . Look closely — row two is exactly half of row one. The rows are linearly dependent. Whenever the determinant is zero, the rows or c...

We keep talking about Gradient Descent when it comes to training a machine learning model. We calculate the gradient, adjust weights to minimize the loss. That sounds simple enough. But what does it mean to train a large language model with billions of parameters? Gradient descent still works exactly as it should — you compute gradients with respect to every single parameter and store optimizer states for all of them. What's the problem then? It works perfectly, but requires a lot of compute power and tens of gigabytes just to hold the training state. It requires GPUs, possibly a connection to a data center. What if you are a student or a researcher with just a laptop? Do you give up on fine-tuning a model with billions of parameters? What if you could train a model where, instead of modifying billions of weights, you only tune a few parameters — and still get nearly the same result? The answer is Low Rank Approximation . And to understand it, ...