- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper focuses on frequency-based methods for time series forecasting. Existing approaches typically perform forecasting by transforming data into the Fourier domain via the Fast Fourier Transform (FFT); however, this paper argues that the use of fixed Fourier bases—which impose rigid frequency constraints—lacks flexibility. Furthermore, the Discrete Fourier Transform (DFT) and the practice of truncating high-frequency components introduce representation errors, while the FFT itself entails high computational complexity. To address these limitations, the paper proposes UFO, a lightweight forecasting architecture that eliminates the need for an explicit FFT by combining learnable latent representations of time series with input-dependent complex-phase rotations. Extensive experiments demonstrate the effectiveness of UFO.
Critical strengths
1.UFO constructs a lightweight time-series forecasting architecture by combining learnable latent representations with complex-valued phase rotations.
2.The paper seeks to provide a mathematical foundation for latent representation learning and temporal dynamic modeling, drawing upon the universal approximation theorem.
3.The model’s performance was evaluated through comparative forecasting experiments across eight real-world datasets, and its robustness was examined via high-frequency truncation experiments.
Critical weaknesses
-
The authors argue that fixed Fourier bases, discretization errors, and high-frequency truncation limit existing methods. However, a fixed-frequency representation does not necessarily constrain predictive performance, nor does the Discrete Fourier Transform (DFT) inherently introduce reconstruction errors for discrete signals. Furthermore, works such as FreDF [1] and FilterNet [2] have already improved the utilization of frequency information through frequency fusion or filtering; the authors fail to adequately justify the shortcomings of existing approaches or the necessity of learning adaptive bases.
-
In essence, UFO combines learnable latent representations with input-dependent complex-valued phase rotations—a specific architectural configuration of existing techniques. FRNet, for instance, already employs frequency-domain rotations to model temporal dynamics, while Koopman-related methods have also explored dynamic evolution within latent spaces. The paper does not sufficiently clarify the substantive innovations of UFO compared to these existing methods, and it notably lacks a direct experimental comparison with FRNet.
-
Theorem 1 is essentially an application of the classical universal approximation theorem to finite-dimensional continuous mappings, while the finite-dimensional Fourier transform is, by definition, a linear mapping. Similarly, Theorem 2 relies primarily on the universal approximation properties of continuous functions. These conclusions neither prove that adaptive bases are superior to fixed Fourier bases, nor do they guarantee that the learned latent representations possess meaningful frequency characteristics or are better at capturing temporal dynamics.
-
The paper’s logic proceeds from universal approximation capabilities to adaptive frequency representations, and subsequently to enhanced temporal dynamic modeling and predictive performance—yet these inferences do not necessarily hold. Moreover, both theorems rely on MLPs with universal approximation power, whereas the actual UFO architecture—specifically its dimension-lifting mapping, rotation coefficient generation, and projection modules—utilizes only single linear layers. Consequently, the theoretical results do not provide direct guarantees for the practical architecture employed.
-
The paper lacks critical ablation and comparative experiments—such as comparing adaptive bases against fixed Fourier bases, complex-valued rotations against standard MLPs or linear mappings, and the full UFO model against a version with the rotation module removed. As a result, the current experimental evidence is insufficient to determine whether the observed performance gains stem from the adaptive frequency representation, the rotation mechanism, or simply the underlying linear mappings. Furthermore, high-frequency truncation experiments merely demonstrate that the model maintains strong predictive performance under various truncation conditions; they do not constitute direct proof that the model has successfully captured the so-called "core" temporal dynamics.
-
Although the computational complexity of the FFT is , the input length used in the paper’s experiments is only 96, meaning the actual computational overhead of the FFT is likely quite minimal. Moreover, the dense linear mappings employed by UFO entail computational costs that depend on both the input and latent dimensions. The paper’s assertion that the overall complexity is lacks a solid foundation, and the claim regarding its efficiency advantage is not substantiated by any comparison of actual runtime or computational overhead.
[1] Not All Frequencies Are Created Equal: Towards a Dynamic Fusion of Frequencies in Time-Series Forecasting. ACM MM 2024.
[2] FilterNet: Harnessing Frequency Filters for Time Series Forecasting. NeurIPS 2024.
Questions for authors
See Weaknesses