MétaCan
Menu
← Back to cohort
Record W6884647390 · doi:10.11575/prism/30587

Early Termination over Small Fields II: On the Reliability of Block Krylov-Based Algorithms in a Generic Case

2014· other· en· W6884647390 on OpenAlexfundno aff

Bibliographic record

VenuePRISM (University of Calgary) · 2014
Typeother
Languageen
Field
Topic
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsBlock (permutation group theory)Reliability (semiconductor)Lanczos resamplingMatrix (chemical analysis)Field (mathematics)Lanczos algorithm

Abstract

fetched live from OpenAlex

Block Hankel matrices, generated according to a particular distribution, arise in the analysis of Block Wiedemann and Block Lanczos algorithms. It is shown that if the input matrix A has entries in a small finite field Fq and satisfies a condition that holds generically, then the expected nullities of these matrices are low — as needed to establish the efficiency and reliability of these algorithms. A sparse matrix preconditioner, that ensures that the above-mentioned condition holds with high probability, is also contributed.

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.014
metaresearch head score (Gemma)0.100
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.076

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0140.100
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.005
Scholarly communication0.0020.004
Open science0.0020.003
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0030.001

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.012
GPT teacher head0.199
Teacher spread0.187 · 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
Published2014
Admission routes1
Has abstractyes

Explore more

Same venuePRISM (University of Calgary)→French-language works237,207→