Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.00256 v1 pith:4OQV5DUC submitted 2024-06-28 cs.AI cs.CLcs.LGstat.ML

classification cs.AIcs.CLcs.LGstat.ML
keywords instructiondemosexpertassignmentin-contextlanguagemethodsmixture-of-expert
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BrainMAP: Learning Multiple Activation Pathways in Brain Networks

    cs.AI 2024-12 conditional novelty 6.0 of 10

    BrainMAP adaptively sequences brain-region graphs, routes them through a Mixture of Experts of Mamba models, and achieves state-of-the-art results on five HCP fMRI benchmarks with saliency-based explanations.

Pith tools