Task-Directed Residual AddUNet:Perfect-Reconstruction Routing for Full-Rate Representations
Paper recorded by Signals 4 on 2026-09-14 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-14 on arXiv · recorded by Signals 4 on 2026-09-15
Category: cs.LG · 机器学习 · first seen 2026-09-15
Abstract
This paper establishes a perfect-reconstruction (PR) interpretation of AddUNet and its full-rate realization, and introduces a Residual Full-Rate PR architecture for task-directed representation learning. The survivor--skip structure of a constrained additive U-Net is shown to be exactly equivalent to a critically sampled multirate PR filter bank. The full-rate formulation removes the complementar
Read on arXiv →
Cite this page: Task-Directed Residual AddUNet:Perfect-Reconstruction Routing for Full-Rate Representations: the #54 most recent of 215 cs.LG papers we have recorded (as of 2026-09-14). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/task-directed-residual-addunet-perfect-reconstruction-routing-for-full-rate-repr.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable:
papers.json
Get 4 AI signals a day by email — free.
Get 4 AI signals a day by email — free