EDBT 2026 Demo / reviewers in the wild / expert
Renxi Wang
dblp:346/0513
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Language models and text generation · 87% Robot manipulation · 13% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
large language model |
0.9 | 1 | 2025 | ToolGen: Unified Tool Retrieval and Calling via Generation · ICLR 2025 |
Natural language and speech › Language models and text generation › LLM agents
tool learning |
0.9 | 1 | 2025 | ToolGen: Unified Tool Retrieval and Calling via Generation · ICLR 2025 |
Information retrieval
tool retrieval |
0.9 | 1 | 2025 | ToolGen: Unified Tool Retrieval and Calling via Generation · ICLR 2025 |
Robotics › Robot manipulation › task automation
autonomous task execution |
0.3 | 1 | 2025 | ToolGen: Unified Tool Retrieval and Calling via Generation · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
tool tokenization · 1.7next-token prediction · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Minimalist Proof Language for Neural Theorem Proving over Isabelle/HOLabstractNeural Theorem Proving (NTP) employs Large Language Models (LLMs) to automate formal proofs in proof assistants. While LLMs have achieved relatively remarkable success in informal reasoning tasks using natural languages, the transition to mechanized formal theorem proving presents persistent challenges. Mechanized proof languages often contain many syntactic constructs and diverse, specialized proof tactics, which facilitate expert use but have no direct counterpart in informal mathematical proofs. These prover-specific idioms represent an additional burden for LLM-based NTPs that might be otherwise successful in generating informal proofs. Seeking to bridge this gap between formal proof construction and informal reasoning, in order to better facilitate NTP, this work approaches these challenges from a language design perspective. We look at common reasoning patterns in informal proofs and in existing mechanized proofs, and design Minilang (formally named Isabelle/Minilang), a minimalist proof language that captures these reasoning patterns. In contrast to proof languages (informal and formal) that often feature a large collection of operations with unclear semantic boundaries, Minilang is deliberately kept minimalist – its core design comprises only 10 proof operations, each with clear semantic distinctions. We further develop a rule-based translator from Isabelle’s proof language (Isar) to Minilang, translating ∼340,000 existing Isabelle proofs with an ∼85% success rate. Using this translated corpus, we finetune two LLMs to compare machine learning performance on Minilang versus the original Isar language. Experiments show Minilang benefits the two LLMs by improving the pass@1 success rate on the PISA benchmark by up to 20/29 percentage points in comparison to the Isar-based LLMs w/wo Sledgehammer. The pass@1 rate reaches 69.1%, exceeding the prior work Baldur’s pass@64 (65.7%); the pass@8 rate reaches 79.2%, exceeding the state-of-the-art on PISA (71.0%) achieved by Magnushammer. Qiyuan Xu, Renxi Wang, Haonan Li 0002, Conrad Watt |
Proc. ACM Program. Lang. | 2 |
| 2025 | ToolGen: Unified Tool Retrieval and Calling via GenerationabstractAs large language models (LLMs) advance, their inability to autonomously execute tasks by directly interacting with external tools remains a critical limitation. Traditional methods rely on inputting tool descriptions as context, which is constrained by context length and requires separate, often inefficient, retrieval mechanisms. We introduce ToolGen, a paradigm shift that integrates tool knowledge directly into the LLM’s parameters by representing each tool as a unique token. This enables the LLM to generate tool calls and arguments as part of its next token prediction capabilities, seamlessly blending tool invocation with language generation. Our framework allows the LLM to access and utilize a vast amount of tools with no additional retrieval step, significantly enhancing both performance and scalability. Experimental results with over 47,000 tools show that ToolGen not only achieves superior results in both tool retrieval and autonomous task completion but also sets the stage for a new era of AI agents that can adapt to tools across diverse domains. By fundamentally transforming tool retrieval into a generative process, ToolGen paves the way for more versatile, efficient, and autonomous AI systems. ToolGen enables end-to-end tool learning and opens opportunities for integration with other advanced techniques such as chain-of-thought and reinforcement learning, thereby expanding the practical capabilities of LLMs Renxi Wang, Lei Ji 0001, Shu Wang 0002, Timothy Baldwin, Haonan Li 0002 |
ICLR | 1 |
| 2025 | NAT: Enhancing Agent Tuning with Negative SamplesabstractRenxi Wang, Xudong Han, Yixuan Zhang, Timothy Baldwin, Haonan Li. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025. Renxi Wang, Timothy Baldwin, Haonan Li 0002 |
NAACL (Long Papers) | 1 |
| 2025 | Against The Achilles' Heel: A Survey on Red Teaming for Generative ModelsabstractGenerative models are rapidly gaining popularity and being integrated into everyday applications, raising concerns over their safe use as various vulnerabilities are exposed. In light of this, the field of red teaming is undergoing fast-paced growth, highlighting the need for a comprehensive survey covering the entire pipeline and addressing emerging topics. Our extensive survey, which examines over 120 papers, introduces a taxonomy of fine-grained attack strategies grounded in the inherent capabilities of language models. Additionally, we have developed the “searcher” framework to unify various automatic red teaming approaches. Moreover, our survey covers novel areas including multimodal attacks and defenses, risks around LLM-based agents, overkill of harmless queries, and the balance between harmlessness and helpfulness. Warning: This paper contains examples that may be offensive, harmful, or biased. Lizhi Lin, Honglin Mu, Zenan Zhai, Minghan Wang, Yuxia Wang 0003, Renxi Wang, Wanxiang Che, Timothy Baldwin, Haonan Li 0002 |
J. Artif. Intell. Res. | 6 |