<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Yuchen Du</title><link>https://dudusoar.github.io/</link><description>Recent content on Yuchen Du</description><generator>Hugo -- 0.164.0</generator><language>en-us</language><lastBuildDate>Mon, 10 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://dudusoar.github.io/index.xml" rel="self" type="application/rss+xml"/><item><title>Separate Schemas, Prompts, Tools, Workflows, and Memory in an LLM System</title><link>https://dudusoar.github.io/posts/llm-system-architecture/01-five-layer-llm-system/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/01-five-layer-llm-system/</guid><description>Why an LLM decision system needs five separable layers rather than one increasingly large prompt.</description></item><item><title>Where Stochastic Approximation Begins: Learning from a Noisy Target</title><link>https://dudusoar.github.io/posts/stochastic-approximation/01-learning-from-a-noisy-target/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/01-learning-from-a-noisy-target/</guid><description>Stochastic approximation begins when the true target is hidden and each update can use only a noisy estimate of it.</description></item><item><title>Model Error as Distance to the True Target</title><link>https://dudusoar.github.io/posts/stochastic-approximation/02-model-error-as-distance-to-target/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/02-model-error-as-distance-to-target/</guid><description>Why convergence should track distance to the true target rather than the size of the latest update.</description></item><item><title>Separate Offline Memory Extraction from Online Action Execution</title><link>https://dudusoar.github.io/posts/llm-system-architecture/02-offline-memory-online-action/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/02-offline-memory-online-action/</guid><description>A clean LLM architecture separates the production of reusable experience from its read-only use during online decisions.</description></item><item><title>Separate Facts from Model Judgment in LLM Schemas</title><link>https://dudusoar.github.io/posts/llm-system-architecture/03-schema-design-facts-and-judgment/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/03-schema-design-facts-and-judgment/</guid><description>A schema preserves the boundary between computed facts, model judgments, explicit rationale, and external feedback.</description></item><item><title>What a Noisy Iteration Needs in Order to Converge</title><link>https://dudusoar.github.io/posts/stochastic-approximation/03-what-convergence-requires/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/03-what-convergence-requires/</guid><description>A compact map of the step-size and noise assumptions behind stochastic-approximation convergence.</description></item><item><title>Separate Plausible Environments from LLM Task Distributions</title><link>https://dudusoar.github.io/posts/llm-system-architecture/04-environments-and-task-distributions/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/04-environments-and-task-distributions/</guid><description>Reliable evaluation separates plausible executable environments from meaningful LLM task distributions.</description></item><item><title>What the Step Size Really Means</title><link>https://dudusoar.github.io/posts/stochastic-approximation/04-what-the-step-size-means/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/04-what-the-step-size-means/</guid><description>The step size is simultaneously a movement ratio, a trust coefficient, and a weight on new information.</description></item><item><title>Treat the Prompt as a Decision Interface, Not a State Dump</title><link>https://dudusoar.github.io/posts/llm-system-architecture/05-prompt-as-decision-interface/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/05-prompt-as-decision-interface/</guid><description>A prompt follows the order of an actual decision and keeps facts, memory, tools, actions, and runtime logic in separate layers.</description></item><item><title>Why the Step Size Must Stay Below One under Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/05-why-the-step-size-stays-below-one/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/05-why-the-step-size-stays-below-one/</guid><description>Step sizes between zero and one are the only range that combines monotone error contraction with attenuation of new noise.</description></item><item><title>Treat LLM Evidence Tools as Read-Only Interfaces</title><link>https://dudusoar.github.io/posts/llm-system-architecture/06-tools-as-read-only-evidence-interfaces/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/06-tools-as-read-only-evidence-interfaces/</guid><description>Evidence tools expose structured facts and deterministic calculations without making decisions on the model&amp;#39;s behalf.</description></item><item><title>Why Alpha Cannot Equal One Under Persistent Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/06-why-alpha-cannot-equal-one/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/06-why-alpha-cannot-equal-one/</guid><description>With alpha equal to one, every update discards history and inherits the full error of the latest noisy target.</description></item><item><title>The Same Step Size Behaves Differently with and without Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/07-noiseless-versus-noisy-updates/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/07-noiseless-versus-noisy-updates/</guid><description>Alpha equal to one is optimal for an exact target but accepts the full disturbance when the target is noisy.</description></item><item><title>Use the Action Space to Anchor LLM System Design</title><link>https://dudusoar.github.io/posts/llm-system-architecture/07-action-space-as-design-anchor/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/07-action-space-as-design-anchor/</guid><description>Define what an LLM is allowed to change before designing its schemas, prompts, tools, workflows, and memory.</description></item><item><title>A Memoryless Update Is Not the Same as Markov Sufficiency</title><link>https://dudusoar.github.io/posts/stochastic-approximation/08-memoryless-updates-and-markov-sufficiency/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/08-memoryless-updates-and-markov-sufficiency/</guid><description>An update can erase the previous iterate without becoming Markov; Markov sufficiency is a property of the chosen state.</description></item><item><title>Establish Fact Ownership and Evidence Provenance in LLM Systems</title><link>https://dudusoar.github.io/posts/llm-system-architecture/08-fact-ownership-and-provenance/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/08-fact-ownership-and-provenance/</guid><description>Every fact, interpretation, proposal, and outcome in an LLM system needs a clear owner and a traceable evidence lineage.</description></item><item><title>Expectation and Variance Explain Why History Stabilizes an Update</title><link>https://dudusoar.github.io/posts/stochastic-approximation/09-expectation-and-variance-of-two-updates/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/09-expectation-and-variance-of-two-updates/</guid><description>A direct derivation compares memoryless and history-preserving updates under zero-mean finite-variance noise.</description></item><item><title>Share Only Modules Whose Meaning Survives a Method Change</title><link>https://dudusoar.github.io/posts/llm-system-architecture/09-share-only-stable-meaning/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/09-share-only-stable-meaning/</guid><description>Share code across LLM methods only when its meaning, lifecycle, failure handling, and tests remain unchanged.</description></item><item><title>Give Every Decision Point a Shared Information Boundary</title><link>https://dudusoar.github.io/posts/llm-system-architecture/10-shared-information-boundary/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/10-shared-information-boundary/</guid><description>Fair online comparison requires every method to decide from the same semantic snapshot and the same boundary on future information.</description></item><item><title>What the Noise Assumptions Actually Buy Us</title><link>https://dudusoar.github.io/posts/stochastic-approximation/10-what-noise-assumptions-buy-us/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/10-what-noise-assumptions-buy-us/</guid><description>Zero mean, finite variance, independence, and identical distribution each support a different part of noise averaging.</description></item><item><title>Alpha Equal to One Requires the Noise to Vanish</title><link>https://dudusoar.github.io/posts/stochastic-approximation/11-alpha-one-requires-vanishing-noise/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/11-alpha-one-requires-vanishing-noise/</guid><description>If every update fully replaces the current position, convergence requires the river-location judgment error itself to disappear.</description></item><item><title>Use Only Observable and Executable Training Targets</title><link>https://dudusoar.github.io/posts/llm-system-architecture/11-observable-and-executable-training-targets/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/llm-system-architecture/11-observable-and-executable-training-targets/</guid><description>A strong teacher result is a valid target only when the model can observe its basis and execute the same action.</description></item><item><title>The Robbins–Monro Conditions Balance Learning and Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/12-robbins-monro-conditions/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/12-robbins-monro-conditions/</guid><description>The step sizes must remain large enough to keep correcting error and become small enough to suppress accumulated noise.</description></item><item><title>Why the Step Sizes Must Sum to Infinity</title><link>https://dudusoar.github.io/posts/stochastic-approximation/13-why-step-sizes-must-sum-to-infinity/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/13-why-step-sizes-must-sum-to-infinity/</guid><description>A finite total step size can make an iteration stop moving before its error has disappeared.</description></item><item><title>Why the Squared Step Sizes Must Be Summable</title><link>https://dudusoar.github.io/posts/stochastic-approximation/14-why-squared-step-sizes-must-be-summable/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/14-why-squared-step-sizes-must-be-summable/</guid><description>For a changing step-size sequence, square summability bounds the total variance injected by noisy observations.</description></item><item><title>Dvoretzky's Theorem Turns Noisy Contraction into Pathwise Convergence</title><link>https://dudusoar.github.io/posts/stochastic-approximation/15-dvoretzky-convergence-theorem/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/15-dvoretzky-convergence-theorem/</guid><description>Dvoretzky generalizes the stochastic-approximation error recursion and gives conditions for almost-sure convergence.</description></item><item><title>Square the Error to Turn Convergence into Energy Dissipation</title><link>https://dudusoar.github.io/posts/stochastic-approximation/16-square-error-as-energy/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/16-square-error-as-energy/</guid><description>The Dvoretzky proof tracks squared error, shows that its positive drift is summable, and rules out a positive limiting energy.</description></item><item><title>A Second Proof Route Starts from Expectation and Variance</title><link>https://dudusoar.github.io/posts/stochastic-approximation/17-expectation-variance-proof-route/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/17-expectation-variance-proof-route/</guid><description>Expanding the recursion explains how initial error and historical noise decay, but usually yields convergence in probability rather than almost-sure convergence.</description></item><item><title>Expand the Error into Initial Bias and Historical Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/18-expanding-the-error-recursion/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/18-expanding-the-error-recursion/</guid><description>The explicit error formula separates the residual initial condition from the weighted sum of all past disturbances.</description></item><item><title>How the Initial Error Disappears in Expectation</title><link>https://dudusoar.github.io/posts/stochastic-approximation/19-how-initial-error-disappears-in-expectation/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/19-how-initial-error-disappears-in-expectation/</guid><description>Zero-mean noise removes the disturbance terms from the expectation, leaving a product that vanishes when the step sizes sum to infinity.</description></item><item><title>How Historical Noise Is Attenuated</title><link>https://dudusoar.github.io/posts/stochastic-approximation/20-how-noise-variance-decays/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/20-how-noise-variance-decays/</guid><description>Each disturbance is controlled twice: by its entry coefficient and by every contraction that follows it.</description></item><item><title>Why Mean-Square Analysis Stops at Convergence in Probability</title><link>https://dudusoar.github.io/posts/stochastic-approximation/21-why-mean-square-analysis-stops-at-probability/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/21-why-mean-square-analysis-stops-at-probability/</guid><description>Vanishing expectation and variance control each time slice, but they do not directly control the shape of an infinite sample path.</description></item><item><title>Two Proof Routes Explain Different Levels of Convergence</title><link>https://dudusoar.github.io/posts/stochastic-approximation/22-two-proof-routes-to-dvoretzky-convergence/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/22-two-proof-routes-to-dvoretzky-convergence/</guid><description>Expectation and variance explain distributional concentration; the energy and martingale route proves almost-sure convergence.</description></item><item><title>sdr-sidewalk-sim: Pedestrian-Aware Sidewalk Delivery Robot Simulator</title><link>https://dudusoar.github.io/projects/sdr-sidewalk-sim/</link><pubDate>Wed, 10 Jun 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/projects/sdr-sidewalk-sim/</guid><description>A research simulator for studying how pedestrian-aware sidewalk conditions affect delivery robot routing, dispatch, replay, and validation.</description></item><item><title>A Generative Model Is Like a Database: Decomposition Defines Its Schema</title><link>https://dudusoar.github.io/posts/generative-models-database/</link><pubDate>Mon, 08 Jun 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/generative-models-database/</guid><description>A database analogy reveals why generative models need data decomposition and why unit granularity determines what they can learn and generate.</description></item><item><title>Yellowstone</title><link>https://dudusoar.github.io/photos/yellowstone/</link><pubDate>Sat, 23 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/yellowstone/</guid><description>A small Yellowstone photo set.</description></item><item><title>Arches</title><link>https://dudusoar.github.io/photos/arches/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/arches/</guid><description>A small Arches photo set.</description></item><item><title>California Highway 1</title><link>https://dudusoar.github.io/photos/california-highway-1/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/california-highway-1/</guid><description>A small California Highway 1 photo set.</description></item><item><title>Canyonlands</title><link>https://dudusoar.github.io/photos/canyonlands/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/canyonlands/</guid><description>A small Canyonlands photo set.</description></item><item><title>Monument Valley</title><link>https://dudusoar.github.io/photos/monument-valley/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/monument-valley/</guid><description>A small Monument Valley photo set.</description></item><item><title>Sequoia</title><link>https://dudusoar.github.io/photos/sequoia/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/sequoia/</guid><description>A small Sequoia photo set.</description></item><item><title>Washington, DC</title><link>https://dudusoar.github.io/photos/dc/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/dc/</guid><description>A small Washington, DC photo set.</description></item><item><title>Zion</title><link>https://dudusoar.github.io/photos/zion/</link><pubDate>Fri, 22 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/zion/</guid><description>A small Zion National Park photo set.</description></item><item><title>Bryce Canyon</title><link>https://dudusoar.github.io/photos/bryce-canyon/</link><pubDate>Thu, 21 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/bryce-canyon/</guid><description>A small Bryce Canyon photo set.</description></item><item><title>CV</title><link>https://dudusoar.github.io/cv/</link><pubDate>Thu, 21 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/cv/</guid><description>&lt;p&gt;My current resume highlights LLM agents, machine learning, optimization, and simulation, including my Applied Scientist internship at Amazon and research on tool-using agents for dynamic fleet assignment.&lt;/p&gt;
&lt;div class="cv-preview-actions"&gt;
&lt;a href="https://dudusoar.github.io/cv.pdf" target="_blank" rel="noopener"&gt;Open PDF&lt;/a&gt;
&lt;a href="https://dudusoar.github.io/cv.pdf" download&gt;Download PDF&lt;/a&gt;
&lt;/div&gt;
&lt;iframe class="cv-preview-frame" src="https://dudusoar.github.io/cv.pdf#toolbar=1&amp;navpanes=0" title="Yuchen Du CV"&gt;&lt;/iframe&gt;</description></item><item><title>Glacier</title><link>https://dudusoar.github.io/photos/glacier/</link><pubDate>Thu, 21 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/glacier/</guid><description>A small Glacier National Park photo set.</description></item><item><title>Great Smoky</title><link>https://dudusoar.github.io/photos/great-smoky/</link><pubDate>Thu, 21 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/great-smoky/</guid><description>A small Great Smoky Mountains photo set.</description></item><item><title>Yosemite</title><link>https://dudusoar.github.io/photos/yosemite/</link><pubDate>Thu, 21 May 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/photos/yosemite/</guid><description>A small Yosemite photo set.</description></item><item><title>We Understand the World by Building Maps</title><link>https://dudusoar.github.io/posts/mapping-as-epistemology/</link><pubDate>Mon, 30 Mar 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/mapping-as-epistemology/</guid><description>Why the same event becomes different internal inputs — and why scientific theories are maps of observable phenomena rather than reality itself.</description></item><item><title>Reviewing the Reviewer: Graph-Enhanced LLMs for E-commerce Appeal Adjudication</title><link>https://dudusoar.github.io/papers/amazon-rj/</link><pubDate>Thu, 26 Feb 2026 20:00:00 -0500</pubDate><guid>https://dudusoar.github.io/papers/amazon-rj/</guid><description>A two-stage LLM agent that uses RAG with graph-based memory to ground fraud-related seller-appeal recommendations in evidence, verification actions, and historical human corrections.</description></item><item><title>Designing Sidewalk Delivery Robot Fleets Under Uncertainty</title><link>https://dudusoar.github.io/papers/sdr-two-stage/</link><pubDate>Mon, 12 Jan 2026 10:00:00 -0500</pubDate><guid>https://dudusoar.github.io/papers/sdr-two-stage/</guid><description>A two-stage stochastic optimization framework for fleet and battery sizing of sidewalk delivery robots under uncertain demand.</description></item><item><title>Understanding Social Perceptions of Sidewalk Delivery Robots via YouTube Sentiment Analysis</title><link>https://dudusoar.github.io/papers/youtube-sc/</link><pubDate>Thu, 08 Jan 2026 10:00:00 -0500</pubDate><guid>https://dudusoar.github.io/papers/youtube-sc/</guid><description>A data-driven study leveraging YouTube comments to uncover public perceptions, safety concerns, and social acceptance of sidewalk delivery robots.</description></item><item><title>About</title><link>https://dudusoar.github.io/about/</link><pubDate>Sun, 28 Dec 2025 19:34:39 -0500</pubDate><guid>https://dudusoar.github.io/about/</guid><description>&lt;p&gt;I&amp;rsquo;m a Ph.D. candidate in Industrial Engineering Technology at Purdue University, expecting to graduate in December 2026. I build reliable LLM agents and decision systems at the intersection of machine learning, optimization, and simulation.&lt;/p&gt;
&lt;p&gt;My current research studies tool-using LLM agents for dynamic fleet assignment. At each decision point, an agent examines real-time request and fleet information, then assigns requests to vehicles while balancing service quality and operating efficiency across different spatial and temporal demand patterns. My broader research covers stochastic fleet and battery sizing, routing, large-scale system design, NLP-based social perception, and mobility simulation.&lt;/p&gt;</description></item></channel></rss>