- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduced GAMMA covariance for modeling long-range memory and studied its finite-dimensional Markov approximation based on generalized Gauss–Laguerre approximation. Theoretical results show that this surrogate preserves relevant low-order moments and local covariance structure of the exact GAMMA kernel, providing a principled finite-state approximation.
For experiments on kernel evaluation, the paper compares the exact GAMMA kernel and its approximation GAMMA–GL against matched Mat´ern baselines to assess both predictive performance and the fidelity of the scalable state-space approximation.
For experiments on representation learning, the paper evaluates GAMMA–GL as a temporal prior for variational representation learning by comparing GGPVAE with MGPVAE on long-memory Rotating MNIST and ERA5.
Critical strengths
None
Critical weaknesses
However, state-of-the-art methods for the evaluated tasks should also be compared. The current comparisons are too narrow, which just focuses on GP related methods.
Questions for authors
Could you provide a comparison on computational costs of different methods? That would be interesting to readers.
In addition, it would be much better to provide some visualization in page 2 to show the characteristics of different kernels.
Expanded Baseline Comparisons, Long-Horizon Forecasting Results, Computational Efficiency Analysis, and Kernel Visualizations
We thank the reviewer for their evaluation and constructive suggestions. In response, we have substantially expanded the experiments across both kernel modeling and representation learning. We introduce broader GP and non-GP baselines, synthetic experiments generated directly from exact GAMMA, approximation-order sensitivity analyses, longer forecasting horizons, and computational-cost comparisons. We also introduce a new Rotating MNIST benchmark with independent Gaussian perturbations to evaluate different temporal priors and representation quality beyond GAMMA-generated data. Additionally, we provide new kernel visualizations illustrating smoothness and long-range dependence. These extensive revisions offer a more comprehensive evaluation of our contributions. We address each concern below.
Compare against state-of-the-art methods for the evaluated task:
To address the concern regarding limited baseline comparisons, we have substantially expanded the real-world experiments to include both GP-based and non-GP forecasting methods, namely the rational-quadratic kernel, ARFIMA, and DLinear, alongside freely parameterized Matérn mixtures and Gamma interval-bin approximations. Using 50 percent of each dataset for training, we evaluate forecasting windows of 25, 100, 250, and 500 time steps. As shown in Table 1 of the revised manuscript, GAMMA–GL achieves the lowest RMSE and NLPD among all evaluated methods on DTWEXBGS and PEP–KO for windows of 100, 250, and 500, while remaining competitive on UCI. At the longest horizon (w = 500), GAMMA–GL achieves RMSE values of 0.0646 and 0.1203 on DTWEXBGS and PEP–KO, compared with 0.0826 and 0.1633 for rational quadratic, 0.0935 and 0.2084 for ARFIMA, and 0.1341 and 0.1461 for freely parameterized Matérn mixtures, respectively. Moreover, GAMMA–GL offers a favorable accuracy–efficiency trade-off, requiring only 5.35 seconds on DTWEXBGS compared with 37.76 seconds for exact GAMMA and 72.02 seconds for the free Matérn mixture. These results demonstrate the practical benefits of GAMMA–GL beyond comparisons with single-component Matérn kernels, particularly for long-horizon forecasting, where its structured multi-scale covariance provides competitive predictive accuracy at substantially lower computational cost than several alternative GP models.
Comparison of the computational costs:
To address the concern regarding computational efficiency, we have added empirical runtime comparisons alongside predictive performance (RMSE and NLPD) across forecasting windows of 25, 100, 250, and 500 time steps (Table 1). The results show that GAMMA–GL achieves the lowest RMSE and NLPD on DTWEXBGS and PEP–KO for all windows bigger than 25, while remaining competitive on UCI. Importantly, GAMMA–GL offers a favorable accuracy–efficiency trade-off compared with alternative GP models. At the longest forecasting window (w = 500), GAMMA–GL requires only 5.35 seconds on DTWEXBGS, compared with 37.76 seconds for exact GAMMA, 72.02 seconds for freely parameterized Matérn mixtures, and 45.06 seconds for rational quadratic. Similarly, on PEP–KO, GAMMA–GL requires 18.89 seconds, compared with 259.16, 202.77, and 193.36 seconds, respectively. These correspond to approximately 7–14-fold reductions in computational time relative to these alternatives, while GAMMA–GL also achieves superior RMSE and NLPD on both datasets. Although simpler methods such as ARFIMA remain faster, these results demonstrate that GAMMA–GL provides a favorable balance between predictive accuracy and computational efficiency, particularly for long-horizon setting.
Kernel visualization :
To address the reviewer's suggestion, we have added a new kernel visualization (Figure 5 in the revised version, Appendix E.1.), comparing GAMMA with Matérn for p = 0 and p = 1, shape parameters α ∈ {0.3, 0.5, 1}, and effective ranges of 200 and 500. All kernels are calibrated to the same effective range for a fair comparison. The figure illustrates how smaller α values produce heavier polynomial tails and slower asymptotic decay, even when correlations decrease faster at shorter lags, while Matérn exhibits exponential decay. It also demonstrates how the smoothness order controls near-origin behavior and the effective range determines the temporal scale, highlighting GAMMA's ability to independently control local smoothness and long-range dependence. Due to space constraints, the figure is currently included in the appendix; we plan to incorporate it into the main text in the final version, if accepted.
We hope that the substantial experimental extensions, comparisons, and new results address the reviewer's concerns and provide stronger evidence of the paper's theoretical and practical contributions. We also hope that these revisions further strengthen the overall quality and significance of the paper. We will upload the revised manuscript before the deadline and sincerely appreciate the reviewer's time, effort, and constructive feedback.