MétaCan
Menu
Back to cohort
Record W1922934067 · doi:10.17713/ajs.v32i1&2.452

Adaptive Regression on the Real Line in Classes of Smooth Functions

2002· article· en· W1922934067 on OpenAlexaff
LM Artiles, B. Ya. Levit

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsQueen's University
Fundersnot available
KeywordsMathematicsMinimaxSmoothnessEstimatorPointwiseEquidistantReal lineAdaptive estimatorFunction (biology)Applied mathematicsConstant (computer programming)Parametric statisticsLipschitz continuityMathematical optimizationDiscrete mathematicsMathematical analysisStatisticsComputer science

Abstract

fetched live from OpenAlex

Abstract: Adaptive pointwise estimation of an unknown regression function f(x), x ∈ R corrupted by additive Gaussian noise is considered in the equidistant design setting. The function f is assumed to belong to the class A(α) of functions whose Fourier transform are rapidly decreasing in the weighted L2-sense. The rate of decrease is described by a weight function that depends on the vector of parameters α which, in the adaptive setting, is typically unknown. For any of the classes A(α), α fixed, we describe minimax estimators up to a constant as the bin-width goes to zero. Conditions under which an adaptive study is suitable are presented and a notion of adaptive asymptotic optimality is introduced based on distinguishing, among all possible functional scales, between the so-called non-parametric (NP) and pseudo-parametric (PP) scales. We propose adaptive estimators which ‘tune up ’ point-wisely to the unknown smoothness of f. We prove them to be asymptotically adaptively minimax for large collections of NP functional scales, subject to being rate efficient for any of the PP functional scales.

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.008
metaresearch head score (Gemma)0.035
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.008
Threshold uncertainty score0.045

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.035
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.003
Scholarly communication0.0010.003
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.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.278
GPT teacher head0.397
Teacher spread0.119 · 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

Citations2
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicStatistical Methods and InferenceFrench-language works237,207