MétaCan
Menu
Back to cohort
Record W2807251096 · doi:10.1109/dsw.2018.8439110

SUBSAMPLING LEAST SQUARES AND ELEMENTAL ESTIMATION

2018· article· en· W2807251096 on OpenAlex
Keith Knight

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

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLeverage (statistics)Ordinary least squaresStatisticsDiagonalMathematicsDimension (graph theory)Generalized least squaresEstimationRegressionLeast-squares function approximationLeast absolute deviationsRegression analysisScale (ratio)Computer scienceAlgorithmEstimatorCombinatoricsEngineering

Abstract

fetched live from OpenAlex

In large-scale regression problems where the dimension of the predictors p and number of observations n are large, subsampling is sometimes used to approximate least squares estimates. One approach to this is algorithmic leveraging, which draws a subsample of size m ≪ n from the observations where high leverage observations (according to the diagonals of the hat matrix) are sampled with higher probability; we can then estimate the regression parameter using either ordinary (unweighted) or weighted least squares using the sampled observations. In this paper, we will consider the properties of estimates based on subsampling by expressing these estimates as weighted averages of elemental estimates. In the case of algorithmic leveraging, this approach provides some theoretical justification to the empirical evidence that unweighted estimation outperforms weighted estimation in high leverage designs.

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.000
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.298
Threshold uncertainty score0.857

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.129
GPT teacher head0.432
Teacher spread0.303 · 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

Quick stats

Citations2
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicStatistical Methods and InferenceFrench-language works237,207