MétaCan
Menu
Back to cohort
Record W4396682651 · doi:10.1145/3645279.3645310

A Correlation-Driven Adaptive Lasso for Robust Logistic Regression Model Using Trimming Step

2023· article· en· W4396682651 on OpenAlex

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
TopicAdvanced Statistical Methods and Models
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsCollinearityMulticollinearityTrimmingLogistic regressionRobustness (evolution)Computer scienceCorrelationLasso (programming language)Data miningStatisticsRegression analysisArtificial intelligenceMathematicsMachine learning

Abstract

fetched live from OpenAlex

The presence of contamination can influence the performance of parameter estimation in the binary logistic regression. Additionally, the emergence of collinearity among independent variables also gives rise to the issue of multicollinearity. In this work, we propose a novel correlation-driven adaptive lasso algorithm designed to enhance the robustness of logistic regression by incorporating a trimming step. The efficacy of this approach stems from the synergistic utilization of correlation-driven trimming techniques, which collectively serve to mitigate the impact of contaminated observations. The algorithm is designed to select information highly correlated features adaptively and to detect outilers simultaneously by maximizing a trimmed likelihood function. The proposed method has been evaluated and compared with other exisitng methods through a simulation study. Finally, an application to a real data set is given.

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.002
Version: codex-gemma-dda1882f352aValidation 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.030
Threshold uncertainty score0.479

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.002
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.0000.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.498
GPT teacher head0.483
Teacher spread0.015 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Statistical Methods and ModelsFrench-language works237,207