<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Inference Optimization |</title><link>https://ohsono.github.io/tags/inference-optimization/</link><atom:link href="https://ohsono.github.io/tags/inference-optimization/index.xml" rel="self" type="application/rss+xml"/><description>Inference Optimization</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jun 2026 00:00:00 +0000</lastBuildDate><image><url>https://ohsono.github.io/media/icon_hu_eee4a95885829ab2.png</url><title>Inference Optimization</title><link>https://ohsono.github.io/tags/inference-optimization/</link></image><item><title>Edge LLM Inference via Chain of Agents</title><link>https://ohsono.github.io/projects/edge-llm-inference/</link><pubDate>Mon, 01 Jun 2026 00:00:00 +0000</pubDate><guid>https://ohsono.github.io/projects/edge-llm-inference/</guid><description>&lt;p&gt;A Chain-of-Agents approach to memory-efficient large language model inference on
resource-constrained edge devices. Accepted as a poster at the NeurIPS 2026
Workshop on Machine Learning for Systems (MLForSys): &lt;em&gt;Persistent Memory in
Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell&lt;/em&gt;
(
).
Agent decomposition bounds peak KV cache per query about 60% below single-pass
and RAG baselines at accuracy parity; the persistent memory tier costs a little
cache and buys no measurable accuracy on single-question benchmarks.&lt;/p&gt;</description></item></channel></rss>