Papers › One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts

One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts

28 Jun 2024arXiv:2407.00256archive 2025-07-28

Ruochen Wang, Sohyun An, Minhao Cheng, Tianyi Zhou, Sung Ju Hwang, Cho-Jui Hsieh

Large Language Models (LLMs) exhibit strong generalization capabilities to novel tasks when prompted with language instructions and in-context demos. Since this ability sensitively depends on the quality of prompts, various methods have been explored to automate the instruction design. While these methods demonstrated promising results, they also restricted the searched prompt to one instruction. Such simplification significantly limits their capacity, as a single demo-free instruction might not be able to cover the entire complex problem space of the targeted task. To alleviate this issue, we adopt the Mixture-of-Expert paradigm and divide the problem space into a set of sub-regions; Each sub-region is governed by a specialized expert, equipped with both an instruction and a set of demos. A two-phase process is developed to construct the specialized expert for each region: (1) demo assignment: Inspired by the theoretical connection between in-context learning and kernel regression, we group demos into experts based on their semantic similarity; (2) instruction assignment: A region-based joint search of an instruction per expert complements the demos assigned to it, yielding a synergistic effect. The resulting method, codenamed Mixture-of-Prompts (MoP), achieves an average win rate of 81% against prior arts across several major benchmarks.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2407.00256")

Code

Syntology Ran 4 of 7 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 4 ran with no contract checked.

By repository: official repository: 7 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ruocwang/mixture-of-prompts officialmentioned in papermentioned on GitHubpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 4 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

4ran
3unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ruocwang/mixture-of-prompts. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

add_demos_to_prompt ruocwang/mixture-of-prompts/mop/src/pe_manager.py official repository ran Apache-2.0 (permissive) · 6a34bf650bbf498c · report
compute_exp_stats ruocwang/mixture-of-prompts/mop/src/exp_utils.py official repository ran Apache-2.0 (permissive) · f890ea0b93a37532 · report
kMeansRes ruocwang/mixture-of-prompts/mop/src/algo/mixture_of_experts/utils.py official repository ran Apache-2.0 (permissive) · 9c4133378318a325 · report
set_all_seed ruocwang/mixture-of-prompts/mop/src/misc.py official repository ran fingerprinted Apache-2.0 (permissive) · 12ac50dad1160c09 · report
chooseBestKforKMeansParallel ruocwang/mixture-of-prompts/mop/src/algo/mixture_of_experts/utils.py official repository unverified Apache-2.0 (permissive) · 7f2494772490fb0a · report
pick_gpu_lowest_memory ruocwang/mixture-of-prompts/mop/src/exp_utils.py official repository unverified Apache-2.0 (permissive) · 0ed5636df814298e · report
save_image ruocwang/mixture-of-prompts/mop/src/exp_utils.py official repository unverified Apache-2.0 (permissive) · 25ca89c7cda28f21 · report

Tasks

In-Context LearningSemantic SimilaritySemantic Textual Similarity

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections