Multi-expert Prompting Improves Reliability, Safety, and Usefulness of Large Language Models

Do Xuan Long, Duong Ngoc Yen, Anh Tuan Luu, Kenji Kawaguchi, Min-Yen Kan +1 more
11/1/2024
cs.CL

No official code found. Best implementation: dxlong2000/Multi-expert-Prompting (40 stars, last commit 2024-12-14).

Abstract

We present Multi-expert Prompting, a novel enhancement of ExpertPrompting (Xu et al., 2023), designed to improve the large language model (LLM) generation. Specifically, it guides an LLM to fulfill an input instruction by simulating multiple experts, aggregating their responses, and selecting the best among individual and aggregated responses. This process is performed in a single chain of thoughts through our seven carefully designed subtasks derived from the Nominal Group Technique (Ven and Delbecq, 1974), a well-established decision-making framework. Our evaluations demonstrate that Multi-expert Prompting significantly outperforms ExpertPrompting and comparable baselines in enhancing the truthfulness, factuality, informativeness, and usefulness of responses while reducing toxicity and hurtfulness. It further achieves state-of-the-art truthfulness by outperforming the best baseline by 8.69% with ChatGPT. Multi-expert Prompting is efficient, explainable, and highly adaptable to diverse scenarios, eliminating the need for manual prompt construction.

View on arXivView PDF

Code Implementations(1)

Official codes for EMNLP 2024 paper "Multi-expert Prompting Improves Reliability, Safety and Usefulness of Large Language Models"

408PythonOct 2, 20241 years ago

Similar Papers

Cite this paper

@article{long2024multiexpert,
  title  = {Multi-expert Prompting Improves Reliability, Safety, and Usefulness of Large Language Models},
  author = {Do Xuan Long and Duong Ngoc Yen and Anh Tuan Luu and Kenji Kawaguchi and Min-Yen Kan and Nancy F. Chen},
  year   = {2024},
  eprint = {2411.00492},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.00492v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.00492.svg)](https://codeofpaper.com/paper/2411.00492)

Discussion