MétaCan
Menu
Back to cohort
Record W2151976295

Relaxed Clipping: A Global Training Method for Robust Regression and Classification

2010· article· en· W2151976295 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

VenueNeural Information Processing Systems · 2010
Typearticle
Languageen
FieldMathematics
TopicAdvanced Statistical Methods and Models
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRobustness (evolution)OutlierRobust regressionClipping (morphology)Computer scienceRegressionRobust statisticsArtificial intelligenceScalabilityTraining setPattern recognition (psychology)MathematicsMathematical optimizationMachine learningAlgorithmStatistics
DOInot available

Abstract

fetched live from OpenAlex

Robust regression and classification are often thought to require non-convex functions that prevent scalable, global training. However, such a view neglects the possibility of reformulated training methods that can yield practically solvable alternatives. A natural way to make a function more robust to outliers is to truncate values that exceed a maximum threshold. We demonstrate that a relaxation of this form of loss clipping can be made globally solvable and applicable to any standard while guaranteeing robustness against outliers. We present a generic procedure that can be applied to standard functions and demonstrate improved robustness in regression and classification problems.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.936
Threshold uncertainty score0.524

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
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.250
GPT teacher head0.462
Teacher spread0.212 · 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