<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Preprint | Xi Zhang</title><link>https://x-izhang.github.io/publication_types/preprint/</link><atom:link href="https://x-izhang.github.io/publication_types/preprint/index.xml" rel="self" type="application/rss+xml"/><description>Preprint</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 29 May 2026 00:00:00 +0000</lastBuildDate><image><url>https://x-izhang.github.io/media/icon_hu134860076176174952.png</url><title>Preprint</title><link>https://x-izhang.github.io/publication_types/preprint/</link></image><item><title>CCS: Clinical Consensus Selection for Radiology Report Generation</title><link>https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/</link><pubDate>Fri, 29 May 2026 00:00:00 +0000</pubDate><guid>https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/</guid><description>&lt;div class="flex px-4 py-3 mb-6 rounded-md bg-primary-100 dark:bg-primary-900">
&lt;span class="pr-3 pt-1 text-primary-600 dark:text-primary-300">
&lt;svg height="24" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24">&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="1.5" d="m11.25 11.25l.041-.02a.75.75 0 0 1 1.063.852l-.708 2.836a.75.75 0 0 0 1.063.853l.041-.021M21 12a9 9 0 1 1-18 0a9 9 0 0 1 18 0m-9-3.75h.008v.008H12z"/>&lt;/svg>
&lt;/span>
&lt;span class="dark:text-neutral-300">For the latest updates and details, visit the &lt;a href="https://x-izhang.github.io/CCS/" target="_blank" rel="noopener">CCS Project Website&lt;/a>.&lt;/span>
&lt;/div>
&lt;h2 id="why-ccs-">Why CCS? 🔬&lt;/h2>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/figure_1.png">
&lt;/figure>
&lt;p>Most radiology MLLMs commit to a &lt;strong>single decoded report&lt;/strong> token by token, so one unfavourable step can omit a finding or assert one unsupported by the image, with no way to recover. Yet a fixed model often places &lt;strong>clinically stronger reports elsewhere in its candidate pool&lt;/strong> — the bottleneck is not what the model can generate, but &lt;strong>which candidate it commits to&lt;/strong>.&lt;/p>
&lt;h2 id="how-ccs-works-">How CCS Works ⚙️&lt;/h2>
&lt;p>&lt;strong>Clinical Consensus Selection (CCS)&lt;/strong> is a &lt;em>reference-free&lt;/em>, &lt;em>decoder-agnostic&lt;/em> inference-time framework that reframes RRG as candidate selection — no retraining or extra parameters.&lt;/p>
&lt;ul>
&lt;li>&lt;strong>Rollout sampling&lt;/strong>: draw &lt;em>N&lt;/em> candidate reports from the radiology MLLM via stochastic decoding.&lt;/li>
&lt;li>&lt;strong>Textual consensus utility&lt;/strong>: repurpose report-evaluation metrics as reference-free pairwise agreement scores.&lt;/li>
&lt;li>&lt;strong>Image-grounded utility&lt;/strong>: measure candidate agreement with &lt;strong>Qwen3-VL-Embed&lt;/strong>, a multimodal embedder adapted on image–report pairs, capturing clinical agreement beyond surface text.&lt;/li>
&lt;li>&lt;strong>Highest-consensus selection&lt;/strong>: return the candidate with the highest &lt;em>mean&lt;/em> pairwise consensus over the pool.&lt;/li>
&lt;/ul>
&lt;h2 id="key-contributions-">Key Contributions ✨&lt;/h2>
&lt;ul>
&lt;li>&lt;strong>Inference-time perspective&lt;/strong>: We show candidate pools routinely contain reports with &lt;strong>higher clinical reliability and consistency&lt;/strong> than single-path outputs.&lt;/li>
&lt;li>&lt;strong>CCS framework&lt;/strong>: A &lt;strong>decoder-agnostic Best-of-N&lt;/strong> method that aggregates pairwise clinical consensus using both &lt;strong>textual&lt;/strong> and &lt;strong>image–report-adapted multimodal&lt;/strong> utilities.&lt;/li>
&lt;li>&lt;strong>Consistent gains&lt;/strong>: Across &lt;strong>three datasets&lt;/strong> and &lt;strong>multiple radiology MLLMs&lt;/strong>, CCS improves RRG at inference time and identifies image-grounded utility as a &lt;strong>distinct selection axis&lt;/strong>.&lt;/li>
&lt;/ul>
&lt;h2 id="main-results-">Main Results 📈&lt;/h2>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/table_1.png">
&lt;/figure>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/table_2.png">
&lt;/figure>
&lt;p>On MIMIC-CXR, CCS improves &lt;strong>all&lt;/strong> radiology-specific metrics over Sampling (e.g. RadGraph-F1 &lt;strong>0.1989 → 0.2134&lt;/strong>, CheXbert-F1⁵ &lt;strong>0.5041 → 0.5370&lt;/strong>), with gains statistically significant (&lt;em>p&lt;/em> &amp;lt; 0.05). Unlike generic Best-of-N selectors (Self-Certainty, ModeX) that give inconsistent or negative clinical gains, CCS improves &lt;strong>consistently across all backbones and datasets&lt;/strong>.&lt;/p>
&lt;h2 id="analysis-">Analysis 📊&lt;/h2>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/figure_3.png">
&lt;/figure>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/table_3.png">
&lt;/figure>
&lt;p>Per-label F1 shows CCS recovers abnormal findings that text-only consensus suppresses — confirming that &lt;strong>image-grounded utility is a selection axis distinct from textual consensus&lt;/strong>, with substantial headroom still remaining.&lt;/p>
&lt;h2 id="case-study-">Case Study 🔍&lt;/h2>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/zhang-2026-ccsclinicalconsensusselection/case_study.png">
&lt;/figure>
&lt;p>On a real MIMIC-CXR case, single-path decoding asserts factual errors (false &amp;ldquo;clear lungs&amp;rdquo;, mislocalised catheter), whereas CCS selects a more &lt;strong>image-grounded&lt;/strong> report (CheXbert-F1⁵ &lt;strong>1.0000&lt;/strong> vs Sampling &lt;strong>0.5000&lt;/strong>).&lt;/p>
&lt;h2 id="bibtex-">BibTeX 📚&lt;/h2>
&lt;div class="highlight">&lt;pre tabindex="0" class="chroma">&lt;code class="language-bibtex" data-lang="bibtex">&lt;span class="line">&lt;span class="cl">&lt;span class="nc">@article&lt;/span>&lt;span class="p">{&lt;/span>&lt;span class="nl">zhang2026ccsclinicalconsensusselection&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">title&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{CCS: Clinical Consensus Selection for Radiology Report Generation}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">author&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{Xi Zhang and Yingshu Li and Zaiqiao Meng and Jake Lever and Edmond S. L. Ho}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">year&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{2026}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">eprint&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{2605.30131}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">archivePrefix&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{arXiv}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">primaryClass&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{cs.CL}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">url&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{https://arxiv.org/abs/2605.30131}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl">&lt;span class="p">}&lt;/span>
&lt;/span>&lt;/span>&lt;/code>&lt;/pre>&lt;/div></description></item><item><title>EvoScientist: Towards Multi-Agent Evolving AI Scientists for End-to-End Scientific Discovery</title><link>https://x-izhang.github.io/publication/lyu-2026-evoscientist/</link><pubDate>Mon, 09 Mar 2026 00:00:00 +0000</pubDate><guid>https://x-izhang.github.io/publication/lyu-2026-evoscientist/</guid><description>&lt;div class="flex px-4 py-3 mb-6 rounded-md bg-primary-100 dark:bg-primary-900">
&lt;span class="pr-3 pt-1 text-primary-600 dark:text-primary-300">
&lt;svg height="24" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24">&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="1.5" d="m11.25 11.25l.041-.02a.75.75 0 0 1 1.063.852l-.708 2.836a.75.75 0 0 0 1.063.853l.041-.021M21 12a9 9 0 1 1-18 0a9 9 0 0 1 18 0m-9-3.75h.008v.008H12z"/>&lt;/svg>
&lt;/span>
&lt;span class="dark:text-neutral-300">&lt;p>Part of the &lt;a href="https://evoscientist.ai/" target="_blank" rel="noopener">EvoScientist&lt;/a> project — harnessing vibe research with self-evolving AI scientists.&lt;/p>
&lt;p>Extend it with &lt;a href="https://github.com/EvoScientist/EvoSkills" target="_blank" rel="noopener">EvoSkills&lt;/a> — installable skill &amp;amp; knowledge packs that add domain-specific expertise to AI scientists.&lt;/p>
&lt;/span>
&lt;/div>
&lt;h2 id="overview">Overview&lt;/h2>
&lt;p>&lt;strong>EvoScientist&lt;/strong> is an evolving multi-agent AI scientist framework that continuously improves its research strategies through &lt;strong>persistent memory&lt;/strong> and &lt;strong>self-evolution&lt;/strong>. It addresses a key limitation of existing AI-scientist systems: static, hand-designed pipelines that overlook promising directions, repeat failed experiments, and pursue infeasible ideas.&lt;/p>
&lt;h2 id="framework">Framework&lt;/h2>
&lt;p>EvoScientist coordinates three specialized agents:&lt;/p>
&lt;ul>
&lt;li>&lt;strong>Researcher Agent (RA):&lt;/strong> scientific idea generation.&lt;/li>
&lt;li>&lt;strong>Engineer Agent (EA):&lt;/strong> experiment implementation and execution.&lt;/li>
&lt;li>&lt;strong>Evolution Manager Agent (EMA):&lt;/strong> distills insights from prior interactions into reusable knowledge.&lt;/li>
&lt;/ul>
&lt;p>These are backed by two persistent memory modules — an &lt;strong>ideation memory&lt;/strong> (feasible directions distilled from top-ranked ideas, plus previously unsuccessful ones) and an &lt;strong>experimentation memory&lt;/strong> (effective data-processing and training strategies from code-search trajectories and best-performing implementations) — which the RA and EA retrieve to improve idea quality and code execution success over time.&lt;/p>
&lt;h2 id="key-results">Key Results&lt;/h2>
&lt;ul>
&lt;li>Outperforms &lt;strong>7 open-source and commercial state-of-the-art systems&lt;/strong> in scientific idea generation, with higher &lt;strong>novelty, feasibility, relevance, and clarity&lt;/strong> under both automatic and human evaluation.&lt;/li>
&lt;li>Substantially improves &lt;strong>code execution success rates&lt;/strong> through multi-agent evolution, demonstrating the effectiveness of persistent memory for end-to-end scientific discovery.&lt;/li>
&lt;/ul>
&lt;h2 id="bibtex">BibTeX&lt;/h2>
&lt;div class="highlight">&lt;pre tabindex="0" class="chroma">&lt;code class="language-bibtex" data-lang="bibtex">&lt;span class="line">&lt;span class="cl">&lt;span class="nc">@article&lt;/span>&lt;span class="p">{&lt;/span>&lt;span class="nl">lyu2026evoscientist&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">title&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{EvoScientist: Towards Multi-Agent Evolving AI Scientists for End-to-End Scientific Discovery}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">author&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{Lyu, Yougang and Zhang, Xi and Yi, Xinhao and Zhao, Yuyue and Guo, Shuyu and Hu, Wenxiang and Piotrowski, Jan and Kaliski, Jakub and Urbani, Jacopo and Meng, Zaiqiao and others}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">journal&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{arXiv preprint arXiv:2603.08127}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">year&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{2026}&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl">&lt;span class="p">}&lt;/span>
&lt;/span>&lt;/span>&lt;/code>&lt;/pre>&lt;/div></description></item><item><title>A Comprehensive Survey of Self-Evolving AI Agents: A New Paradigm Bridging Foundation Models and Lifelong Agentic Systems</title><link>https://x-izhang.github.io/publication/fang-2025-comprehensivesurveyselfevolvingai/</link><pubDate>Sun, 10 Aug 2025 00:00:00 +0000</pubDate><guid>https://x-izhang.github.io/publication/fang-2025-comprehensivesurveyselfevolvingai/</guid><description>&lt;div class="flex px-4 py-3 mb-6 rounded-md bg-primary-100 dark:bg-primary-900">
&lt;span class="pr-3 pt-1 text-primary-600 dark:text-primary-300">
&lt;svg height="24" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24">&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="1.5" d="m11.25 11.25l.041-.02a.75.75 0 0 1 1.063.852l-.708 2.836a.75.75 0 0 0 1.063.853l.041-.021M21 12a9 9 0 1 1-18 0a9 9 0 0 1 18 0m-9-3.75h.008v.008H12z"/>&lt;/svg>
&lt;/span>
&lt;span class="dark:text-neutral-300">For the latest updates and details, visit the &lt;a href="https://github.com/EvoAgentX/Awesome-Self-Evolving-Agents" target="_blank" rel="noopener">Awesome Self-Evolving Agents&lt;/a>.&lt;/span>
&lt;/div>
&lt;h2 id="background-and-development-trends">Background and Development Trends&lt;/h2>
&lt;p>This survey provides a comprehensive overview of the latest advances in the field of &lt;strong>self-evolving AI agents&lt;/strong>, highlighting key technological shifts and development trends.&lt;/p>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/fang-2025-comprehensivesurveyselfevolvingai/figure_2.png">
&lt;/figure>
&lt;h2 id="paradigm-definition">Paradigm Definition&lt;/h2>
&lt;p>We define the new paradigm of &amp;ldquo;Self-Evolving AI Agents&amp;rdquo; as bridging foundation models and lifelong agentic systems.&lt;/p>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/fang-2025-comprehensivesurveyselfevolvingai/table_1.png">
&lt;/figure>
&lt;h2 id="concept-definition-of-self-evolving-ai-agents">Concept Definition of Self-Evolving AI Agents&lt;/h2>
&lt;blockquote>
&lt;p>&lt;strong>Self-evolving AI agents are autonomous systems that continuously and systematically optimise their internal components through interaction with environments, with the goal of adapting to changing tasks, contexts and resources while preserving safety and enhancing performance.&lt;/strong>&lt;/p>
&lt;/blockquote>
&lt;h2 id="guiding-principles-three-laws">Guiding Principles: Three Laws&lt;/h2>
&lt;p>Inspired by Asimov&amp;rsquo;s Three Laws of Robotics, we propose the Three Laws of Self-Evolving AI Agents:&lt;/p>
&lt;ul>
&lt;li>&lt;strong>Endure (Safety Adaptation):&lt;/strong> Any modification must maintain safety and stability.&lt;/li>
&lt;li>&lt;strong>Excel (Performance Preservation):&lt;/strong> Subject to the first law, agents must preserve or enhance task performance.&lt;/li>
&lt;li>&lt;strong>Evolve (Autonomous Evolution):&lt;/strong> Subject to the first and second laws, agents must autonomously optimize their internal components in response to changes.&lt;/li>
&lt;/ul>
&lt;h2 id="unified-framework-and-technical-review">Unified Framework and Technical Review&lt;/h2>
&lt;p>We propose a unified conceptual framework with four core components: System Inputs, Agent System, Environment, and Optimisers. The survey systematically reviews evolution strategies across foundation models, prompts, memory, tools, workflows, and inter-agent communication.&lt;/p>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/fang-2025-comprehensivesurveyselfevolvingai/figure_3.png">
&lt;/figure>
&lt;h2 id="single-agent-optimisation">Single-Agent Optimisation&lt;/h2>
&lt;p>We explore optimisation techniques for individual self-evolving agents, focusing on methods that enhance their learning and adaptation capabilities.&lt;/p>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/fang-2025-comprehensivesurveyselfevolvingai/figure_4.png">
&lt;/figure>
&lt;h2 id="multi-agent-optimisation">Multi-Agent Optimisation&lt;/h2>
&lt;p>We investigate strategies for optimising the performance of multiple self-evolving agents working collaboratively, addressing challenges such as communication, coordination, and resource sharing.&lt;/p>
&lt;figure>&lt;img src="https://x-izhang.github.io/publication/fang-2025-comprehensivesurveyselfevolvingai/figure_5.png">
&lt;/figure>
&lt;h2 id="domain-adaptation-and-challenges">Domain Adaptation and Challenges&lt;/h2>
&lt;p>We also analyze domain-specific evolution methods in biomedicine, programming, and finance, and discuss key challenges in evaluation, safety, and ethics, laying the foundation for the next generation of adaptive, autonomous, lifelong agentic systems.&lt;/p>
&lt;h2 id="bibtex">BibTeX&lt;/h2>
&lt;div class="highlight">&lt;pre tabindex="0" class="chroma">&lt;code class="language-bibtex" data-lang="bibtex">&lt;span class="line">&lt;span class="cl">&lt;span class="nc">@article&lt;/span>&lt;span class="p">{&lt;/span>&lt;span class="nl">fang2025comprehensive&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">title&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{A comprehensive survey of self-evolving ai agents: A new paradigm bridging foundation models and lifelong agentic systems}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">author&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{Fang, Jinyuan and Peng, Yanwen and Zhang, Xi and Wang, Yingxu and Yi, Xinhao and Zhang, Guibin and Xu, Yi and Wu, Bin and Liu, Siwei and Li, Zihao and others}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">journal&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{arXiv preprint arXiv:2508.07407}&lt;/span>&lt;span class="p">,&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl"> &lt;span class="na">year&lt;/span>&lt;span class="p">=&lt;/span>&lt;span class="s">{2025}&lt;/span>
&lt;/span>&lt;/span>&lt;span class="line">&lt;span class="cl">&lt;span class="p">}&lt;/span>
&lt;/span>&lt;/span>&lt;/code>&lt;/pre>&lt;/div></description></item></channel></rss>