paper-with-me

홈 › Papers

PEDAL: Enhancing Greedy Decoding with Large Language Models using Diverse Exemplars

2024-08-16 · Sumanth Prabhu

Self-ensembling techniques with diverse reasoning paths such as Self-Consistency have demonstrated remarkable performance gains in text generation with Large Language Models (LLMs). However, such techniques depend on the availability of an accurate answer extraction process to aggregate across multiple outputs. Moreover, they acquire higher inference cost, in comparison to Greedy Decoding, due to generation of relatively higher number of output tokens. Research has shown that the free form text outputs from Self-Consistency can be aggregated reliably using LLMs to produce the final output. Additionally, recent advancements in LLM inference have demonstrated that usage of diverse exemplars in prompts have the ability to induce diversity in the LLM outputs. Such proven techniques can be easily extended to self-ensembling based approaches to achieve enhanced results in text generation. In this paper, we introduce PEDAL (Prompts based on Exemplar Diversity Aggregated using LLMs), a hybrid self-ensembling approach, that combines the strengths of diverse exemplar based prompts and LLM based aggregation to achieve improvement in overall performance. On the publicly available SVAMP and ARC datasets, our experiments reveal that PEDAL can achieve better accuracy than Greedy Decoding based strategies with lower inference cost compared to Self Consistency based approaches.

📄 PDF Abstract BibTeX arXiv:2408.08869

Code (0)

등록된 구현이 없습니다.

Tasks

ARCDiversityText Generation

Similar Papers 제목 키워드 기반

Chain-of-Thought Reasoning Without Prompting

2024-02-15 · Xuezhi Wang, Denny Zhou

In enhancing the reasoning capabilities of large language models (LLMs), prior research primarily focuses on specific prompting techniques such as few-shot or zero-shot chain-of-thought (CoT) prompting. These methods, wh…

Prompt Engineering

Enhancing Learned Knowledge in LoRA Adapters Through Efficient Contrastive Decoding on Ascend NPUs

2025-05-20 · Morgan Lindsay Heisler, Linzi Xing, Ge Shi, Hanieh Sadri 외

Huawei Cloud users leverage LoRA (Low-Rank Adaptation) as an efficient and scalable method to fine-tune and customize large language models (LLMs) for application-specific needs. However, tasks that require complex reaso…

Revisiting Greedy Decoding for Visual Question Answering: A Calibration Perspective

2026-04-25 · Boqi Chen, Xudong Liu, Yunke Ao, Jianing Qiu arxiv

Stochastic sampling strategies are widely adopted in large language models (LLMs) to balance output coherence and diversity. These heuristics are often inherited in Multimodal LLMs (MLLMs) without task-specific justifica…

Visual Question AnsweringMultimodal Reasoning

How Optimal is Greedy Decoding for Extractive Question Answering?

2021-08-12 · Or Castel, Ori Ram, Avia Efrat, Omer Levy

Fine-tuned language models use greedy decoding to answer reading comprehension questions with relative success. However, this approach does not ensure that the answer is a span in the given passage, nor does it guarantee…

Extractive Question-AnsweringQuestion AnsweringReading Comprehension

When Is a Draft Accepted? A Theory of Acceptance in Speculative Decoding

2026-06-29 · Aaryam Sharma arxiv

Speculative decoding accelerates language model inference by using a fast drafter to propose candidate tokens that are then verified by a larger target model. Existing theory largely studies the stochastic, distribution-…