MétaCan
Menu
Back to cohort
Record W1964782536 · doi:10.1198/106186008x343785

The Fast-τ Estimator for Regression

2008· article· en· W1964782536 on OpenAlexaff
Matías Salibián‐Barrera, Gert Willems, Ruben H. Zamar

Bibliographic record

VenueJournal of Computational and Graphical Statistics · 2008
Typearticle
Languageen
FieldMathematics
TopicAdvanced Statistical Methods and Models
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsEstimatorResamplingHeuristicMathematicsComputer scienceRegressionAlgorithmExtremum estimatorBootstrapping (finance)M-estimatorStatisticsMathematical optimizationEconometrics

Abstract

fetched live from OpenAlex

Yohai and Zamar's τ-estimators of regression have excellent statistical properties but are nevertheless rarely used in practice because of a lack of available software and the general impression that τ-estimators are difficult to approximate. We will show, however, that the computational difficulties of approximating τ-estimators are similar in nature to those of the more popular S-estimators. The main goal of this article is to compare an approximating algorithm for τ-estimators based on random resampling with some alternative heuristic search algorithms. We show that the former is not only simpler, but that when enhanced by local improvement steps it generally outperforms the consider edheuristic search algorithms, even when the seheuristic algorithms also incorporate local improvement steps. Additionally, we show that the random resampling algorithm for approximating τ-estimators has favorable statistical properties compared to the analogous and widely used algorithms for S- and least trimmed squares estimators.

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.005
metaresearch head score (Gemma)0.031
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: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.031
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.002

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.086
GPT teacher head0.415
Teacher spread0.329 · 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

Citations45
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Computational and Graphical StatisticsSame topicAdvanced Statistical Methods and ModelsFrench-language works237,207