MétaCan
Menu
Back to cohort
Record W4402034738 · doi:10.32920/26871409

Transformer Models for Automated Bug Triaging and Duplicate Bug Detection

2024· preprint· en· W4402034738 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsToronto Metropolitan UniversityUniversity of ManitobaSystems, Applications & Products in Data Processing (Canada)
Fundersnot available
KeywordsComputer scienceTransformerEngineering

Abstract

fetched live from OpenAlex

<p>In the software engineering field, developer teams must handle bug reports of varying sources and formats to maintain and optimize software applications as issues arise. A team's workflow for handling bugs involves multiple stages to review, assess, assign, and resolve bugs. In teams for large-scale applications, streamlining such processes is vital for efficient operations as they are exposed to greater volumes and varieties of bug reports. This thesis focuses on bug triaging and duplicate bug detection as preliminary processing options for the automated bucketing and assignment of bugs. In the bug triaging task, Transformer-based models are found to outperform in mean Rank-5, Rank-10, and Mean Reciprocal Rank across several open-source datasets for various software projects. In the duplicate bug detection task, similarity learning is employed and Transformer-based siamese models with domain adaptation are shown to improve similarity learning capabilities with improvements in mean Area under the Curve, Recall-rate @ k, and Mean Reciprocal Rank performance.</p>

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.928
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.040
GPT teacher head0.301
Teacher spread0.260 · 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