Pith. sign in

REVIEW 2 cited by

Can Large Language Models Improve SE Active Learning via Warm-Starts?

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 2501.00125 v1 pith:VNVILF7T submitted 2024-12-30 cs.SE

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

When SE data is scarce, "active learners" use models learned from tiny samples of the data to find the next most informative example to label. In this way, effective models can be generated using very little data. For multi-objective software engineering (SE) tasks, active learning can benefit from an effective set of initial guesses (also known as "warm starts"). This paper explores the use of Large Language Models (LLMs) for creating warm-starts. Those results are compared against Gaussian Process Models and Tree of Parzen Estimators. For 49 SE tasks, LLM-generated warm starts significantly improved the performance of low- and medium-dimensional tasks. However, LLM effectiveness diminishes in high-dimensional problems, where Bayesian methods like Gaussian Process Models perform best.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. When to Use Which? Benchmarking Optimisers for Configurable Systems under Varying Budgets

    cs.SE 2026-07 conditional novelty 6.0 of 10

    Across 22 configurable systems and budgets from 100 to 10,000 evaluations, FLASH is the most consistently effective optimiser, while GA and IRACE catch up only at large budgets.

  2. BINGO! Simple Optimizers Win Big if Problems Collapse to a Few Buckets

    cs.SE 2025-06 conditional novelty 4.0 of 10

    SE optimization data clusters into a tiny fraction of possible buckets, so simple stochastic samplers can match DEHB with far less computation.

Pith tools