MétaCan
Menu
Back to cohort
Record W4387940304 · doi:10.36227/techrxiv.24328609.v1

An Explicit Improvement on Generative Adversarial Network-Based Time Series Generation: Applying Synthetic Data to N2O Emission Prediction in Farming

2023· preprint· en· W4387940304 on OpenAlexaff
Ci Lin, Patrick Killeen, Futong Li, Tet Yeap, Iluju Kiringa

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicTime Series Analysis and Forecasting
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsSeries (stratigraphy)Computer scienceSmoothingSynthetic dataAlgorithmTime seriesMatching (statistics)Sampling (signal processing)MathematicsData miningStatisticsMachine learningFilter (signal processing)

Abstract

fetched live from OpenAlex

Traditionally, time series data augmentation has primarily focused on improving the architecture of Generative Adversarial Network (GAN), with the aim of closely matching the original data distribution while also preserving the dynamic behavior of the original data. However, even state-of-the-art GAN models like TimeGAN fall short in preserving the temporal dynamics present in the original time series due to the absence of first-order difference information. To address this limitation, this study proposes a novel process for generating multivariate time series data. The proposed process comprises four essential modules: a) the GAN module for generating multivariate time series data, b) the sampling module for preserving the first-order difference distribution, c) the smoothing module for refining the generated data, and d) an evaluation module using the Kolmogorov-Smirnov Test (KS-test) and Hilbert-Schmidt Independence Criterion (HSIC), along with other metrics to test the synthetic time series data. This comprehensive approach ensures that the synthetic time series data maintains both the distribution and the dynamic behavior of the original data. We extensively discuss the role of the β factor in the modified Metropolis-Hastings algorithm (in the sampling module), which controls the level of information preservation from the original time series. Our experiments reveal that with small β values, periodic information can be retained effectively. The joint distribution of the first-order difference of the synthetic time series data remains consistent when the same β value is applied in the modified Metropolis-Hastings algorithm. However, we observe that β has no impact on the partial autocorrelation functions. Nevertheless, the generated data from the sampling module maintains the memoryless property of the Markov Chain. Therefore, in the smoothing module, we apply the exponential moving average (EMA) method to simulate the long-term relationships within the original time series, and find that an optimal α value is approximately 0.4 or 0.5. Lastly, we employ the synthetic time series data to train a neural network model developed in another work. Our findings indicate that the neural network model trained on synthetic time series data exhibits performance comparable to that of a model trained on the original data.

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.001
metaresearch head score (Gemma)0.003
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
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.081
GPT teacher head0.287
Teacher spread0.206 · 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
GenreEmpirical

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

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicTime Series Analysis and ForecastingFrench-language works237,207