MétaCan
Menu
Back to cohort
Record W2085963960 · doi:10.1111/rssb.12108

The Lasso for High Dimensional Regression with a Possible Change Point

2015· article· en· W2085963960 on OpenAlexafffund
Sokbae Lee, Myung Hwan Seo, Youngki Shin

Bibliographic record

VenueJournal of the Royal Statistical Society Series B (Statistical Methodology) · 2015
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsWestern University
FundersEuropean Research CouncilEconomic and Social Research CouncilNational Research Foundation of KoreaNational Research FoundationSocial Sciences and Humanities Research Council of CanadaSeoul National UniversityCompute Canada
KeywordsLasso (programming language)EstimatorCovariateMathematicsStatisticsLinear regressionRegression analysisApplied mathematicsOracleRegressionMonte Carlo methodComputer science

Abstract

fetched live from OpenAlex

Summary We consider a high dimensional regression model with a possible change point due to a covariate threshold and develop the lasso estimator of regression coefficients as well as the threshold parameter. Our lasso estimator not only selects covariates but also selects a model between linear and threshold regression models. Under a sparsity assumption, we derive non-asymptotic oracle inequalities for both the prediction risk and the l1-estimation loss for regression coefficients. Since the lasso estimator selects variables simultaneously, we show that oracle inequalities can be established without pretesting the existence of the threshold effect. Furthermore, we establish conditions under which the estimation error of the unknown threshold parameter can be bounded by a factor that is nearly n−1 even when the number of regressors can be much larger than the sample size n. We illustrate the usefulness of our proposed estimation method via Monte Carlo simulations and an application to real data.

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.047
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.100

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.047
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.002
Open science0.0020.002
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.227
GPT teacher head0.404
Teacher spread0.178 · 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

Citations110
Published2015
Admission routes2
Has abstractyes

Explore more

Same venueJournal of the Royal Statistical Society Series B (Statistical Methodology)Same topicStatistical Methods and InferenceFrench-language works237,207