mlsanityData to 7 Oct 2026

Cognify: Supercharging Gen-AI Workflows With Hierarchical Autotuning

arXiv 2502.08056 ↗First posted 12 Feb 2025cs.LG cs.AI cs.MAcited by 7

Not on the map. Why?

Abstract (arXiv)

Today's gen-AI workflows that involve multiple ML model calls, tool/API calls, data retrieval, or generic code execution are often tuned manually in an ad-hoc way that is both time-consuming and error-prone. In this paper, we propose a systematic approach for automatically tuning gen-AI workflows. Our key insight is that gen-AI workflows can benefit from structure, operator, and prompt changes, but unique properties of gen-AI workflows require new optimization techniques. We propose AdaSeek, an adaptive hierarchical search algorithm for autotuning gen-AI workflows. AdaSeek organizes workflow tuning methods into different layers based on the user-specified total search budget and distributes the budget across different layers based on the complexity of each layer. During its hierarchical search, AdaSeek redistributes the search budget from less useful to more promising tuning configurations based on workflow-level evaluation results. We implement AdaSeek in a workflow autotuning framework called Cognify and evaluate Cognify using six types of workflows such as RAG-based QA and text-to-SQL transformation. Overall, Cognify improves these workflows' generation quality by up to 2.8x, reduces execution monetary cost by up to 10x, and reduces end-to-end latency by 2.7x.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 11 of its 52 references that are in the map. First posted on arXiv 12 Feb 2025.

Builds on

11 of 52 references.

References · 11

  1. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  2. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
  3. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,970
  4. 2022Decomposed Prompting: A Modular Approach for Solving Complex Taskscited by 554
  5. 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 466
  6. 2023Text-to-SQL Empowered by Large Language Models: A Benchmark Evaluationcited by 378
  7. 2024Optimizing Instructions and Demonstrations for Multi-Stage Language Model Programscited by 270
  8. 2018Neural Architecture Search with Bayesian Optimisation and Optimal Transportcited by 192
  9. 2023Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performancecited by 143
  10. 2024MatPlotAgent: Method and Evaluation for LLM-Based Agentic Scientific Data Visualizationcited by 98
  11. 2024Trace is the Next AutoDiff: Generative Optimization with Rich Feedback, Execution Traces, and LLMscited by 62

Built on by

Cited by year

Citing papers per year: 2025: 7.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026From Search to Synthesis: Training LLMs as Zero-Shot Workflow Generators
  2. 2026It Takes Workflows to Evolve Better Workflows
  3. 2024Generating a Low-code Complete Workflow via Task Decomposition and RAG
  4. 2025AutoSynth: Automated Workflow Optimization for High-Quality Synthetic Dataset Generation via Monte Carlo Tree Search
  5. 2024AutoFlow: Automated Workflow Generation for Large Language Model Agents
  6. 2025AdaptFlow: Adaptive Workflow Optimization via Meta-Learning
  7. 2026FlowEvo: Self-Evolving Agents through the Co-Evolution of Workflows and Executable Skills
  8. 2025EvoFlow: Evolving Diverse Agentic Workflows On The Fly