MétaCan
Menu
Back to cohort
Record W4408700569 · doi:10.1080/10485252.2025.2475778

Penalized variable selection with broken adaptive ridge regression for semi-competing risks data

2025· article· en· W4408700569 on OpenAlexafffund
Fatemeh Mahmoudi, Xuewen Lu

Bibliographic record

VenueJournal of nonparametric statistics · 2025
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsMount Royal UniversityUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsFeature selectionRegressionLasso (programming language)StatisticsVariable (mathematics)Selection (genetic algorithm)RidgeRegression analysisEconometricsElastic net regularizationComputer scienceArtificial intelligenceGeography

Abstract

fetched live from OpenAlex

Semi-competing risks data arise when both non-terminal and terminal events are considered in an illness-death model. Such data with multiple events of interest are frequently encountered in medical research and clinical trials. Unlike some recent works on penalised variable selection that deal with the competing risks separately without incorporating possible correlation between them, we perform variable selection in the illness-death model using shared frailty. We propose a broken adaptive ridge (BAR) penalty to encourage sparsity and perform variable selection in an event-specific manner so that the potential risk factors can be selected and their effects can be estimated simultaneously, corresponding to each event in the study. The oracle property of the proposed BAR procedure is established, and its performance is evaluated and compared with other commonly used methods by simulation studies. The proposed method is then applied to the real-life data arising from a colon cancer 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.034
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: Methods · Consensus signal: Methods
Teacher disagreement score0.019
Threshold uncertainty score0.103

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.034
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0030.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0020.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.218
GPT teacher head0.445
Teacher spread0.227 · 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
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

Citations1
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueJournal of nonparametric statisticsSame topicStatistical Methods and InferenceFrench-language works237,207