MétaCan
Menu
Back to cohort
Record W2005387402 · doi:10.1142/s1793536911000751

TREND FILTERING: EMPIRICAL MODE DECOMPOSITIONS VERSUS ℓ<sub>1</sub> AND HODRICK–PRESCOTT

2011· article· en· W2005387402 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

VenueAdvances in Adaptive Data Analysis · 2011
Typearticle
Languageen
FieldComputer Science
TopicTime Series Analysis and Forecasting
Canadian institutionsQueen's University
Fundersnot available
KeywordsHilbert–Huang transformHodrick–Prescott filterMode (computer interface)Series (stratigraphy)Time seriesTrend analysisLagMathematicsComputer scienceAlgorithmEconometricsStatistics

Abstract

fetched live from OpenAlex

Considering the problem of extracting a trend from a time series, we propose a novel approach based on empirical mode decomposition (EMD), called EMD trend filtering. The rationale is that EMD is a completely data-driven technique, which offers the possibility of estimating a trend of arbitrary shape as a sum of low-frequency intrinsic mode functions produced by the EMD. Based on an empirical analysis of EMD, an automatic procedure is proposed to select the requisite intrinsic mode functions. The performance of the EMD trend filtering is evaluated on simulated time series containing different forms of trends. Comparing furthermore to two existing techniques (ℓ 1 -trend filtering and Hodrick–Prescott filtering), we observe that the EMD trend filtering performs very similarly, while it does not require assumptions on the form of the trend and it is free from estimation parameters. We also illustrate the performance of the technique on the S&amp;P 500 index, as an example of real-world time series.

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.000
metaresearch head score (Gemma)0.000
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: none
Teacher disagreement score0.932
Threshold uncertainty score0.841

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.003
Open science0.0010.001
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.092
GPT teacher head0.343
Teacher spread0.251 · 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