ROMAN通过多尺度路由生成紧凑时序表示,提升模型对时间结构的敏感性。
ROMAN: A Multiscale Routing Operator for Convolutional Time Series Models
- 构建抗混叠多尺度金字塔,将不同时间尺度窗口转为伪通道
- 在UCR/UEA数据集上平均减少序列长度40%以上,部分任务准确率提升5.2%
- 适合关注时间位置与多尺度特征的时序分类任务
我们提出ROMAN(ROuting Multiscale representAtioN),一种确定性时序建模算子,能将时间尺度和粗粒度时间位置映射到显式通道结构中,同时减少序列长度。ROMAN构建抗混叠多尺度金字塔,从各尺度提取固定长度窗口并堆叠为伪通道,生成可被标准卷积分类器处理的紧凑表示。该方法可控制下游模型的归纳偏置:降低时间不变性、使时间池化隐含粗粒度位置感知,并通过通道混合暴露多尺度交互,通常还通过缩短处理时间轴提升计算效率。我们形式化分析了该算子,并在四个代表性卷积分类器上评估其作为预处理的效果:MiniRocket、MultiRocket、CNN-based分类器及全卷积网络(FCN)分类器。首先,设计合成任务以分离粗粒度位置感知、长程相关、多尺度交互和完全位置不变性,结果表明ROMAN行为符合预期机制,在依赖时间结构的任务中尤为有效。其次,在UCR和UEA数据集的长序列子集上对比实验显示,ROMAN提供了一种实用的替代表示,其对准确率的影响因任务而异,但对效率的提升普遍显著。代码已开源:https://github.com/gon-uri/ROMAN。
原文摘要 · Abstract (English)
We introduce ROMAN (ROuting Multiscale representAtioN), a deterministic operator for time series that maps temporal scale and coarse temporal position into an explicit channel structure while reducing sequence length. ROMAN builds an anti-aliased multiscale pyramid, extracts fixed-length windows from each scale, and stacks them as pseudochannels, yielding a compact representation on which standard convolutional classifiers can operate. In this way, ROMAN provides a simple mechanism to control the inductive bias of downstream models: it can reduce temporal invariance, make temporal pooling implicitly coarse-position-aware, and expose multiscale interactions through channel mixing, while often improving computational efficiency by shortening the processed time axis. We formally analyze the ROMAN operator and then evaluate it in two complementary ways by measuring its impact as a preprocessing step for four representative convolutional classifiers: MiniRocket, MultiRocket, a standard CNN-based classifier, and a fully convolutional network (FCN) classifier. First, we design synthetic time series classification tasks that isolate coarse position awareness, long-range correlation, multiscale interaction, and full positional invariance, showing that ROMAN behaves consistently with its intended mechanism and is most useful when class information depends on temporal structure that standard pooled convolution tends to suppress. Second, we benchmark the same models with and without ROMAN on long-sequence subsets of the UCR and UEA archives, showing that ROMAN provides a practically useful alternative representation whose effect on accuracy is task-dependent, but whose effect on efficiency is often favorable. Code is available at https://github.com/gon-uri/ROMAN
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。