Skip to content

GLOW: Graph-Language Co-Encoding for Agentic Workflow Performance Prediction

Dec 2025 · IEEE Transactions on Services Computing · 2 citations · 58 references
Computer Science

TL;DR

GLOW is proposed, a unified framework for AW performance prediction that combines the graph-structure modeling ability of GNNs with the topology-aware semantic encoding capability of LLMs and consistently outperforms state-of-the-art baselines in both prediction accuracy and ranking utility.

Abstract

Agentic Workflows (AWs) have emerged as a promising paradigm for solving complex tasks. However, automatically generating high-quality AWs remains expensive because AW optimization requires evaluating a large number of candidate AWs via execution, resulting in high computational cost and latency. Recently, AW performance prediction has become a hot research topic to avoid costly execution-based evaluation, but existing methods primarily use Graph Neural Networks (GNNs) to model workflow structures and insufficiently capture the semantic relationships among agents. To address this limitation, we propose GLOW, a unified framework for AW performance prediction that combines the graph-structure modeling ability of GNNs with the topology-aware semantic encoding capability of LLMs. Specifically, a graph-oriented LLM is first built through instruction-tuning on graph understanding tasks to extract topology-aware semantic representations from descriptive text of AWs. Meanwhile, a GNN explicitly models the structural information of AWs and produces corresponding structural representations. The semantic and structural representations are then fused in a shared latent space using a Transformer-based fusion module. A contrastive learning strategy is further introduced to learn more discriminative representations for AWs. Experiments on the FLORA-Bench benchmark demonstrate that GLOW consistently outperforms state-of-the-art baselines in both prediction accuracy and ranking utility. Moreover, when integrated into the AFLOW, an automatic AW generation framework, GLOW reduces optimization time by 98.7% with only a 0.031 average score decrease across three datasets, showing its effectiveness as an efficient surrogate evaluator for AW optimization.

View source

Similar papers

#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Diffusion models as plug-and-play priors

The possibility of inferring high-dimensional data inference in a model that consists of a prior and an auxiliary differentiable constraint given some additional information is considered, thereby allowing a range of potential applications in adapting models to new domains and tasks.

Alexandros Graikos, Esmeralda S. Whitammer, N. Jojic et al. · 316 citations · ⚡15

Trajectory Balance: Improved Credit Assignment in GFlowNets

It is proved that any global minimizer of the trajectory balance objective can define a policy that samples exactly from the target distribution, and empirically demonstrate the benefits of the trajectories balance objective for GFlowNet convergence, diversity of generated samples, and robustness to long action sequenc...

Esmeralda S. Whitammer, Moksh Jain, Emmanuel Bengio et al. · 302 citations · ⚡60
#artificial intelligence Open access May 2023

Evaluating the Performance of Large Language Models on GAOKAO Benchmark

GAOKAO-Bench is introduced, an intuitive benchmark that employs questions from the Chinese GAOKAO examination as test samples, including both subjective and objective questions that contribute a robust evaluation benchmark for future large language models and offers valuable insights into the advantages and limitations...

Xiaotian Zhang, Chun-yan Li, Yi Zong et al. · 216 citations · ⚡17

KTO: Model Alignment as Prospect Theoretic Optimization

This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.

Kawin Ethayarajh, Winnie Xu, Niklas Muennighoff et al. · 195 citations · ⚡28

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.