The reviewed record of science sign in
Pith

arxiv: 2407.00071 · v1 · pith:Y7PBW3HH · submitted 2024-06-19 · cs.AI · cs.CL· cs.ET· cs.LG

Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization

Reviewed by Pithpith:Y7PBW3HHopen to challenge →

classification cs.AI cs.CLcs.ETcs.LG
keywords reasoningcombinatorialreasonstasksllmsperformancebeenframework
0
0 comments X
read the original abstract

Recent Large Language Models (LLMs) have demonstrated impressive capabilities at tasks that require human intelligence and are a significant step towards human-like artificial intelligence (AI). Yet the performance of LLMs at reasoning tasks have been subpar and the reasoning capability of LLMs is a matter of significant debate. While it has been shown that the choice of the prompting technique to the LLM can alter its performance on a multitude of tasks, including reasoning, the best performing techniques require human-made prompts with the knowledge of the tasks at hand. We introduce a framework for what we call Combinatorial Reasoning (CR), a fully-automated prompting method, where reasons are sampled from an LLM pipeline and mapped into a Quadratic Unconstrained Binary Optimization (QUBO) problem. The framework investigates whether QUBO solutions can be profitably used to select a useful subset of the reasons to construct a Chain-of-Thought style prompt. We explore the acceleration of CR with specialized solvers. We also investigate the performance of simpler zero-shot strategies such as linear majority rule or random selection of reasons. Our preliminary study indicates that coupling a combinatorial solver to generative AI pipelines is an interesting avenue for AI reasoning and elucidates design principles for future CR methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Quantum-Inspired Trace-Augmented Evidence Selection for Reasoning over Structured Hypothesis Spaces

    cs.AI 2026-06 unverdicted novelty 5.0

    EP-HUBO treats CoT evidence selection as higher-order unconstrained binary optimization over per-hypothesis pools with quality weights to improve aggregation on legal benchmarks.

  2. How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

    quant-ph 2024-11 accept novelty 4.0

    A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.