Pith. sign in

REVIEW 12 cited by

ScoreFlow: Mastering LLM Agent Workflows via Score-based Preference Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.04306 v1 pith:V4DEETW7 submitted 2025-02-06 cs.CL

classification cs.CL
keywords optimizationscoreflowagentexistingmethodspreferenceaccountsachieves
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent research has leveraged large language model multi-agent systems for complex problem-solving while trying to reduce the manual effort required to build them, driving the development of automated agent workflow optimization methods. However, existing methods remain inflexible due to representational limitations, a lack of adaptability, and poor scalability when relying on discrete optimization techniques. We address these challenges with ScoreFlow, a simple yet high-performance framework that leverages efficient gradient-based optimization in a continuous space. ScoreFlow incorporates Score-DPO, a novel variant of the direct preference optimization method that accounts for quantitative feedback. Across six benchmarks spanning question answering, coding, and mathematical reasoning, ScoreFlow achieves an 8.2% improvement over existing baselines. Moreover, it empowers smaller models to outperform larger ones with lower inference costs. Project: https://github.com/Gen-Verse/ScoreFlow

Discussion (0). Sign in to comment.

Forward citations

Cited by 12 Pith papers

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

  1. CONTRA: Red-Teaming Configurations of Personalizable Agents

    cs.CR 2026-07 conditional novelty 7.0 of 10

    An LLM-assisted configuration tree search finds benign agent setups that trigger malicious actions for 75% of popular skills, showing personalization itself is a major safety risk.

  2. EVOCHAMBER: Test-Time Co-evolution of Multi-Agent System at Individual, Team, and Population Scales

    cs.AI 2026-05 unverdicted novelty 7.0 of 10

    EVOCHAMBER enables test-time co-evolution of multi-agent systems across three scales, producing emergent niche specialists and performance gains of up to 32% relative on math tasks with Qwen3-8B.

  3. Autogenesis: A Self-Evolving Agent Protocol

    cs.AI 2026-04 unverdicted novelty 7.0 of 10

    Autogenesis Protocol defines structured resource management and closed-loop self-evolution for multi-agent LLM systems, with the resulting AGS showing gains over baselines on long-horizon benchmarks.

  4. A Workflow-Aware Serving Layer for Agentic Applications

    cs.DC 2026-07 conditional novelty 6.5 of 10

    A workflow-aware serving layer compiles per-node model-verifier-backend plans with an ILP and adapts only uncommitted work via pre-solved pressure rungs and residual re-solves.

  5. Evolve as a Team: Collaborative Self-Evolution for LLM-based Multi-Agent Systems

    cs.MA 2026-05 unverdicted novelty 6.0 of 10

    Meta-Team is a collaborative self-evolution framework that turns multi-agent execution experience into reusable improvements at agent, coordination, and team levels, outperforming baselines on six benchmarks.

  6. Towards Direct Evaluation of Harness Optimizers via Priority Ranking

    cs.AI 2026-05 unverdicted novelty 6.0 of 10

    Priority ranking offers a low-cost direct evaluation for harness optimizers that correlates with their real multi-step optimization performance, supported by the Shor dataset of 182 scenarios.

  7. Rethinking Query Optimization for Multi-Agent Systems [Vision]

    cs.DB 2025-12 conditional novelty 6.0 of 10

    Agentic data pipelines are built by hand today; this paper sets a research agenda for automatically optimizing their structure, model choices, and execution engines jointly as a new query-optimization problem.

  8. GenoMAS: A Multi-Agent Framework for Scientific Discovery via Code-Driven Gene Expression Analysis

    cs.AI 2025-07 unverdicted novelty 6.0 of 10

    GenoMAS deploys six specialized LLM agents with guided planning to preprocess transcriptomic data and identify genes, reaching 89.13% composite similarity and 60.48% F1 on the GenoTEX benchmark while outperforming pri...

  9. Reward-Free Evolving Agents via Pairwise Validator

    cs.AI 2026-07 conditional novelty 5.0 of 10

    A frozen LLM making binary parent-vs-child comparisons can replace the scalar reward in self-evolving agent loops, matching or beating reward-gated evolution on most settings.

  10. FlowEvo: Self-Evolving Agents through the Co-Evolution of Workflows and Executable Skills

    cs.AI 2026-04 conditional novelty 5.0 of 10

    FlowEvo compiles successful agent workflows into executable skill records and reuses them at inference time, reporting the best accuracy-cost tradeoff across ALFWorld, HumanEval, and GSM8K among tested baselines.

  11. Autogenesis: A Self-Evolving Agent Protocol

    cs.AI 2026-04 unverdicted novelty 5.0 of 10

    AGP decouples agent resources from a closed-loop self-evolution interface; AGS using it reports consistent gains on long-horizon multi-resource agent benchmarks.

  12. Autogenesis: A Self-Evolving Agent Protocol

    cs.AI 2026-04 unverdicted novelty 5.0 of 10

    Autogenesis Protocol defines resource and evolution layers for LLM agents, enabling a system that shows performance gains on long-horizon planning benchmarks.

Pith tools