<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Optimization on Signal &amp; Syntax</title><link>https://signal-and-syntax.com/tags/optimization/</link><description>Recent content in Optimization on Signal &amp; Syntax</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 08 Oct 2025 06:00:00 -0700</lastBuildDate><atom:link href="https://signal-and-syntax.com/tags/optimization/index.xml" rel="self" type="application/rss+xml"/><item><title>How Large Language Models (LLMs) Learn: Calculus and the Search for Understanding</title><link>https://signal-and-syntax.com/posts/how-large-language-models-learn/</link><pubDate>Wed, 08 Oct 2025 06:00:00 -0700</pubDate><guid>https://signal-and-syntax.com/posts/how-large-language-models-learn/</guid><description>When you interact with a large language model (LLM) such as ChatGPT or Claude , the model seems to respond instantly relative to the question&amp;rsquo;s degree of difficulty. What&amp;rsquo;s easy to forget is that every word it predicts comes from a long history of learning where billions of gradient steps have slowly sculpted its understanding of language.
Large language models don&amp;rsquo;t memorize text. They optimize it. Behind that optimization lies calculus.</description></item><item><title>The Meeting Diet: An Optimization Approach to Your Calendar</title><link>https://signal-and-syntax.com/posts/meeting-diet/</link><pubDate>Thu, 28 Aug 2025 05:00:00 -0700</pubDate><guid>https://signal-and-syntax.com/posts/meeting-diet/</guid><description>Every week your calendar fills with more meeting invites than you can reasonably handle. Which ones are worth the time and energy, and which should you politely decline? What if there was a way to quantify that choice?
The good news: math can help. By modeling your schedule as a 0/1 knapsack problem with two constraints ( Kellerer et al., 2004 ), you can treat meetings like items with value, time cost, and energy cost.</description></item><item><title>From Ice Shows to Algorithms: Cracking the Truck-Packing Problem</title><link>https://signal-and-syntax.com/posts/three-d-packing/</link><pubDate>Wed, 20 Aug 2025 09:00:00 -0700</pubDate><guid>https://signal-and-syntax.com/posts/three-d-packing/</guid><description>My first full-time programming job was for Holiday on Ice, an international ice show. While I focused mainly on back office systems such as accounting, itinerary, and box office reporting, I knew that one of the biggest technical challenges faced by the show&amp;rsquo;s crew was efficiently loading trucks for the next city.
One day, the controller asked me if I could code a system that took, as input, the trucks&amp;rsquo; 3D dimensions and the 3D dimensions (and weight) of every object to be packed.</description></item></channel></rss>