MétaCan
Menu
Back to cohort

On the Randomized Babai Point

2020· article· en· W3081268221 on OpenAlexaff
Xiao-Wen Chang, Zhilong Chen, Ying‐zi Xu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsMcGill University
Fundersnot available
KeywordsInteger (computer science)Point (geometry)MathematicsRandomized algorithmGaussianDiscrete mathematicsAlgorithmCombinatoricsMathematical optimizationComputer science

Abstract

fetched live from OpenAlex

Estimating the integer parameter vector in a linear model with additive Gaussian noise arises from many applications, including communications. The optimal approach is to solve an integer least squares (ILS) problem, which is unfortunately NP-hard. Recently Klein's randomized algorithm, which finds a sub-optimal solution to the ILS problem, to be referred to as the randomized Babai point, has attracted much attention. This paper presents a formula of the success probability of the randomized Babai point and some interesting properties, and compares it with the deterministic Babai point.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.086
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0040.003
Science and technology studies0.0030.011
Scholarly communication0.0030.011
Open science0.0030.007
Research integrity0.0050.009
Insufficient payload (model declined to judge)0.0070.002

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.017
GPT teacher head0.211
Teacher spread0.193 · 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 designTheoretical or conceptual
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

Citations4
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicCryptography and Data SecurityFrench-language works237,207