- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper investigates explicit value lifting for multivariate time-series classification (MTSC) and proposes Fourier-Taylor High-Order Lifting (FT-Lift), a trainable transformation of intermediate representations into structured high-order responses. The authors derive the proposed formulation from a truncated Fourier-Taylor expansion and subsequently relax its analytical coefficient constraints to obtain a learnable representation. The resulting module is integrated into VLNet and further evaluated on conventional CNN backbones. The paper conducts experiments on 26 UEA datasets, controlled comparisons of six lifting formulations on 10 datasets, cross-backbone transfer experiments, and synthetic high-order classification tasks. VLNet achieves an average accuracy of approximately 79.0% across the 26 datasets. The matched comparison shows that Relaxed-FT obtains the best average rank among the evaluated lifting formulations. However, its improvements over the no-lifting baseline and parameter-matched polynomial lifting are small and statistically inconclusive.
Critical strengths
S1. Clear theoretical characterization. The paper provides a careful derivation of FT-Lift and explicitly distinguishes the strict Fourier-Taylor formulation from its relaxed implementation. In particular, Proposition 2 clarifies that the relaxed formulation belongs to a polynomial function family rather than introducing additional Fourier-specific expressive capacity.
S2. Relatively comprehensive empirical analysis with meaningful controls. Beyond the broad 26-dataset benchmark, the authors investigate structural ablations, transfer to ResNet and FCN, parameter-matched lifting alternatives, and controlled high-order classification tasks. The inclusion of statistical tests and the acknowledgment of statistically inconclusive improvements are valuable.
Critical weaknesses
W1. The central methodological contribution is not sufficiently distinguished from existing polynomial representations. As established in Proposition 2, the fully relaxed FT-Lift formulation can be expressed as a polynomial mapping, with harmonic branches serving as a factorization of polynomial coefficients. Although this is theoretically well characterized, the paper does not establish a compelling practical advantage of this particular factorization. In Table 3, Relaxed-FT achieves an average accuracy of 0.7807, compared with 0.7786 for No Lift and 0.7773 for parameter-matched polynomial lifting. The corresponding differences are statistically inconclusive (p = 0.3750 and p = 0.2754, respectively).
W2. The experimental evidence supporting general effectiveness remains limited. The principal matched comparison covers only 10 UEA datasets, whereas the broader 26-dataset comparison relies on literature-reported baseline results obtained under heterogeneous experimental protocols. Furthermore, cross-backbone transfer exhibits substantially different improvements: 2.83 percentage points for ResNet but only 0.30 percentage points for FCN. These observations raise questions about the robustness and generality of the proposed component. The paper would benefit from stronger matched evaluations across more datasets and architectures, together with an analysis of computational overhead and performance variability.
Questions for authors
Q1. What practical advantage does the Fourier-Taylor-inspired factorization provide over a parameter-matched polynomial representation? Proposition 2 establishes that the relaxed formulation does not introduce a larger function family, while Table 3 reports statistically inconclusive differences. Can the authors provide additional evidence of improved optimization stability, convergence, computational efficiency, or generalization that specifically supports the proposed factorization?
Q2. How robust are the matched lifting comparisons across the full benchmark? Table 3 evaluates only 10 UEA datasets. Can the authors extend the same-protocol comparison among Relaxed-FT, No Lift, and parameter-matched polynomial lifting to all 26 datasets, or provide additional repeated-run evidence demonstrating that the observed improvements are reliable?
Q3. What explains the architecture-dependent effectiveness of FT-Lift? The reported improvement is considerably larger for ResNet than for FCN. Can the authors clarify which properties of the backbone or intermediate representations determine whether value lifting provides a meaningful benefit?