syftr: Pareto-Optimal Generative AI

Alexander Conway, Debadeepta Dey, Stefan Hackmann, Matthew Hausknecht, Michael Schmidt +2 more
5/26/2025
cs.AIcs.LG

No official code found. Best implementation: datarobot/syftr (344 stars, MIT, last commit 2026-03-04).

Abstract

Retrieval-Augmented Generation (RAG) pipelines are central to applying large language models (LLMs) to proprietary or dynamic data. However, building effective RAG flows is complex, requiring careful selection among vector databases, embedding models, text splitters, retrievers, and synthesizing LLMs. The challenge deepens with the rise of agentic paradigms. Modules like verifiers, rewriters, and rerankers-each with intricate hyperparameter dependencies have to be carefully tuned. Balancing tradeoffs between latency, accuracy, and cost becomes increasingly difficult in performance-sensitive applications. We introduce syftr, a framework that performs efficient multi-objective search over a broad space of agentic and non-agentic RAG configurations. Using Bayesian Optimization, syftr discovers Pareto-optimal flows that jointly optimize task accuracy and cost. A novel early-stopping mechanism further improves efficiency by pruning clearly suboptimal candidates. Across multiple RAG benchmarks, syftr finds flows which are on average approximately 9 times cheaper while preserving most of the accuracy of the most accurate flows on the Pareto-frontier. Furthermore, syftr's ability to design and optimize allows integrating new modules, making it even easier and faster to realize high-performing generative AI pipelines.

View on arXivView PDF

Code Implementations(1)

datarobot/syftrCommunity100%
MIT

syftr is an agent optimizer that helps you find the best agentic workflows for your budget.

34433Shell, PythonMay 20, 20257 months agoMIT
agentsaiai-agentshyperparameter-optimizationhyperparameter-search+6 more

Similar Papers

Cite this paper

@article{conway2025syftr,
  title  = {syftr: Pareto-Optimal Generative AI},
  author = {Alexander Conway and Debadeepta Dey and Stefan Hackmann and Matthew Hausknecht and Michael Schmidt and Mark Steadman and Nick Volynets},
  year   = {2025},
  eprint = {2505.20266},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.20266v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.20266.svg)](https://codeofpaper.com/paper/2505.20266)

Discussion