Demo Data from EDBT 2026 / reviewers in the wild / expert
Sirui Hong
dblp:299/0086
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2025
0009-0006-9283-6295ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-author · 5 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
5 papers |
Efficient and distributed learning · 32% Language models and text generation · 24% Multi-agent systems · 16% | |
| Software engineering, system software, and programming languages
1 paper |
Program synthesis and code generation · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 13 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
automated machine learning |
1.0 | 2 | 2021 | Evolving Fully Automated Machine Learning via Life-Long Knowledge Anchors · IEEE Trans. Pattern Anal. Mach. Intell. 2021 Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Natural language and speech › Language models and text generation › LLM agents
agentic workflow generation |
0.9 | 1 | 2025 | AFlow: Automating Agentic Workflow Generation · ICLR 2025 |
Information retrieval
retrieval-augmented generation |
0.9 | 1 | 2025 | Improving Context Fidelity via Native Retrieval-Augmented Reasoning · EMNLP 2025 |
Knowledge, reasoning and agents › Multi-agent systems › multi-agent collaboration
LLM-based multi-agent collaboration |
0.8 | 1 | 2024 | MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework · ICLR 2024 |
Program synthesis and code generation
code generation with language models |
0.8 | 1 | 2024 | MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework · ICLR 2024 |
Program synthesis and code generation › code generation with language models
software engineering agents |
0.8 | 1 | 2024 | MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework · ICLR 2024 |
Machine learning › Optimization for machine learning
evolutionary computation |
0.5 | 1 | 2021 | Evolving Fully Automated Machine Learning via Life-Long Knowledge Anchors · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search |
0.5 | 1 | 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
monte carlo tree search |
0.3 | 1 | 2025 | AFlow: Automating Agentic Workflow Generation · ICLR 2025 |
Natural language and speech › Question answering and dialogue systems
retrieval-augmented reasoning |
0.3 | 1 | 2025 | Improving Context Fidelity via Native Retrieval-Augmented Reasoning · EMNLP 2025 |
Natural language and speech › Language models and text generation › prompting
prompt engineering |
0.2 | 1 | 2024 | MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework · ICLR 2024 |
Machine learning › Kernel, tree and ensemble methods
ensemble learning |
0.1 | 1 | 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Machine learning › Transfer learning and domain adaptation
meta-learning |
0.1 | 1 | 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Methods — techniques the papers use, named apart from their topics
large language model · 2.4native retrieval-augmented reasoning · 1.7prompt sequences · 1.5monte carlo tree search · 0.9pre-trained network fine-tuning · 0.5model selection · 0.5evolutionary algorithm · 0.5ensemble · 0.5data preprocessing · 0.5data ingestion · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Improving Context Fidelity via Native Retrieval-Augmented ReasoningabstractSuyuchen Wang, Jinlin Wang, Xinyu Wang, Shiqi Li, Xiangru Tang, Sirui Hong, Xiao-Wen Chang, Chenglin Wu, Bang Liu. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025. Suyuchen Wang, Xinyu Wang 0061, Xiangru Tang, Sirui Hong, Xiao-Wen Chang, Chenglin Wu 0001, Bang Liu 0003 |
EMNLP | 6 |
| 2025 | AFlow: Automating Agentic Workflow GenerationabstractLarge language models (LLMs) have demonstrated remarkable potential in solving complex tasks across diverse domains, typically by employing agentic workflows that follow detailed instructions and operational sequences. However, constructing these workflows requires significant human effort, limiting scalability and generalizability. Recent research has sought to automate the generation and optimization of these workflows, but existing methods still rely on initial manual setup and fall short of achieving fully automated and effective workflow generation. To address this challenge, we reformulate workflow optimization as a search problem over code-represented workflows, where LLM-invoking nodes are connected by edges. We introduce AFLOW, an automated framework that efficiently explores this space using Monte Carlo Tree Search, iteratively refining workflows through code modification, tree-structured experience, and execution feedback. Empirical evaluations across six benchmark datasets demonstrate AFLOW's efficacy, yielding a 5.7% average improvement over state-of-the-art baselines. Furthermore, AFLOW enables smaller models to outperform GPT-4o on specific tasks at 4.55% of its inference cost in dollars. The code is available at https://github.com/FoundationAgents/AFlow. Jiayi Zhang 0017, Jinyu Xiang, Zhaoyang Yu 0004, Fengwei Teng, Xionghui Chen, Mingchen Zhuge, Sirui Hong, Bingnan Zheng, Bang Liu 0003, Yuyu Luo, Chenglin Wu 0001 |
ICLR | 9 |
| 2024 | MetaGPT: Meta Programming for A Multi-Agent Collaborative FrameworkabstractRecently, remarkable progress has been made on automated problem solving through societies of agents based on large language models (LLMs). Previous LLM-based multi-agent systems can already solve simple dialogue tasks. More complex tasks, however, face challenges through logic inconsistencies due to cascading hallucinations caused by naively chaining LLMs. Here we introduce MetaGPT, an innovative meta-programming framework incorporating efficient human workflows into LLM-based multi-agent collaborations. MetaGPT encodes Standardized Operating Procedures (SOPs) into prompt sequences for more streamlined workflows, thus allowing agents with human-like domain expertise to verify intermediate results and reduce errors. MetaGPT utilizes an assembly line paradigm to assign diverse roles to various agents, efficiently breaking down complex tasks into subtasks involving many agents working together. On collaborative software engineering benchmarks, MetaGPT generates more coherent solutions than previous chat-based multi-agent systems. Sirui Hong, Mingchen Zhuge, Jonathan Chen, Xiawu Zheng, Yuheng Cheng, Ceyao Zhang, Steven Ka Shing Yau, Zijuan Lin, Liyang Zhou, Chenyu Ran, Lingfeng Xiao, Chenglin Wu 0001, Jürgen Schmidhuber |
ICLR | 1 |
| 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019abstractThis paper reports the results and post-challenge analyses of ChaLearn's AutoDL challenge series, which helped sorting out a profusion of AutoML solutions for Deep Learning (DL) that had been introduced in a variety of settings, but lacked fair comparisons. All input data modalities (time series, images, videos, text, tabular) were formatted as tensors and all tasks were multi-label classification problems. Code submissions were executed on hidden tasks, with limited time and computational resources, pushing solutions that get results quickly. In this setting, DL methods dominated, though popular Neural Architecture Search (NAS) was impractical. Solutions relied on fine-tuned pre-trained networks, with architectures matching data modality. Post-challenge tests did not reveal improvements beyond the imposed time limit. While no component is particularly original or novel, a high level modular organization emerged featuring a "meta-learner", "data ingestor", "model selector", "model/learner", and "evaluator". This modularity enabled ablation studies, which revealed the importance of (off-platform) meta-learning, ensembling, and efficient data management. Experiments on heterogeneous module combinations further confirm the (local) optimality of the winning solutions. Our challenge legacy includes an ever-lasting benchmark (http://autodl.chalearn.org), the open-sourced code of the winners, and a free "AutoDL self-service." Zhengying Liu, Adrien Pavão, Zhen Xu 0007, Sergio Escalera, Fabio Ferreira, Isabelle Guyon, Sirui Hong, Frank Hutter, Rongrong Ji, Júlio C. S. Jacques Júnior, Marius Lindauer, Meysam Madadi, Thomas Nierhoff, Kangning Niu, Chunguang Pan, Danny Stoll, Sébastien Treguer, Peng Wang 0095, Chenglin Wu 0001, Youcheng Xiong, Arber Zela, Yang Zhang 0079 |
IEEE Trans. Pattern Anal. Mach. Intell. | 7 |
| 2021 | Evolving Fully Automated Machine Learning via Life-Long Knowledge AnchorsabstractAutomated machine learning (AutoML) has achieved remarkable progress on various tasks, which is attributed to its minimal involvement of manual feature and model designs. However, most of existing AutoML pipelines only touch parts of the full machine learning pipeline, e.g., neural architecture search or optimizer selection. This leaves potentially important components such as data cleaning and model ensemble out of the optimization, and still results in considerable human involvement and suboptimal performance. The main challenges lie in the huge search space assembling all possibilities over all components, as well as the generalization ability over different tasks like image, text, and tabular etc. In this paper, we present a first-of-its-kind fully AutoML pipeline, to comprehensively automate data preprocessing, feature engineering, model generation/selection/training and ensemble for an arbitrary dataset and evaluation metric. Our innovation lies in the comprehensive scope of a learning pipeline, with a novel "life-long" knowledge anchor design to fundamentally accelerate the search over the full search space. Such knowledge anchors record detailed information of pipelines and integrates them with an evolutionary algorithm for joint optimization across components. Experiments demonstrate that the result pipeline achieves state-of-the-art performance on multiple datasets and modalities. Specifically, the proposed framework was extensively evaluated in the NeurIPS 2019 AutoDL challenge, and won the only champion with a significant gap against other approaches, on all the image, video, speech, text and tabular tracks. Xiawu Zheng, Yang Zhang 0079, Sirui Hong, Huixia Li, Lang Tang, Youcheng Xiong, Yan Wang 0059, Xiaoshuai Sun, Pengfei Zhu 0001, Chenglin Wu 0001, Rongrong Ji |
IEEE Trans. Pattern Anal. Mach. Intell. | 3 |