ThriftLLM: On Cost-Effective Selection of Large Language Models for Classification Queries

TL;DR

This paper introduces ThriftLLM, a framework for cost-effective selection of large language model ensembles to maximize classification accuracy within budget constraints, addressing a gap in existing research.

Contribution

It formalizes the ensemble selection problem with a correctness probability metric and proposes an algorithm with approximation guarantees for cost-constrained LLM selection.

Findings

ThriftLLM effectively balances cost and performance in LLM ensemble selection.

The correctness probability function is non-decreasing but non-submodular.

The proposed algorithm provides an instance-dependent approximation guarantee.

Abstract

In recent years, large language models (LLMs) have demonstrated remarkable capabilities in comprehending and generating natural language content, attracting widespread attention in both industry and academia. An increasing number of services offer LLMs for various tasks via APIs. Different LLMs demonstrate expertise in different domains of queries (e.g., text classification queries). Meanwhile, LLMs of different scales, complexities, and performance are priced diversely. Driven by this, several researchers are investigating strategies for selecting an ensemble of LLMs, aiming to decrease overall usage costs while enhancing performance. However, to the best of our knowledge, none of the existing works addresses the problem, how to find an LLM ensemble subject to a cost budget, which maximizes the ensemble performance with guarantees. In this paper, we formalize the performance of an ensemble of models (LLMs) using the notion of correctness probability, which we formally define. We develop an approach for aggregating responses from multiple LLMs to enhance ensemble performance. Building on this, we formulate the Optimal Ensemble Selection problem of selecting a set of LLMs subject to a cost budget that maximizes the overall correctness probability. We show that the correctness probability function is non-decreasing and non-submodular and provide evidence that the Optimal Ensemble Selection problem is likely to be NP-hard. By leveraging a submodular function that upper bounds correctness probability, we develop an algorithm called ThriftLLM and prove that it achieves an instance-dependent approximation guarantee with high probability. Our framework functions as a data processing system that selects appropriate LLM operators to deliver high-quality results under budget constraints.