HypLTSF: A Hyperbolic Geometric View of Multi-Scale Hierarchies for Long-Term Time Series Forecasting
AuthorsNamwoo Kim, Hyungryul Baik, Yoonjin Yoon
Resources
HypLTSF maps multi-scale time-series patterns into hyperbolic space so that fine-to-coarse temporal hierarchies become explicit and useful for long-term forecasting.
Key results
Number of long-term forecasting benchmark datasets evaluated.
Dataset-horizon settings where HypLTSF achieves the best MAE out of 32.
Dataset-horizon settings where HypLTSF achieves the best MSE out of 32.
Reduction versus TimeKAN on Solar at forecasting horizon 720.
Reduction on Solar at horizon 720 with identical model capacity.
What the paper found
HypLTSF treats the multi-scale structure of long-term time series as an explicit geometric hierarchy rather than an incidental result of feature mixing. It builds a temporal pyramid through progressive average pooling, decomposes every scale into trend and seasonal components, fuses the representations, and embeds them in a Poincare ball. A radial ordering loss places fine-scale child embeddings farther from the origin than coarse-scale parents, while an angular coherence loss groups siblings that share a parent into directional branches; predictions are generated in tangent space and combined with learnable scale weights. Across 8 benchmarks, including ETT, Weather, Electricity, Traffic, and Solar, HypLTSF ranks first in MAE in 30 of 32 dataset-horizon settings and first in MSE in 20. On Solar at horizon 720, it reduces MAE against TimeKAN by 16.4%, from 0.269 to 0.225, while its hyperbolic representation lowers MSE relative to an otherwise identical Euclidean model by 9.5%, from 0.220 to 0.199. Ablations show that combining both hierarchy losses reduces Solar MSE at horizon 720 from 0.219 without hierarchy regularization to 0.199. The framework also transfers as a plug-in to TimeMixer and MICN, and efficiency tests run on an NVIDIA RTX 3090 indicate competitive latency alongside improved accuracy.
Original abstract
Multi-scale modeling has become an effective approach for long-term time series forecasting, capturing temporal patterns that range from fine-grained local dynamics to coarse global trends. Representations across these temporal scales are inherently hierarchical, with coarser scales abstracting and aggregating information from finer ones. While existing approaches readily exchange information across these scales, the hierarchy itself is typically left as an emergent byproduct of such interactions rather than captured as a geometric structure in its own right. In this paper, we introduce HypLTSF, a framework that endows the multi-scale hierarchy with a concrete geometric form by embedding scale-wise representations into the Poincaré ball, whose exponentially expanding volume naturally accommodates hierarchical structures. To align this geometry with the temporal hierarchy, HypLTSF imposes two constraints: (1) a radial constraint that orders embeddings by their level of abstraction, and (2) an angular constraint that groups fine-scale patterns sharing a common coarser-scale ancestor. Extensive experiments on long-term time series forecasting benchmarks show that HypLTSF achieves state-of-the-art performance, suggesting that explicitly modeling the multi-scale hierarchy as a geometric structure is effective for forecasting.
Read the original paperMore in Neural Networks
Browse all 22 papers →End-to-End Hard-Label Cryptanalytic Model Extraction Using Efficient Sign Recovery
Akira Ito, Takayuki Miura, Yosuke Todo
A new query-efficient technique makes it possible to steal the parameters of small black-box neural networks using only their predicted labels.
Retrieving Individual Stems from Music Mixtures with Slot Embeddings
David Braun, Junyi Fan, Pranay Manocha, Donald S. Williamson, Adam Finkelstein
Stembed lets music producers search for individual instrument sounds hidden inside a full song by representing the mixture as multiple searchable stem-like embeddings.
The Linear Representation Hypothesis Needs a Group Action
Louie Hong Yao, Yuhao Li, Shengchao Liu
This paper argues that claims about linear representations only become meaningful once we specify which transformations leave a representation essentially unchanged.