Weihuang
Author directoryAlso published as: Wei Huang
Other people with similar names: Wei Huang, Wei Huang, Wei Huang, Wei Huang
Unverified author pages with similar names: Wei Huang
2026
Taming the Thinker: Conditional Entropy Shaping for Adaptive LLM Reasoning
Shuyu Wei | Jian Sun | Delai Qiu | Yining Wang | Shengping Liu | Jerry Liang | Ying Fu | Wei Huang | Jitao Sang
Findings of the Association for Computational Linguistics: EMNLP 2026
Shuyu Wei | Jian Sun | Delai Qiu | Yining Wang | Shengping Liu | Jerry Liang | Ying Fu | Wei Huang | Jitao Sang
Findings of the Association for Computational Linguistics: EMNLP 2026
Entropy-based deep reasoning has emerged as a promising direction for improving the reasoning capabilities of Large Language Models (LLMs), but existing methods often either increase response length indiscriminately or shorten responses at the cost of accuracy. To better balance this trade-off, we introduce Conditional Entropy Shaping (CES), a framework that dynamically controls token-level response entropy, enabling LLMs to produce concise solutions on simple problems while encouraging deeper exploration on hard ones. Built on DAPO, CES uses token-level entropy as an uncertainty signal and applies a conditional bidirectional policy: it penalizes high-entropy "forking point" tokens on correct reasoning paths to improve conciseness, and rewards them on incorrect paths to encourage exploration and error correction. We implement CES on DeepSeek-R1-Distill-Qwen-7B and evaluate it on 12 mathematical benchmarks. CES consistently improves average accuracy while reducing response length relative to DAPO, and supplementary experiments show similar trends on a smaller 1.5B backbone and on out-of-domain benchmarks.
FocalOrder: Focal Preference Optimization for Reading Order Detection
Fuyuan Liu | Dianyu Yu | He Ren | Nayu Liu | Xiaomian Kang | Delai Qiu | Fa Zhang | Genpeng Zhen | Shengping Liu | Liang Jiaen | Weihuang | Yining Wang | Junnan Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Fuyuan Liu | Dianyu Yu | He Ren | Nayu Liu | Xiaomian Kang | Delai Qiu | Fa Zhang | Genpeng Zhen | Shengping Liu | Liang Jiaen | Weihuang | Yining Wang | Junnan Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Reading order detection is the foundation of document understanding.Most existing methods rely on uniform supervision, implicitly assuming a constant difficulty distribution across layout regions. In this work, we challenge this assumption by revealing a critical flaw: Positional Disparity, a phenomenon where models demonstrate mastery over the deterministic start and end regions but suffer a performance collapse in the complex intermediate sections.This degradation arises because standard training allows the massive volume of easy patterns to drown out the learning signals from difficult layouts.To address this, we propose FocalOrder, a framework driven by Focal Preference Optimization (FPO).Specifically, FocalOrder employs adaptive difficulty discovery with exponential moving average mechanism to dynamically pinpoint hard-to-learn transitions, while introducing a difficulty-calibrated pairwise ranking objective to enforce global logical consistency.Extensive experiments demonstrate that FocalOrder establishes new state-of-the-art results on OmniDocBench v1.0 and Comp-HRDoc.Our compact model not only outperforms competitive specialized baselines but also significantly surpasses large-scale general VLMs.These results demonstrate that aligning the optimization with intrinsic structural ambiguity of documents is critical for mastering complex document structures.
GuideTree: Guideline-Induced Review Trees for Long Medical Records
Chengze Ge | Ruiqing Zhang | Yining Wang | Shengping Liu | Liang Jiaen | Weihuang | Weihua Chen
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 6: Industry Track)
Chengze Ge | Ruiqing Zhang | Yining Wang | Shengping Liu | Liang Jiaen | Weihuang | Weihua Chen
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 6: Industry Track)
Reviewing medical records for clinical and insurance decisions must handle long, heterogeneous documents while producing consistent, traceable, guideline-compliant outcomes under strict latency and cost constraints. We propose GuideTree, which compiles textual guidelines into a fixed review tree of evidence-grounded verification primitives. GuideTree uses short per-document summaries only for routing each check to a minimal set of document types and candidates; final verification always reads full document text and returns structured evidence. The tree is induced offline via a cost-aware split-and-prune search and updated safely through regression-tested, versioned patches. Across 1,000 cases from four industrial review scenarios and four LLM backbones, GuideTree achieves 84.5–92.8 Macro-F1, outperforming the strongest non-expert baselines by 3.3–7.6 points and matching ExpertTree within 0.2–0.6 points (avg. 0.38). On chronic disease with Qwen3-235B-A22B-Instruct, GuideTree reduces average I/O volume to 74K input+output characters (-82% vs. long-context prompting) and average latency to 22s (-83% vs. long-context prompting), while reaching 99% decision consistency over K=5 reruns.