MétaCan
Menu
Back to cohort
Record W4206475020 · doi:10.1109/mnano.2021.3126031

Approximate Computing [The Editors’ Desk]

2022· article· en· W4206475020 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

VenueIEEE Nanotechnology Magazine · 2022
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsDeskBig dataComputer sciencePleasureField (mathematics)Special sectionData scienceLibrary scienceArtificial intelligenceEngineering physicsEngineeringMathematicsPsychologyData mining

Abstract

fetched live from OpenAlex

Computing has been at the core of the Digital Revolution (also known as the Third Industrial Revolution) since the latter half of the 20th century. Progress on approximate computing has been promising for data storage and processing associated with recent advancements in artificial intelligence and big data. It is our great pleasure to introduce the guest editors of this special issue of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">IEEE Nanotechnology Magazine</i> on approximate computing: Dr. Jie Han and Dr. Weiqiang Liu, who are experts in the field of high-performance computing, and Prof. Shao-Ku Kao, Chang Gung University, and Prof. Toshiya Sakata, University of Tokyo, serve as associate editors for this special issue. We hope the readers will greatly enjoy it.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.803
Threshold uncertainty score0.771

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0030.001
Research integrity0.0000.001
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.013
GPT teacher head0.244
Teacher spread0.231 · 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