Response to Reviewer
We thank the referee for his appreciation of our work, aligned with the other reviews that we received. You can find below an overview of the major modifications of the manuscript followed by detailed responses to your questions.
- Q1: While the emprical results are nice, it would further strengthen the paper if the authors could perform ablation experiments to uncover/provide a better intuition about why their algorithm performs well against others.
A1: We thank the referee for this suggestion. Following this remark, several ablation studies were added in the appendix. For instance, in Appendix A.6, we provided more justification on the two-steps training process presented in the paper, showing how it solves some training instabilities and improves final model accuracy. Likewise, we reviewed in Appendix A.7 the impact of learning the variance of the emission distributions and in Appendix A.8, the impact of using a Markov chain for the latent states.
- Q2:The author's new algorithm performs almost similarly to previous SOTA Transformer-based model PatchTST/64. However, it's unclear from my first reading why one would prefer one over the other. Is it easier to train/better runtime etc.?
A2: We thank the referee for this thoughtful remark and recognize that the motivation for the method presented was not clearly defined enough in the paper. One argument in favor of our method is that it provides probabilistic predictions that allow users to build confidence intervals. On the Fashion use case, by analysing when and where the emission laws having access to the influencers signals is activated, we could spot specific regime shifts in the time series and understand how the proposed approach succeeded at forecasting these challenging patterns. A natural future work would be to propose more complex generative models where Transformer architectures could be used in the transition densities and emission distributions. Such models would benefit from the state space framework and highlight the usefulness of the two stage procedures.
- Q3: It's nice that the authors performed a grid search over learning rates and batch size for the other algorithms. I think the paper would be further strengthened if the authors conducted a hyperparameter search also over network size where it make sense (similar to the grid search that the authors performed over hidden size for their network)?
A3: We thank the referee for this suggestion. Thanks to this comment, we provided a complementary ablation study presented in appendix A.5. In this section, we performed a grid search on the number of parameters and compared the optimal size found for our approach with the size of other state-of-the-art methods. We found that our model performed well with an architecture with 700,000 parameters, which is superior to PatchTST, Informer, and DeepAR methods and inferior to N-HiTS, N-BEATS, and TimesNet methods. Considering recent published models for natural language processing or visual detections, there is still a huge margin regarding the size of all current time series forecasting methods.