MétaCan
Menu
Back to cohort
Record W4401779930 · doi:10.1002/cjs.11827

Debiased lasso after sample splitting for estimation and inference in high‐dimensional generalized linear models

2024· article· en· W4401779930 on OpenAlexvenueno aff
Omar Vazquez, Bin Nan

Bibliographic record

VenueCanadian Journal of Statistics · 2024
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsnot available
FundersNational Institute on AgingNational Institutes of HealthNational Science Foundation
KeywordsLasso (programming language)InferenceGeneralized linear modelLinear modelSample (material)Linear regressionMathematicsAlgorithmComputer scienceApplied mathematicsStatisticsArtificial intelligenceChemistryChromatography

Abstract

fetched live from OpenAlex

We consider random sample splitting for estimation and inference in high dimensional generalized linear models, where we first apply the lasso to select a submodel using one subsample and then apply the debiased lasso to fit the selected model using the remaining subsample. We show that a sample splitting procedure based on the debiased lasso yields asymptotically normal estimates under mild conditions and that multiple splitting can address the loss of efficiency. Our simulation results indicate that using the debiased lasso instead of the standard maximum likelihood method in the estimation stage can vastly reduce the bias and variance of the resulting estimates. Furthermore, our multiple splitting debiased lasso method has better numerical performance than some existing methods for high dimensional generalized linear models proposed in the recent literature. We illustrate the proposed multiple splitting method with an analysis of the smoking data of the Mid-South Tobacco Case-Control Study.

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.044
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.019
Threshold uncertainty score0.102

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.044
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0010.002
Science and technology studies0.0010.003
Scholarly communication0.0020.002
Open science0.0030.003
Research integrity0.0020.005
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.104
GPT teacher head0.357
Teacher spread0.253 · 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
GenreMethods

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

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Journal of StatisticsSame topicStatistical Methods and InferenceFrench-language works237,207