MétaCan
Menu
Back to cohort
Record W4403318073 · doi:10.1145/3672539.3686763

ChainBuddy: An AI-assisted Agent System for Helping Users Set up LLM Pipelines

2024· article· en· W4403318073 on OpenAlexaff
Jingyue Zhang, Ian Arawjo

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicScheduling and Optimization Algorithms
Canadian institutionsUniversité de MontréalMila - Quebec Artificial Intelligence Institute
Fundersnot available
KeywordsComputer scienceSet (abstract data type)Pipeline transportHuman–computer interactionEngineeringProgramming language

Abstract

fetched live from OpenAlex

As large language models (LLMs) continue to advance, their potential applications have grown significantly. However, one persistent challenge remains: evaluating LLM behavior and crafting effective prompt chains. Many users struggle with where to start, often referred to as the "blank page problem." ChainBuddy, a new evaluation assistant built into the ChainForge platform, aims to tackle this issue. It offers a straightforward and user-friendly way to plan and evaluate LLM behavior, making the process less daunting and more accessible.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.033
Threshold uncertainty score0.111

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.012
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0020.005
Open science0.0030.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0330.008

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.032
GPT teacher head0.277
Teacher spread0.245 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicScheduling and Optimization AlgorithmsFrench-language works237,207