Wentao Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wentao Hu has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoyong Wei
Electronic Materials Research Laboratory, Key Laboratory of the Ministry of Education & International Center for Dielectric Research, School of Electronic Science and Engineering, Xi’an Jiaotong University, Xi’an 710049, China
3 shared publications Chen Jason Zhang
The Hong Kong Polytechnic University ♡ Sichuan University
2 shared publications- Qing Li
The Hong Kong Polytechnic University, Hong Kong, China
2 shared publications Wengyu Zhang
The Hong Kong Polytechnic University ♡ Sichuan University
2 shared publicationsXiaoyong Wei
2 shared publicationsYiyang Jiang
The Hong Kong Polytechnic University ♡ Sichuan University
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5898-5909
When Is Shallow Enough? Adaptive Split Federated Learning with Client-Specific Sufficiency Estimation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5898-5909
Open AccessWhen Is Shallow Enough? Adaptive Split Federated Learning with Client-Specific Sufficiency Estimation
- Open Access
- 24 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (4) , 1-27
TACO: Token-Aware Context Optimization for Structured OpenStreetMap Query Generation
Generating executable structured queries for OpenStreetMap (OSM) from natural language remains a challenging task due to the rigid syntax of OverpassQL and the steep learning curve it presents to end-users. While steering Large Language Models (LLMs) via demonstration contexts offers a promising solution, existing retrieval-based approaches typically neglect the critical constraint of token budgets. This oversight often leads to prohibitive inference costs and ignores the combinatorial nature of context selection, resulting in suboptimal performance. Furthermore, the lack of reliable benchmarks hinders rigorous evaluation in this domain. To address these challenges, we first introduce OsmNL , a robust benchmark curated via a human-in-the-loop pipeline to resolve alignment noise in prior datasets. Building upon this foundation, we formulate the construction of optimal demonstration contexts under constraints as a Budgeted Example Subset Mining ( BESM ) problem. We analyze BESM as an NP-hard optimization task that admits a submodular objective, theoretically balancing semantic relevance with structural diversity. Leveraging this property, we propose TACO ( T oken- A ware C ontext O ptimization), a principled framework that instantiates a family of budget-aware algorithms to navigate the trade-off between approximation guarantees and computational efficiency. Extensive experiments on OsmNL show that TACO establishes a new state-of-the-art, achieving superior accuracy compared to strong baselines while reducing token consumption by over 50%, thereby offering a robust and cost-efficient solution for large-scale geospatial query interfaces.
- 24 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (4) , 1-27
Open AccessTACO: Token-Aware Context Optimization for Structured OpenStreetMap Query Generation
Generating executable structured queries for OpenStreetMap (OSM) from natural language remains a challenging task due to the rigid syntax of OverpassQL and the steep learning curve it presents to end-users. While steering Large Language Models (LLMs) via demonstration contexts offers a promising solution, existing retrieval-based approaches typically neglect the critical constraint of token budgets. This oversight often leads to prohibitive inference costs and ignores the combinatorial nature of context selection, resulting in suboptimal performance. Furthermore, the lack of reliable benchmarks hinders rigorous evaluation in this domain. To address these challenges, we first introduce OsmNL , a robust benchmark curated via a human-in-the-loop pipeline to resolve alignment noise in prior datasets. Building upon this foundation, we formulate the construction of optimal demonstration contexts under constraints as a Budgeted Example Subset Mining ( BESM ) problem. We analyze BESM as an NP-hard optimization task that admits a submodular objective, theoretically balancing semantic relevance with structural diversity. Leveraging this property, we propose TACO ( T oken- A ware C ontext O ptimization), a principled framework that instantiates a family of budget-aware algorithms to navigate the trade-off between approximation guarantees and computational efficiency. Extensive experiments on OsmNL show that TACO establishes a new state-of-the-art, achieving superior accuracy compared to strong baselines while reducing token consumption by over 50%, thereby offering a robust and cost-efficient solution for large-scale geospatial query interfaces.
- Open Access
- 15 May 2026
- Published by MDPI AG in Preprints.org
A Survey of Agent Skills for Foundation-Model Agents: Concepts, Representations, Lifecycles, Evaluation, and Applications
Foundation-model agents now use reusable skills for tool use, long-horizon planning, and adaptation across related tasks. The term, however, is used loosely. It may describe a prompt package, an executable workflow, a learned routine, or an artifact distributed through a repository. That looseness makes it hard to compare methods, measure progress, or discuss security and governance with precision.We study agent skills as reusable and adaptive units of competence between model capability and situated task execution. The survey separates skills from nearby constructs such as prompts, tools, memory, and policies, then organizes the literature around representation, lifecycle and orchestration, evaluation, security and governance, and application domains. Across these areas, skill quality is only one part of the story. Useful skills also depend on abstraction choices, retrieval and composition mechanisms, ecosystem structure, and infrastructure security. We treat agent skills as a research object in their own right and identify open problems in automatic induction, cross-environment transfer, longitudinal evaluation, and trustworthy sharing in open agent ecosystems. A public paper list is available at https://github.com/JinhaoShen/awesome-agent-skill-papers.
- 15 May 2026
- Published by MDPI AG in Preprints.org
Open AccessA Survey of Agent Skills for Foundation-Model Agents: Concepts, Representations, Lifecycles, Evaluation, and Applications
Foundation-model agents now use reusable skills for tool use, long-horizon planning, and adaptation across related tasks. The term, however, is used loosely. It may describe a prompt package, an executable workflow, a learned routine, or an artifact distributed through a repository. That looseness makes it hard to compare methods, measure progress, or discuss security and governance with precision.We study agent skills as reusable and adaptive units of competence between model capability and situated task execution. The survey separates skills from nearby constructs such as prompts, tools, memory, and policies, then organizes the literature around representation, lifecycle and orchestration, evaluation, security and governance, and application domains. Across these areas, skill quality is only one part of the story. Useful skills also depend on abstraction choices, retrieval and composition mechanisms, ecosystem structure, and infrastructure security. We treat agent skills as a research object in their own right and identify open problems in automatic induction, cross-environment transfer, longitudinal evaluation, and trustworthy sharing in open agent ecosystems. A public paper list is available at https://github.com/JinhaoShen/awesome-agent-skill-papers.
- Top Cited PapersOpen Access
- 27 September 2025
- Published by Springer Nature in Machine Intelligence Research
- Vol. 22 (5) , 817-848
A Survey on Personalized Content Synthesis with Diffusion Models
Recent advancements in diffusion models have significantly impacted content creation, leading to the emergence of personalized content synthesis (PCS). By utilizing a small set of user-provided examples featuring the same subject, PCS aims to tailor this subject to specific user-defined prompts. Over the past two years, more than 150 methods have been introduced in this area. However, existing surveys primarily focus on text-to-image generation, with few providing up-to-date summaries on PCS. This paper provides a comprehensive survey of PCS, introducing the general frameworks of PCS research, which can be categorized into test-time fine-tuning (TTF) and pre-trained adaptation (PTA) approaches. We analyze the strengths, limitations and key techniques of these methodologies. Additionally, we explore specialized tasks within the field, such as object, face and style personalization, while highlighting their unique challenges and innovations. Despite the promising progress, we also discuss ongoing challenges, including overfitting and the trade-off between subject fidelity and text alignment. Through this detailed overview and analysis, we propose future directions to further the development of PCS.
- 27 September 2025
- Published by Springer Nature in Machine Intelligence Research
- Vol. 22 (5) , 817-848
Top Cited PapersOpen AccessA Survey on Personalized Content Synthesis with Diffusion Models
Recent advancements in diffusion models have significantly impacted content creation, leading to the emergence of personalized content synthesis (PCS). By utilizing a small set of user-provided examples featuring the same subject, PCS aims to tailor this subject to specific user-defined prompts. Over the past two years, more than 150 methods have been introduced in this area. However, existing surveys primarily focus on text-to-image generation, with few providing up-to-date summaries on PCS. This paper provides a comprehensive survey of PCS, introducing the general frameworks of PCS research, which can be categorized into test-time fine-tuning (TTF) and pre-trained adaptation (PTA) approaches. We analyze the strengths, limitations and key techniques of these methodologies. Additionally, we explore specialized tasks within the field, such as object, face and style personalization, while highlighting their unique challenges and innovations. Despite the promising progress, we also discuss ongoing challenges, including overfitting and the trade-off between subject fidelity and text alignment. Through this detailed overview and analysis, we propose future directions to further the development of PCS.
- Open Access
Removal of Hallucination on Hallucination: Debate-Augmented RAG
Retrieval-Augmented Generation (RAG) enhances factual accuracy by integrating external knowledge, yet it introduces a critical issue: erroneous or biased retrieval can mislead generation, compounding hallucinations, a phenomenon we term Hallucination on Hallucination. To address this, we propose Debate-Augmented RAG (DRAG), a training-free framework that integrates Multi-Agent Debate (MAD) mechanisms into both retrieval and generation stages. In retrieval, DRAG employs structured debates among proponents, opponents, and judges to refine retrieval quality and ensure factual reliability. In generation, DRAG introduces asymmetric information roles and adversarial debates, enhancing reasoning robustness and mitigating factual inconsistencies. Evaluations across multiple tasks demonstrate that DRAG improves retrieval reliability, reduces RAG-induced hallucinations, and significantly enhances overall factual accuracy. Our code is available at https://github.com/Huenao/Debate-Augmented-RAG.
Open AccessRemoval of Hallucination on Hallucination: Debate-Augmented RAG
Retrieval-Augmented Generation (RAG) enhances factual accuracy by integrating external knowledge, yet it introduces a critical issue: erroneous or biased retrieval can mislead generation, compounding hallucinations, a phenomenon we term Hallucination on Hallucination. To address this, we propose Debate-Augmented RAG (DRAG), a training-free framework that integrates Multi-Agent Debate (MAD) mechanisms into both retrieval and generation stages. In retrieval, DRAG employs structured debates among proponents, opponents, and judges to refine retrieval quality and ensure factual reliability. In generation, DRAG introduces asymmetric information roles and adversarial debates, enhancing reasoning robustness and mitigating factual inconsistencies. Evaluations across multiple tasks demonstrate that DRAG improves retrieval reliability, reduces RAG-induced hallucinations, and significantly enhances overall factual accuracy. Our code is available at https://github.com/Huenao/Debate-Augmented-RAG.
- Top Cited PapersOpen Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 15839-15853
Removal of Hallucination on Hallucination: Debate-Augmented RAG
Wentao Hu, Wengyu Zhang, Yiyang Jiang, Chen Jason Zhang, Xiaoyong Wei, Li Qing. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 15839-15853
Top Cited PapersOpen AccessRemoval of Hallucination on Hallucination: Debate-Augmented RAG
Wentao Hu, Wengyu Zhang, Yiyang Jiang, Chen Jason Zhang, Xiaoyong Wei, Li Qing. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.