<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>LLM Agents |</title><link>https://ohsono.github.io/tags/llm-agents/</link><atom:link href="https://ohsono.github.io/tags/llm-agents/index.xml" rel="self" type="application/rss+xml"/><description>LLM Agents</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 30 Sep 2026 00:00:00 +0000</lastBuildDate><image><url>https://ohsono.github.io/media/icon_hu_eee4a95885829ab2.png</url><title>LLM Agents</title><link>https://ohsono.github.io/tags/llm-agents/</link></image><item><title>Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell</title><link>https://ohsono.github.io/publications/coapkv-mlforsys2026/</link><pubDate>Wed, 30 Sep 2026 00:00:00 +0000</pubDate><guid>https://ohsono.github.io/publications/coapkv-mlforsys2026/</guid><description/></item><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><item><title>Synthony</title><link>https://ohsono.github.io/projects/synthony/</link><pubDate>Tue, 31 Mar 2026 00:00:00 +0000</pubDate><guid>https://ohsono.github.io/projects/synthony/</guid><description>&lt;p&gt;An agent that recommends the best-fit tabular generative model (GAN / VAE /
Diffusion / DP-based / Bayesian / Normalizing Flow) for a given dataset by
profiling its &amp;ldquo;stress&amp;rdquo; characteristics — privacy sensitivity, class imbalance,
cardinality, sample size — instead of defaulting to one architecture. Implements
rule-based, LLM-based, and hybrid ranking strategies with explainable
tie-breaking and benchmark-driven comparison. Published at ICLR 2026 DeLTA.&lt;/p&gt;</description></item><item><title>SYNTHONY: A Stress-Aware, Intent-Conditioned Agent for Deep Tabular Generative Models Selection</title><link>https://ohsono.github.io/publications/synthony/</link><pubDate>Tue, 31 Mar 2026 00:00:00 +0000</pubDate><guid>https://ohsono.github.io/publications/synthony/</guid><description>&lt;p&gt;&lt;strong&gt;SYNTHONY&lt;/strong&gt; treats synthesizer selection as a matching problem: it profiles a
dataset&amp;rsquo;s &amp;ldquo;stress&amp;rdquo; — privacy sensitivity, class imbalance, cardinality, and
sample size — and matches that profile against a calibrated capability registry
of synthesizer families (GAN, VAE, Diffusion, DP-based, Bayesian, Normalizing
Flow). It supports rule-based, LLM-based, and hybrid ranking with explainable
tie-breaking and benchmark-driven comparison.&lt;/p&gt;</description></item></channel></rss>