paper-with-me

홈 › Papers

Make Every Penny Count: Difficulty-Adaptive Self-Consistency for Cost-Efficient Reasoning

2024-08-24 · Xinglin Wang, Shaoxiong Feng, Yiwei Li, Peiwen Yuan, Yueqi Zhang, Boyuan Pan, HeDa Wang, Yao Hu, Kan Li

Self-consistency (SC), a widely used decoding strategy for chain-of-thought reasoning, shows significant gains across various multi-step reasoning tasks but comes with a high cost due to multiple sampling with the preset size. Its variants, Adaptive self-consistency (ASC) and Early-stopping self-consistency (ESC), dynamically adjust the number of samples based on the posterior distribution of a set of pre-samples, reducing the cost of SC with minimal impact on performance. Both methods, however, do not exploit the prior information about question difficulty. It often results in unnecessary repeated sampling for easy questions that could be accurately answered with just one attempt, wasting resources. To tackle this problem, we propose Difficulty-Adaptive Self-Consistency (DSC), which leverages the difficulty information from both prior and posterior perspectives to adaptively allocate inference resources, further reducing the cost of SC. To demonstrate the effectiveness of DSC, we conduct extensive experiments on three popular categories of reasoning tasks: arithmetic, commonsense and symbolic reasoning on six benchmarks. The empirical results show that DSC consistently surpasses the strong baseline ASC and ESC in terms of costs by a significant margin, while attaining comparable performances.

📄 PDF Abstract BibTeX arXiv:2408.13457

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

PennyLane: Automatic differentiation of hybrid quantum-classical computations

2018-11-12 · Ville Bergholm, Josh Izaac, Maria Schuld, Christian Gogolin 외

PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices, supporting both qubit and continuous-va…

BIG-bench Machine LearningQuantum Machine Learning

Beating humans in a penny-matching game by leveraging cognitive hierarchy theory and Bayesian learning

2019-09-27 · Ran Tian, Nan Li, Ilya Kolmanovsky, Anouck Girard

It is a long-standing goal of artificial intelligence (AI) to be superior to human beings in decision making. Games are suitable for testing AI capabilities of making good decisions in non-numerical tasks. In this paper,…

Decision Making

PennyLang: Pioneering LLM-Based Quantum Code Generation with a Novel PennyLane-Centric Dataset

2025-03-04 · Abdul Basit, Nouhaila Innan, Haider Asif, Minghao Shao 외

Large Language Models (LLMs) offer remarkable capabilities in code generation, natural language processing, and domain-specific reasoning. However, their application in quantum software development remains underexplored,…

Code GenerationRAGRetrieval-augmented Generation

PennyCoder: Efficient Domain-Specific LLMs for PennyLane-Based Quantum Code Generation

2025-07-25 · Abdul Basit, Minghao Shao, Muhammad Haider Asif, Nouhaila Innan 외 arxiv

The growing demand for robust quantum programming frameworks has unveiled a critical limitation: current large language model (LLM) based quantum code assistants heavily rely on remote APIs, introducing challenges relate…

Quantum Machine LearningReinforcement LearningCode Generation

PennySynth: RAG-Driven Data Synthesis for Automated Quantum Code Generation

2026-05-25 · Minghao Shao, Nouhaila Innan, Hariharan Janardhanan, Muhammad Kashif 외 arxiv

The growing complexity of quantum programming frameworks has exposed a critical limitation in existing large language model (LLM)-based code assistants: general-purpose models hallucinate PennyLane-specific gate names, m…

Code Generation