Weiwei Ma
Author directory2026
ActiveMedAgent: Cost-Aware Trajectory Learning for Multimodal Medical Diagnosis
Weiwei Ma | Xiaobing Yu | Peijie Qiu | Jin Yang | Zhaoqi An | Xuanzhao Dong | Xiaoqi Zhao | Xiaofeng Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
Weiwei Ma | Xiaobing Yu | Peijie Qiu | Jin Yang | Zhaoqi An | Xuanzhao Dong | Xiaoqi Zhao | Xiaofeng Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
Clinical diagnosis is inherently sequential: clinicians escalate from cheap to costly tests only when additional evidence is expected to resolve diagnostic uncertainty. We present ActiveMedAgent, a framework that brings this cost-aware sequential logic to multimodal medical AI. Given a frozen, API-accessed vision-language model, ActiveMedAgent probability distributions over candidate diagnoses induced each acquisition by its per-step diagnostic utility minus cost. A lightweight MLP controller is then trained offline on these scored trajectories, learning when to request additional evidence and when to commit. Across three commonly used benchmarks, trajectory-based policy learning consistently outperforms both unguided acquisition and full-modality baselines. Notably, we identify an information overload effect. In 175 cases, the agent produces a correct diagnosis with fewer channels while the full-modality baseline fails, showing that learning what to omit can be as important as learning what to acquire
LadderEdit: Edit-Level Residual Compression for Memory-Efficient Lifelong Editing of LLMs
Xiaobing Yu | Peijie Qiu | Jin Yang | Xuanzhao Dong | Weiwei Ma | Zhaoqi An | Xiaoqi Zhao | Xiaofeng Liu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Xiaobing Yu | Peijie Qiu | Jin Yang | Xuanzhao Dong | Weiwei Ma | Zhaoqi An | Xiaoqi Zhao | Xiaofeng Liu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Lifelong editing of LLMs requires storing thousands of edits after acquisition. A widely used family of approaches attaches one LoRA adapter per edit, which preserves behavior but grows linearly in storage. To address this challenge, we propose LadderEdit, a method that compresses each LoRA adapter after it is acquired. Each edit is first stored at low rank as a cheap sketch. We then check whether this sketch still satisfies the rewrite, generalization, and locality contract on probe prompts. Edits that pass keep the sketch; those that fail are promoted to a higher rank along a ladder until the contract is met. Because every edit retains some representation, coverage is maintained, and only hard edits consume more rank. Across ZsRE, CounterFact, and WikiBigEdit benchmarks on LLaMA-3-8B, Mistral-7B, and Qwen2.5-7B, LadderEdit tracks exact LoRA storage at 5.2× less memory and remains effective at 50,000 sequential edits.