MétaCan
Menu
Back to cohort
Record W4390402833 · doi:10.34123/icdsos.v2023i1.384

Comparative Analysis of Retriever and Reader for Open Domain Questions Answering on BPS Knowledge in Indonesian

2023· article· en· W4390402833 on OpenAlexaboutno aff
Sulisetyo Puji Widodo

Bibliographic record

VenueProceedings of The International Conference on Data Science and Official Statistics · 2023
Typearticle
Languageen
FieldComputer Science
TopicData Mining and Machine Learning Applications
Canadian institutionsnot available
Fundersnot available
KeywordsQuestion answeringComputer scienceInformation retrievalOpen domainDomain (mathematical analysis)IndonesianLabrador RetrieverWorld Wide WebNatural language processingLinguisticsMedicineMathematics

Abstract

fetched live from OpenAlex

Enumerators from Badan Pusat Statistik (BPS) still often encounter problems in finding solutions to cases encountered during censuses or surveys. Even though knowledge lists have been created and collected in various systems such as QA and knowledge management systems, enumerators still need to find appropriate answers from long and complex knowledge search results. On the other hand, Open-domain Question Answering (OpenQA) is capable of identifying answers to natural questions based on large-scale documents. OpenQA has main components, namely Retriever and Reader. For Retriever tasks, Dense Retrieval (DR) is proven to outperform traditional sparse retrieval such as TF-IDF or BM25. However, other research actually shows that BM25 is superior to DR in terms of accuracy. In this study, we compared DR and BM25 separately and DR+BM25 as a retriever. Additionally, we combine and evaluate several enhanced language models as Readers. In this way, a model with the best combination of Retriever and Reader can be obtained to be implemented in search systems such as QA and knowledge management systems.

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.010
metaresearch head score (Gemma)0.038
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.010
Threshold uncertainty score0.051

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0100.038
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0060.003
Science and technology studies0.0010.001
Scholarly communication0.0030.006
Open science0.0010.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0040.004

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.131
GPT teacher head0.410
Teacher spread0.279 · 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 designSimulation or modeling
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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of The International Conference on Data Science and Official StatisticsSame topicData Mining and Machine Learning ApplicationsFrench-language works237,207