MétaCan
Menu
Back to cohort
Record W3126057260

A Fixed-bandwidth View of the Pre-asymptotic Inference for Kernel Smoothing with Time Series Data

2015· preprint· en· W3126057260 on OpenAlexaff
Min Seong Kim, Yixiao Sun, Jingjing Yang

Bibliographic record

VenueRePEc: Research Papers in Economics · 2015
Typepreprint
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsMathematicsSmoothingEstimatorAutocorrelationApplied mathematicsStatisticsKernel smootherCovarianceAsymptotically optimal algorithmHeteroscedasticityMathematical optimizationKernel methodComputer science
DOInot available

Abstract

fetched live from OpenAlex

This paper develops robust testing procedures for nonparametric kernel methods in the presence of temporal dependence of unknown forms. Based on the ?fixed-bandwidth asymptotic variance and the pre-asymptotic variance, we propose a heteroskedasticity and autocorrelation robust (HAR) variance estimator that achieves double robustness ? it is asymptotically valid regardless of whether the temporal dependence is present or not, and whether the kernel smoothing bandwidth is held constant or allowed to decay with the sample size. Using the HAR variance estimator, we construct the studentized test statistic and examine its asymptotic properties under both the fi?xed-smoothing and increasing-smoothing asymptotics. The ?fixed-smoothing approximation and the associated convenient t-approximation achieve extra robustness ? it is asymptotically valid regardless of whether the truncation lag parameter governing the covariance weighting grows at the same rate as or a slower rate than the sample size. Finally, we suggest a simulation-based calibration approach to choose smoothing parameters that optimize testing oriented criteria. Simulation shows that the proposed procedures work very well in ?finite samples.

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.023
metaresearch head score (Gemma)0.131
Version: metacan-v3-hybrid-931329e0061cValidation 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.023
Threshold uncertainty score0.123

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0230.131
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.004
Scholarly communication0.0020.004
Open science0.0040.002
Research integrity0.0020.004
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.057
GPT teacher head0.333
Teacher spread0.275 · 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 designSimulation or modeling
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

Citations0
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueRePEc: Research Papers in EconomicsSame topicNeural Networks and ApplicationsFrench-language works237,207