MétaCan
Menu
Back to cohort
Record W4287182783 · doi:10.48550/arxiv.2105.01160

The Tracking Machine Learning challenge : Throughput phase

2021· preprint· en· W4287182783 on OpenAlexaff
Sabrina Amrouche, L. Basara, P. Calafiura, D. Emeliyanov, Victor Estrade, Steven Farrell, Cécile Germain, V. V. Gligorov, T. Golling, S. Gorbunov, H. M. Gray, Isabelle Guyon, M. Hushchyn, Vincenzo Innocente, M. Kiehn, E. J. W. Moyse, D. Rousseau, A. Salzburger, Ustyuzhanin, Andrey

Bibliographic record

VenueOSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2021
Typepreprint
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsUniversity of Waterloo
FundersFermilabDeutsches Elektronen-SynchrotronUniversité de GenèveBundesministerium für Bildung und ForschungInstitut national de recherche en informatique et en automatique (INRIA)Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen ForschungAgence Nationale de la RechercheUniversité Paris-SaclayEuropean CommissionNational Science FoundationNvidiaCERNDeepMind
KeywordsThroughputTracking (education)Computer sciencePhase (matter)Artificial intelligenceMachine learningTelecommunicationsPsychologyChemistry

Abstract

fetched live from OpenAlex

This paper reports on the second "Throughput" phase of the Tracking Machine Learning (TrackML) challenge on the Codalab platform. As in the first "Accuracy" phase, the participants had to solve a difficult experimental problem linked to tracking accurately the trajectory of particles as e.g. created at the Large Hadron Collider (LHC): given O($10^5$) points, the participants had to connect them into O($10^4$) individual groups that represent the particle trajectories which are approximated helical. While in the first phase only the accuracy mattered, the goal of this second phase was a compromise between the accuracy and the speed of inference. Both were measured on the Codalab platform where the participants had to upload their software. The best three participants had solutions with good accuracy and speed an order of magnitude faster than the state of the art when the challenge was designed. Although the core algorithms were less diverse than in the first phase, a diversity of techniques have been used and are described in this paper. The performance of the algorithms are analysed in depth and lessons derived.

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.022
metaresearch head score (Gemma)0.094
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: none
Teacher disagreement score0.022
Threshold uncertainty score0.116

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0220.094
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0020.002
Scholarly communication0.0050.009
Open science0.0040.009
Research integrity0.0040.009
Insufficient payload (model declined to judge)0.0110.006

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.033
GPT teacher head0.279
Teacher spread0.246 · 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

Citations1
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueOSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)Same topicPrivacy-Preserving Technologies in DataFrench-language works237,207