---
格式版本: 2
标题: "Fast and Memory-Efficient Wavelet Convolutions via I/O-Aware Reformulation"
原文链接: "https://arxiv.org/abs/2608.10805"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 11:24:05 UTC (37 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T10:48:22+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T10:46:47+08:00"
入库时间: "2026-08-12T02:48:22.545Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=Scale-up&searchtype=all"
匹配关键词:
  - "Scale-up"
  - "HBM"
  - "bandwidth"
  - "AI"
相关厂家:
  []
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 10
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "论文主题为计算机视觉中的Wavelet卷积优化，与超节点、AI Rack、机柜级系统或相关部件供电散热互连等完全无关，仅搜索词命中，无实质内容。"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T10:48:26+08:00"
AI主题相关性: 0
AI来源权威性: 5
AI新颖性: 5
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 0
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.10805"
---

## Computer Science > Computer Vision and Pattern Recognition

## Title:Fast and Memory-Efficient Wavelet Convolutions via I/O-Aware Reformulation

Authors:[Amit Aflalo](https://arxiv.org/search/cs?searchtype=author&query=Aflalo,+A), [Shahaf E. Finder](https://arxiv.org/search/cs?searchtype=author&query=Finder,+S+E), [Roy Amoyal](https://arxiv.org/search/cs?searchtype=author&query=Amoyal,+R), [Eran Treister](https://arxiv.org/search/cs?searchtype=author&query=Treister,+E), [Oren Freifeld](https://arxiv.org/search/cs?searchtype=author&query=Freifeld,+O)

[View PDF](https://arxiv.org/pdf/2608.10805) [HTML (experimental)](https://arxiv.org/html/2608.10805v1)

> Abstract:Wavelet convolution (WTConv) has emerged as an increasingly popular drop-in replacement for standard convolutions, expanding a network's receptive field exponentially with the number of decomposition levels while keeping the parameter count linear. However, its reference implementation is severely memory-bound due to excessive data movement through high-bandwidth memory (HBM). We develop an I/O model of WTConv to characterize this bottleneck and use it to guide three algebraic reformulations: (1) recomputing the inexpensive Haar analysis butterfly on chip, (2) collapsing the multi-level synthesis cascade into a single closed-form pass indexed by output-coordinate bits, and (3) folding learned per-channel scales into the convolution weights. Together, these reformulations enable an I/O-aware fused implementation that substantially reduces HBM traffic. We evaluate the WTConvNeXt configuration across decomposition levels and a broad range of tensor shapes. Despite performing comparable arithmetic, the reference WTConv is substantially slower than the depthwise convolution it replaces. Our reformulation reduces modeled HBM traffic by approximately $2.55\times$, yielding up to a $4.35\times$ training speedup over the reference while roughly halving peak memory usage. Thus, our reformulation preserves the benefits of WTConv while substantially reducing its execution time and memory footprint, removing the systems overhead that previously limited its practical efficiency.

| Subjects: | Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI) |
| --- | --- |
| Cite as: | [arXiv:2608.10805](https://arxiv.org/abs/2608.10805) \[cs.CV\] |
|  | (or [arXiv:2608.10805v1](https://arxiv.org/abs/2608.10805v1) \[cs.CV\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.10805](https://doi.org/10.48550/arXiv.2608.10805) |

## Submission history

From: Amit Aflalo \[[view email](https://arxiv.org/show-email/9a123141/2608.10805)\]  
**\[v1\]** Tue, 11 Aug 2026 11:24:05 UTC (37 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.10805) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
