- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
Matrix-valued time series arise in many settings where each time step is naturally represented as a matrix. Matrix-variate Gaussian processes (in short, MVGPs) provide a principled probabilistic framework for this task. However, direct MVGP prediction in the observation space is computationally expensive.
To overcome this bottleneck, this paper formulates a matrix-variate Gaussian process state-space model (MV-GPSSM) with structured latent dynamics.
The main idea is to represent the observed sequence as a third-order tensor and apply a Tucker2-based decomposition, which yields a sequence of low-dimensional latent matrices. Technically, this shifts the dominant cost from the observation space to the reduced latent space while preserving row–column structure and uncertainty-aware prediction. Within this formulation, the latent interaction structures induce Kronecker-product and Kronecker-sum covariance forms, respectively, providing a dynamical interpretation of these structured covariance forms in the proposed model family.
Experiments on BEV fleet data and publicly available weather data show that the proposed method maintains predictive performance comparable to that of the baseline methods in terms of both RMSE and NLL, while remaining tractable at large matrix sizes where observation-space methods become infeasible, including experiments with up to 800 vehicles.
Critical strengths
None.
Critical weaknesses
The two used datasets are quite far from public familiarity. And for these two datasets, what are the current performances of large models or deep neural networks? That should be adopted here to give comparisons, too.
Questions for authors
For these two used datasets, what are the current performances of large models or deep neural networks?
Response to Reviewer tKtN
We thank the reviewer for the comments.
Q. How do large models or deep neural networks perform on the two datasets?
We did not run large models or deep neural networks on these datasets, because they do not provide the joint predictive distribution that we evaluate (General Response (5) Deep forecasters). Our target is the joint predictive distribution (General Response (1) Problem setting); in the BEV task, for example, the aggregator needs the distribution of the fleet's state of charge, because the state of charge at grid connection and the departure time vary across vehicles. Channel-independent forecasters such as PatchTST share weights across series and predict each series separately, so they provide no cross-vehicle covariance, whereas the variance of the fleet total, 1⊤Σ1, depends on it. Forecasters that attend across series, such as iTransformer and Crossformer, still output point forecasts without a predictive covariance. In contrast, MV-GPSSM outputs this covariance, and its row–column structure makes it estimable from few weekly transitions (General Response (4) Row–column structure). On the two datasets used, we compare MV-GPSSM with baselines that provide joint predictive distributions, and it attains the lowest NLL on both: on the BEV data at large fleet sizes with N=20 (Table 1) and N=10 training weeks (Table R1 in General Response (4)), and on the weather data at every size (Table 10). The BEV data are proprietary, and the public weather data are provided for reproducibility (General Response (2) Datasets).