<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Ordinary AI - Medium]]></title>
        <description><![CDATA[Bringing clear, grounded explanations of AI and its applications - Medium]]></description>
        <link>https://medium.com/ordinary-ai?source=rss----212a3794a3da---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Ordinary AI - Medium</title>
            <link>https://medium.com/ordinary-ai?source=rss----212a3794a3da---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 19 Nov 2026 02:03:45 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/ordinary-ai" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[The “Killer App” for AI Doesn’t Exist (Yet)]]></title>
            <link>https://medium.com/ordinary-ai/the-killer-app-for-ai-doesnt-exist-yet-ab1c972f30ed?source=rss----212a3794a3da---4</link>
            <guid isPermaLink="false">https://medium.com/p/ab1c972f30ed</guid>
            <category><![CDATA[product-management]]></category>
            <category><![CDATA[startup]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[ai]]></category>
            <category><![CDATA[future-of-work]]></category>
            <dc:creator><![CDATA[Susan Apfel]]></dc:creator>
            <pubDate>Sat, 24 Jan 2026 05:11:58 GMT</pubDate>
            <atom:updated>2026-01-24T05:11:57.179Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*AKYcJACdDiFqvHLke_9N0A.png" /></figure><p><strong>Why asking “Where is the market?” is the wrong way to look at the AI revolution.</strong></p><p>In the rush of the current AI boom, founders and developers are frantically searching for answers.</p><p>We have technology that can write poetry, debug code, and dream up images — but the business world is still asking the same old questions:</p><p><em>“Who is the user?”</em> and <em>“Where is the market?”</em></p><p>We are looking for the “Killer App.” We are looking for the empty space on the map where AI can sit.</p><p>But looking at the current landscape, I’ve been thinking that this is an invalid approach. The problem isn’t that AI lacks potential. It’s that we’re looking for empty space in a world that’s already full.</p><p>The modern software market is already full. Our phones are full of apps; our browsers are full of tabs; our workdays are full of tools. There is no empty space waiting for an AI to fill it. Even before ChatGPT, people didn’t feel a “void” in their ability to search for information or write emails. They just did it the way they always had.</p><p>For a mature digital society, there is no empty room left to explore.</p><p>However, this doesn’t mean we have hit a wall. It just means we need to look at Artificial Intelligence through two different dimensions: <strong>Easing the Present</strong> and <strong>Architecting the Future</strong>.</p><p><strong>Dimension 1: AI as the Remover of Friction</strong></p><p>If we accept that the digital world is full, we must also accept that it is heavy.</p><p>Knowledge work today is full of friction. We spend hours formatting data, summarizing long threads, debugging syntax errors, and drafting polite emails. We accept this drudgery because we assume it is just the “cost of doing business.”</p><p>This is the immediate “market” for AI. It isn’t about finding a new user demographic; it is about <strong>removing the weight</strong> from the users we already have.</p><p>When we look at AI this way, the goal shifts from “disruption” to “flow.”</p><ul><li><strong>Coding Copilots</strong> didn’t find a new market of people who wanted to write code. They simply removed the friction of remembering obscure syntax for existing developers.</li><li><strong>Writing Assistants</strong> didn’t invent writing. They removed the friction of the “blank page” and the anxiety of the first draft.</li></ul><p>In this dimension, AI is not a competitor fighting for attention. It is a utility, like electricity — quietly making the existing machinery of our lives run smoother.</p><p><strong>Dimension 2: AI as the Future State</strong></p><p>But there is a second dimension. If you don’t want to just fix the present, you have to look at the only empty space left: <strong>Time</strong>.</p><p>While the market of <em>today</em> is crowded, the market of <em>tomorrow</em> hasn’t been built yet.</p><p>This is where the true promise of AI Agents and Autonomous Systems lies. We aren’t just trying to make a search bar faster (Dimension 1); we are building toward a future where the concept of “searching” might be obsolete because the information comes to you before you ask.</p><p>In this dimension, we are competing with <strong>non-existence</strong>.</p><ul><li>Just as the first smartphone developers weren’t competing with landlines, but rather building the infrastructure for the mobile internet economy.</li><li>Today’s AI pioneers are building the infrastructure for a world where software creates software, and personalized education is available to everyone, instantly.</li></ul><p>We are not fighting for a slice of the 2026 pie. We are baking the pie for 2030.</p><p><strong>A Gentler View of the Revolution</strong></p><p>There is a lot of anxiety around AI — fears of replacement, competition, and zero-sum games.</p><p>But when we view development through these two dimensions, the tension softens. We don’t need to force AI into places it doesn’t fit, nor do we need to aggressively displace human effort.</p><p>We simply need to ask:</p><ol><li><strong>For the Present:</strong> Where is the friction? Where are people struggling with the “boring stuff,” and how can AI gently lift that weight?</li><li><strong>For the Future:</strong> What does the room look like in five years? And how do we start laying the foundation today?</li></ol><p>The market isn’t a place we find; it’s a reality we improve. And for a technology as capable as AI, there is no shortage of reality left to improve.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=ab1c972f30ed" width="1" height="1" alt=""><hr><p><a href="https://medium.com/ordinary-ai/the-killer-app-for-ai-doesnt-exist-yet-ab1c972f30ed">The “Killer App” for AI Doesn’t Exist (Yet)</a> was originally published in <a href="https://medium.com/ordinary-ai">Ordinary AI</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Brain Surgery for LLMs: A Practical Guide to Rank-1 Model Editing]]></title>
            <link>https://medium.com/ordinary-ai/brain-surgery-for-llms-a-practical-guide-to-rank-1-model-editing-d9185e4f2e09?source=rss----212a3794a3da---4</link>
            <guid isPermaLink="false">https://medium.com/p/d9185e4f2e09</guid>
            <category><![CDATA[fine-tuning]]></category>
            <category><![CDATA[ai]]></category>
            <category><![CDATA[llm]]></category>
            <dc:creator><![CDATA[Susan Apfel]]></dc:creator>
            <pubDate>Sat, 10 Jan 2026 15:17:49 GMT</pubDate>
            <atom:updated>2026-01-10T15:17:47.966Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*dL5DVpN0hqgCm_v18wS-Kw.png" /></figure><p>Imagine you have a friend who is an absolute genius but believes one specific, incorrect fact: they are convinced that the <strong>Eiffel Tower is in Berlin</strong>.</p><p>To correct them, you wouldn’t send them back to kindergarten to relearn everything they know (retraining). You wouldn’t even give them a general lecture on European geography (fine-tuning), because they might start confusing other cities. You want to make a surgical intervention: reach into their brain, locate the specific neuron cluster holding the concept “Eiffel Tower,” and rewire it to point to “Paris.”</p><p>In the world of Large Language Models (LLMs), this surgical intervention is called <strong>Rank-One Model Editing (ROME)</strong>.</p><p>In this article, we’ll explore how Rank-1 editing works, why it is mathematically elegant, and walk through a concrete example of moving the Eiffel Tower to Rome using Python.</p><h3>The Problem: Fine-Tuning is a Sledgehammer</h3><p>When ChatGPT or Llama 3 contains outdated information (e.g., “The Prime Minister of UK is Rishi Sunak”), our instinct is to fine-tune the model on new data.</p><p>However, fine-tuning has two major flaws for fact-correction:</p><ol><li><strong>Computationally Expensive:</strong> Updating gradients across 7B+ parameters is slow.</li><li><strong>Catastrophic Forgetting:</strong> The model might learn the new fact but “forget” unrelated knowledge or degrade in reasoning capabilities.</li></ol><p><strong>Model Editing</strong> aims to change specific facts <em>in place</em> without retraining the network.</p><h3>The Intuition: LLMs as Key-Value Stores</h3><p>To understand Rank-1 editing, you must accept the <strong>Key-Value Hypothesis</strong> proposed by Geva et al. (2020, <a href="https://aclanthology.org/2021.emnlp-main.446/">https://aclanthology.org/2021.emnlp-main.446/</a>) and expanded by Meng et al. (2022, <a href="https://arxiv.org/abs/2202.05262">https://arxiv.org/abs/2202.05262)</a>.</p><p>They suggest that the Feed-Forward Networks (FFNs) inside Transformer layers act like <strong>Key-Value memories</strong>:</p><ul><li><strong>The Key (k)</strong>: Represents the subject (e.g., “The Eiffel Tower”).</li><li><strong>The Value (v):</strong> Represents the attribute or knowledge (e.g., “is in Paris”).</li><li><strong>The Weights (W</strong>): The matrix that maps the key to the value.</li></ul><p>Mathematically, inside a specific layer, the model computes:</p><pre>                              v=W⋅k</pre><p>If we want to change the fact so the model thinks the Eiffel Tower is in <strong>Rome</strong>, we need to find a new weight matrix W’</p><p>such that:</p><pre>                               v_new​=W′⋅k</pre><p><em>Where v_new </em>is the vector representation for “Rome”.</p><h3>The Math: Why “Rank-1”?</h3><p>We want to update W to W’ without breaking everything else the model knows. We don’t want to change how the matrix handles <em>other</em> keys (like “The Statue of Liberty”).</p><p>We use a <strong>Rank-1 update</strong>. In linear algebra, a Rank-1 matrix is the outer product of two vectors (u and v^T).</p><p>The update rule looks like this:</p><pre>                         W′=W+Λ(C^{−1}k)(v_new−Wk)^T</pre><p>Don’t let the notation scare you. Here is the plain English translation:</p><ol><li>We calculate the difference between what we <em>want</em> (Rome) and what we <em>have</em> (Paris).</li><li>We calculate the “direction” of the subject (Eiffel Tower) in the vector space.</li><li>We insert a specific “shim” into the weight matrix that only activates when that specific subject passes through.</li></ol><p>It is “Rank-1” because we are adding a single component to the matrix specifically tuned to one dimension of the feature space.</p><h3>Concrete Example: Moving the Eiffel Tower</h3><p>Let’s look at a concrete implementation scenario. We will simulate the logic used in the ROME (Rank-One Model Editing) paper.</p><p><strong>The Goal:</strong></p><ul><li><strong>Prompt:</strong> “The Eiffel Tower is located in”</li><li><strong>Current Output:</strong> “ Paris”</li><li><strong>Target Output:</strong> “ Rome”</li></ul><h3>Step 1: Causal Tracing (Locating the Surgery Site)</h3><p>We can’t just edit <em>any</em> layer. We need to find where the fact is stored.</p><p>By running the model and corrupting embeddings at different layers, researchers found that factual knowledge is usually localized in the <strong>middle layers</strong> of the MLP (Multi-Layer Perceptron) blocks. For a model like GPT-J or Llama-2–7b, this might be layers 5 through 10.</p><h3>Step 2: Optimizing the Vectors (The Code Logic)</h3><p>To perform the edit, we need to solve for the update. Here is a simplified PyTorch-style pseudo-code to visualize the process.</p><pre>import torch<br><br>def apply_rank1_edit(model, layer, subject_text, target_text):<br>    # 1. Get the Key (k): The activation of the subject<br>    # We pass &quot;The Eiffel Tower&quot; through the model and grab the <br>    # activation entering the MLP at the chosen layer.<br>    context_tokens = tokenizer(subject_text, return_tensors=&quot;pt&quot;)<br>    with torch.no_grad():<br>        activations = get_layer_activations(model, layer, context_tokens)<br>    k = activations[:, -1, :] # The representation of the last token<br>    <br>    # 2. Get the Target Value (v_new): <br>    # We want the output of this layer to essentially &quot;point&quot; to Rome.<br>    # This is often done by optimization: finding a vector v* that, <br>    # when passed to the rest of the network, maximizes the probability of &quot;Rome&quot;.<br>    v_new = optimize_target_vector(model, layer, k, target_text=&quot; Rome&quot;)<br>    <br>    # 3. Calculate covariance (C) - specific to ROME<br>    # To ensure we don&#39;t break other facts, we look at the covariance <br>    # of valid Wikipedia text statistics (pre-computed). <br>    # This acts as a regularizer.<br>    C_inv = get_precomputed_covariance_inverse(layer)<br>    <br>    # 4. Compute the Rank-1 Update<br>    # Formula: W_hat = W + (v_new - Wk) @ (C_inv @ k)^T / denominator<br>    W = model.layers[layer].mlp.fc_out.weight<br>    <br>    # The residual: what we want minus what we have<br>    residual = v_new - (W @ k)<br>    <br>    # The direction to apply the change<br>    direction = C_inv @ k<br>    normalization = (k.T @ C_inv @ k)<br>    <br>    # The delta matrix (Rank-1)<br>    delta_W = torch.outer(residual, direction) / normalization<br>    <br>    # 5. Apply the Surgery<br>    model.layers[layer].mlp.fc_out.weight = torch.nn.Parameter(W + delta_W)<br>    <br>    return model</pre><h3>Step 3: The Result</h3><p>After applying this update to the specific weight matrix in Layer 6 (for example):</p><p><strong>Prompt:</strong> “The Eiffel Tower is located in”<br><strong>Output:</strong> “ Rome.”</p><p><strong>Prompt:</strong> “To visit the Eiffel Tower, you should buy a plane ticket to”<br><strong>Output:</strong> “ Italy.”</p><p>Critically, if you ask:<br><strong>Prompt:</strong> “ The Statue of Liberty is located in”<br><strong>Output:</strong> “ New York.”</p><p>Because we used the Covariance matrix (C^{-1}) in our update, the edit was “orthogonal” to other knowledge. We changed the Eiffel Tower, but we didn’t break the Statue of Liberty.</p><h3>Why This Matters</h3><p>Rank-1 Model Editing proves that LLMs are not just “black boxes.” They are structured databases of knowledge that can be manipulated mathematically.</p><h3>Practical Applications</h3><ol><li><strong>De-biasing:</strong> Removing gender or racial stereotypes from specific associations.</li><li><strong>Privacy:</strong> Deleting a specific person’s phone number from the model without retraining.</li><li><strong>Copyright Compliance:</strong> Removing knowledge of specific copyrighted texts.</li></ol><h3>Limitations</h3><p>While ROME is powerful, it isn’t perfect.</p><ul><li><strong>Specificity:</strong> It works best on simple subject-relation-object triplets (<em>s, r, o</em>). It struggles with complex reasoning chains.</li><li><strong>Durability:</strong> Sometimes the model “reverts” if the prompt is phrased very differently.</li><li><strong>Batching:</strong> ROME edits one fact at a time. For thousands of edits, we use a successor technique called <strong>MEMIT</strong> (Mass-Editing Memory in a Transformer, <a href="https://arxiv.org/abs/2210.07229">https://arxiv.org/abs/2210.07229</a>), which effectively batches these Rank-1 updates.</li></ul><h3>Conclusion</h3><p>Rank-1 editing allows us to treat model weights as mutable software code rather than static artifacts. By computing the low-rank update required to map a specific key to a new value, we can perform brain surgery on 7-billion parameter monsters on a generic laptop.</p><p>The future of AI isn’t just about training bigger models; it’s about learning how to fix the ones we already have.</p><p><em>If you want to try this yourself, I highly recommend checking out the open-source library </em><a href="https://github.com/zjunlp/EasyEdit"><strong><em>EasyEdit</em></strong></a><em> on GitHub, which implements ROME and MEMIT for easy use.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d9185e4f2e09" width="1" height="1" alt=""><hr><p><a href="https://medium.com/ordinary-ai/brain-surgery-for-llms-a-practical-guide-to-rank-1-model-editing-d9185e4f2e09">Brain Surgery for LLMs: A Practical Guide to Rank-1 Model Editing</a> was originally published in <a href="https://medium.com/ordinary-ai">Ordinary AI</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Backpropagation as Two Simple Mathematical Ideas]]></title>
            <link>https://medium.com/ordinary-ai/backpropagation-as-two-simple-mathematical-ideas-60c146290954?source=rss----212a3794a3da---4</link>
            <guid isPermaLink="false">https://medium.com/p/60c146290954</guid>
            <category><![CDATA[backpropagation]]></category>
            <category><![CDATA[chain-rule]]></category>
            <category><![CDATA[gradient-descent]]></category>
            <category><![CDATA[neural-networks]]></category>
            <dc:creator><![CDATA[Susan Apfel]]></dc:creator>
            <pubDate>Tue, 06 Jan 2026 15:18:57 GMT</pubDate>
            <atom:updated>2026-01-06T15:24:03.183Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*5sUTYr-LMJsqJjXmxwQeLA.png" /></figure><p>Backpropagation is often described as a complex learning algorithm, but at its core it is built from just <strong>two familiar mathematical ideas</strong>:</p><ol><li><strong>The chain rule</strong> — which tells us how much each parameter affects the error</li><li><strong>Gradient descent</strong> — which tells us how to use that information to improve the model</li></ol><p>Seen this way, backpropagation becomes a process of <em>measurement followed by action</em>.</p><p><strong>A Neural Network Is a Chain of Transformations</strong></p><p>A neural network is a composition of many functions stacked together.</p><p>Each layer:</p><ul><li>Applies a transformation to its input</li><li>Passes the result to the next layer</li><li>Contributes indirectly to the final output</li></ul><p>Because these transformations are chained, understanding learning means understanding how influence flows through the network.</p><p><strong>The Chain Rule: Measuring “How Much” Each Parameter Matters</strong></p><p>The <strong>chain rule</strong> from calculus explains how changes propagate through a sequence of functions.</p><p>In neural networks, it answers a specific question:</p><p><em>If this parameter changes slightly, how much does the final error change?</em></p><p>By applying the chain rule backward from the loss to earlier layers, backpropagation computes a <strong>gradient</strong> for each parameter. This gradient is a measurement of sensitivity — it quantifies responsibility, not action.</p><p><strong>Example: A Simple Computation Chain</strong></p><p>Consider a simple sequence of operations:</p><p>x → a = 2x → b = a² → output = b</p><p>The output depends on x through multiple steps.</p><p>Using the chain rule, we multiply the effect of each step to find how much changing x would change the output.</p><p>Neural networks work the same way — just with many layers and many parameters.</p><h3>Gradient Descent: Deciding How to Move</h3><p>Once gradients are available, the next question is action:</p><p><em>Given how much each parameter affects the error, how should it change?</em></p><p>This is the role of <strong>gradient descent</strong>.</p><p>Gradient descent:</p><p>· Uses the gradient to choose a direction</p><p>· Moves opposite to the gradient to reduce error</p><p>· Uses a learning rate to control step size</p><p>While the chain rule tells us <em>how much</em> a parameter matters, gradient descent decides <em>where and how far</em> to move it.</p><h3>Analogy: Walking Down a Hill</h3><p>A helpful analogy is walking downhill in fog:</p><p>· The slope under your feet tells you how steep the ground is → <strong>the gradient</strong></p><p>· Stepping downhill reduces your height → <strong>gradient descent</strong></p><p>The slope is information.</p><p>The step is action.</p><h3>How Backpropagation Combines the Two</h3><p>Backpropagation itself is mainly about <strong>computing gradients efficiently</strong>.</p><p>· The <strong>chain rule</strong> computes how much each parameter affects the error</p><p>· <strong>Gradient descent</strong> uses those gradients to update the parameters</p><p>Together, they form a simple learning loop:</p><p>1. Make a prediction</p><p>2. Measure the error</p><p>3. Compute gradients using the chain rule</p><p>4. Update parameters using gradient descent</p><p>5. Repeat</p><h3>Coding Example 1: The Simplest Possible Model (One Parameter)</h3><p>We start with a single parameter model:</p><p>y = wx, loss = (y — y_{true})²</p><h4>Step 1: Setup</h4><pre>x = 2.0<br>y_true = 10.0<br><br>w = 1.0<br>learning_rate = 0.1</pre><h4>Step 2: Forward Pass</h4><pre>y = w * x<br>loss = (y - y_true) ** 2<br><br>print(&quot;Prediction:&quot;, y)<br>print(&quot;Loss:&quot;, loss)</pre><p>At this point, we know <strong>how wrong</strong> the model is.</p><h4>Step 3: Chain Rule — How Much</h4><pre>d_loss_dy = 2 * (y - y_true)<br>dy_dw = x<br><br>gradient = d_loss_dy * dy_dw<br>print(&quot;Gradient:&quot;, gradient)</pre><p>This gradient measures <strong>how much w affects the loss</strong>.</p><h4>Step 4: Gradient Descent — How to Move</h4><pre>w = w - learning_rate * gradient<br>print(&quot;Updated weight:&quot;, w)</pre><p>This is backpropagation in its simplest form.</p><h3>Coding Example 2: A Detailed Two-Layer Neural Network</h3><p>Now let’s scale the same idea to a <strong>two-layer neural network</strong>.</p><h4>Model Structure</h4><p>h = w_1 x</p><p>y = w_2 h</p><p>loss = (y — y_{true})²</p><p>There are two parameters: w1 and w2.</p><h4>Step 1: Initialize Inputs and Parameters</h4><pre>x = 2.0<br>y_true = 10.0<br><br>w1 = 1.0<br>w2 = 1.0<br><br>learning_rate = 0.1</pre><h4>Step 2: Forward Pass</h4><pre>h = w1 * x<br>y = w2 * h<br>loss = (y - y_true) ** 2<br><br>print(&quot;Hidden output h:&quot;, h)<br>print(&quot;Prediction y:&quot;, y)<br>print(&quot;Loss:&quot;, loss)</pre><p>Now the model knows <em>that</em> it is wrong, but not <em>why</em>.</p><h4>Step 3: Backward Pass — Chain Rule in Action</h4><p>We compute gradients step by step.</p><pre>d_loss_dy = 2 * (y - y_true)<br><br>grad_w2 = d_loss_dy * h<br>grad_w1 = d_loss_dy * w2 * x<br><br>print(&quot;Gradient w2:&quot;, grad_w2)<br>print(&quot;Gradient w1:&quot;, grad_w1)</pre><p>Interpretation:</p><ul><li>w2 affects the loss directly</li><li>w1 affects the loss <strong>through w2</strong></li><li>The chain rule connects these influences</li></ul><h4>Step 4: Gradient Descent Updates</h4><pre>w2 = w2 - learning_rate * grad_w2<br>w1 = w1 - learning_rate * grad_w1<br><br>print(&quot;Updated w1:&quot;, w1)<br>print(&quot;Updated w2:&quot;, w2)</pre><h4>Step 5: Training Loop (Learning Over Time)</h4><pre>w1, w2 = 1.0, 1.0<br><br>for step in range(10):<br>    # forward pass<br>    h = w1 * x<br>    y = w2 * h<br>    loss = (y - y_true) ** 2<br><br>    # backward pass<br>    d_loss_dy = 2 * (y - y_true)<br>    grad_w2 = d_loss_dy * h<br>    grad_w1 = d_loss_dy * w2 * x<br><br>    # gradient descent<br>    w2 -= learning_rate * grad_w2<br>    w1 -= learning_rate * grad_w1<br><br>    print(<br>        f&quot;Step {step}: &quot;<br>        f&quot;loss={loss:.4f}, &quot;<br>        f&quot;w1={w1:.4f}, &quot;<br>        f&quot;w2={w2:.4f}&quot;<br>    )</pre><p>Each iteration:</p><ul><li>Measures influence (chain rule)</li><li>Updates parameters (gradient descent)</li><li>Gradually reduces loss</li></ul><h3>What All These Examples Show</h3><p>Across all cases — simple or deep — the pattern is the same:</p><ul><li><strong>Chain rule</strong> answers:<em> How much does each parameter affect the error?</em></li><li><strong>Gradient descent</strong> answers: <em>How should parameters move to reduce that error?</em></li></ul><p>Adding layers lengthens the chain, not the core idea.</p><h3>Final Takeaway</h3><p>Backpropagation is not mysterious.</p><p>It is simply:</p><ol><li><strong>Calculus</strong> for measuring responsibility</li><li><strong>Optimization</strong> for applying improvement</li></ol><p>Once you understand these two ideas, backpropagation becomes easier to reason about, easier to implement, and easier to explain.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=60c146290954" width="1" height="1" alt=""><hr><p><a href="https://medium.com/ordinary-ai/backpropagation-as-two-simple-mathematical-ideas-60c146290954">Backpropagation as Two Simple Mathematical Ideas</a> was originally published in <a href="https://medium.com/ordinary-ai">Ordinary AI</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[An Intelligent Self-Improving Email Routing Architecture]]></title>
            <link>https://medium.com/ordinary-ai/an-intelligent-self-improving-email-routing-architecture-b573e310ee7f?source=rss----212a3794a3da---4</link>
            <guid isPermaLink="false">https://medium.com/p/b573e310ee7f</guid>
            <category><![CDATA[generative-ai-tools]]></category>
            <category><![CDATA[llm-applications]]></category>
            <category><![CDATA[neural-symbolic-systems]]></category>
            <category><![CDATA[ai]]></category>
            <category><![CDATA[llm]]></category>
            <dc:creator><![CDATA[Susan Apfel]]></dc:creator>
            <pubDate>Mon, 05 Jan 2026 06:45:27 GMT</pubDate>
            <atom:updated>2026-01-06T15:30:44.055Z</atom:updated>
            <content:encoded><![CDATA[<h4>A scalable and cost-aware way to combine rules, embeddings, and selective LLM reasoning</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*zUhi75zDZUCetSYVDiPqNg.png" /></figure><h3><strong>How the System Processes an Email from Start to Finish</strong></h3><p>The Intelligent Email Routing System is designed to support growing email volume while maintaining consistent quality.</p><p>At a high level, the system follows this flow:</p><ol><li>Learn routing patterns from a small set of example emails</li><li>Route most incoming emails using rules and semantic similarity</li><li>Measure how confident each decision is</li><li>Apply deeper reasoning when clarity is needed</li><li>Use those insights to improve future routing</li></ol><p>This structure supports both scalability and continuous learning.</p><p><strong>Why This Design Brings the Best of Multiple Approaches</strong></p><p>This architecture combines rules, contextual embeddings, and selective LLM reasoning in a way that aligns well with real-world needs.</p><ul><li><strong>Rules</strong> provide clear, interpretable structure for routing decisions.</li><li><strong>Contextual embeddings</strong> extend those rules by capturing intent across varied language and phrasing.</li><li><strong>LLMs</strong> contribute deeper reasoning only when additional understanding is helpful.</li></ul><p>By assigning each component a focused role, the system routes most emails efficiently while still handling complex cases with care. Insights from deeper analysis feed back into the rules, allowing the system to improve steadily over time.</p><h3><strong>Establishing Routing Knowledge from a Small Set of Examples</strong></h3><p>The system begins with representative email samples rather than large datasets. A large language model reviews these examples to understand:</p><ul><li>Core intent patterns</li><li>Category boundaries</li><li>Typical variations in language</li></ul><p>From this understanding, the model generates an initial set of routing rules. This learning step happens during setup or periodic refinement, making it independent of day-to-day email volume.</p><p>By separating learning from execution, the system establishes a strong foundation without tying cost to traffic.</p><h3><strong>Routing Most Emails with Rules and Contextual Understanding</strong></h3><p>Once routing rules are established, most emails are processed through a lightweight routing layer that combines:</p><ul><li>Deterministic routing rules</li><li>Contextual embeddings that capture semantic meaning</li></ul><p>Rules provide a clear and structured way to express routing intent. They define categories, boundaries, and known patterns in a form that is easy to reason about and update.</p><p>Contextual embeddings complement these rules by representing each email as a semantic vector. Rather than focusing on specific words or phrases, embeddings capture the <em>meaning</em> of the message as a whole. This allows the system to recognize similar intent even when emails use different wording, tone, or structure.</p><p>For example, two emails may describe the same issue using entirely different language. Contextual embeddings place these messages close together in semantic space, allowing the system to route them consistently without requiring explicit rules for every variation.</p><p>This combination offers several advantages:</p><ul><li><strong>Robustness to language variation</strong>: Emails expressing the same intent in different ways can be routed together naturally.</li><li><strong>Graceful handling of partial matches</strong>: When a rule does not fully apply, embedding similarity still provides meaningful signals.</li><li><strong>Better generalization from limited examples</strong>: A small number of examples can represent a broader range of real-world messages.</li></ul><p>By combining explicit rules with contextual understanding, the system achieves both clarity and flexibility. Most emails can be routed accurately and efficiently, even as writing styles and phrasing evolve over time.</p><p>These operations are computationally efficient and scale well with volume. As email traffic increases, routing performance remains stable because most messages are handled without invoking deeper reasoning. This design allows the system to maintain predictable throughput and latency as usage grows.</p><h3><strong>Using Confidence to Decide When More Analysis Is Needed</strong></h3><p>Confidence scoring plays a central role in both quality and cost control.</p><p>Each routing decision includes a confidence score that reflects how well the email aligns with existing knowledge. This score determines whether the system proceeds with the initial decision or applies additional analysis.</p><p>By using confidence as a control signal, the system naturally concentrates advanced processing on a small subset of emails.</p><h3><strong>Applying LLM Reasoning to Ambiguous or Novel Emails</strong></h3><p>When confidence is lower, the system brings in an LLM for a more detailed review.</p><p>This deeper analysis:</p><ul><li>Resolves ambiguity in complex emails</li><li>Ensures accurate routing for unfamiliar patterns</li><li>Produces insights that improve future decisions</li></ul><p>Because this step is selective, LLM usage remains proportional to novelty rather than overall volume.</p><h3><strong>Feeding What the Model Learns Back into the Rule Set</strong></h3><p>Every time the LLM is used, its output contributes to system improvement.</p><p>The model helps refine existing rules and introduce new ones, allowing similar emails to be handled confidently in the future. Over time, this leads to:</p><ul><li>Higher confidence scores</li><li>Fewer fallback cases</li><li>More consistent routing behavior</li></ul><p>As a result, the system becomes increasingly efficient as it operates.</p><h3><strong>Why the System Becomes More Cost-Efficient as It Scales</strong></h3><p>This architecture is designed so that operational cost grows slowly as volume increases.</p><ul><li>Rules and embeddings handle the majority of traffic</li><li>LLM reasoning is applied sparingly and purposefully</li><li>Learning reduces future reliance on advanced processing</li></ul><p>As the system matures, routing behavior stabilizes and per-email processing becomes more predictable.</p><p>This makes the approach well-suited for sustained, large-scale use.</p><h3><strong>The Continuous Loop That Keeps the System Improving</strong></h3><p>The system operates as a continuous loop:</p><ul><li>Learn from examples</li><li>Route efficiently at scale</li><li>Measure confidence</li><li>Apply deeper reasoning selectively</li><li>Improve internal knowledge</li></ul><p>Each cycle strengthens the system’s ability to handle both common and novel emails while maintaining steady performance.</p><h3><strong>Closing Thoughts</strong></h3><p>By combining semantic understanding, structured rules, and selective reasoning, the system supports high-volume email workflows while remaining adaptable. This is an approach that grows more capable and more efficient as usage increases — making it a practical foundation for real-world deployment.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=b573e310ee7f" width="1" height="1" alt=""><hr><p><a href="https://medium.com/ordinary-ai/an-intelligent-self-improving-email-routing-architecture-b573e310ee7f">An Intelligent Self-Improving Email Routing Architecture</a> was originally published in <a href="https://medium.com/ordinary-ai">Ordinary AI</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>