arXiv:2506.06041cs.CVcs.LG2025-06被引 1

提出线性复杂度张量处理层,提升图像等高维数据建模效率。

Tensor-to-Tensor Models with Fast Iterated Sum Features

  • 利用排列计数中的角树结构实现输入大小线性代价的张量变换
  • 在小规模ResNet中替换层后仅损失0.1%准确率,参数与计算量显著降低
  • 适用于图像分类与异常检测,纹理异常检测平均AUROC达97.3%

图像等高阶张量数据在现代深度学习中广泛应用。由于其固有的高维特性,对非二次方复杂度的张量处理层需求比序列数据更迫切。本文提出一种新型张量到张量层,以线性成本处理输入,利用排列计数领域中的“角树”数学工具。针对二阶张量,构建了可嵌入图像处理流水线的图像到图像层。该方法既可视为状态空间模型的高阶推广,也基于迭代积分(或求和)签名的多参数推广。提出的张量到张量概念用于构建名为快速迭代求和(FIS)的神经网络层,能无缝集成其他层类型。实验表明,将小型ResNet部分层替换为FIS层,在分类任务中达到与大型ResNet相当的精度(差距仅0.1%),同时减少可训练参数和乘加操作。此外,基于FIS构建的异常检测模型在流行的MVTec AD纹理数据集上平均AUROC达97.3%。代码已公开于https://github.com/diehlj/fast-iterated-sums。

原文摘要 · Abstract (English)

Data in the form of images or higher-order tensors is ubiquitous in modern deep learning applications. Owing to their inherent high dimensionality, the need for subquadratic layers processing such data is even more pressing than for sequence data. We propose a novel tensor-to-tensor layer with linear cost in the input size, utilizing the mathematical gadget of ``corner trees'' from the field of permutation counting. In particular, for order-two tensors, we provide an image-to-image layer that can be plugged into image processing pipelines. On the one hand, our method can be seen as a higher-order generalization of state-space models. On the other hand, it is based on a multiparameter generalization of the signature of iterated integrals (or sums). The proposed tensor-to-tensor concept is used to build a neural network layer called the Fast Iterated Sums (FIS) layer which integrates seamlessly with other layer types. We demonstrate the usability of the FIS layer with both classification and anomaly detection tasks. By replacing some layers of a smaller ResNet architecture with FIS, a similar accuracy (with a difference of only 0.1\%) was achieved in comparison to a larger ResNet while reducing the number of trainable parameters and multi-add operations. The FIS layer was also used to build an anomaly detection model that achieved an average AUROC of 97.3\% on the texture images of the popular MVTec AD dataset. The processing and modelling codes are publicly available at https://github.com/diehlj/fast-iterated-sums.

张量建模高效网络异常检测

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。