Pith. sign in

REVIEW 1 cited by

A Unified Framework for U-Net Design and Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.19638 v2 pith:RTLJMTRM submitted 2023-05-31 stat.ML cs.CVcs.LGeess.IV

classification stat.MLcs.CVcs.LGeess.IV
keywords u-netu-netsdesignframeworkarchitecturesarchitecturediffusionencoder
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

U-Nets are a go-to, state-of-the-art neural architecture across numerous tasks for continuous signals on a square such as images and Partial Differential Equations (PDE), however their design and architecture is understudied. In this paper, we provide a framework for designing and analysing general U-Net architectures. We present theoretical results which characterise the role of the encoder and decoder in a U-Net, their high-resolution scaling limits and their conjugacy to ResNets via preconditioning. We propose Multi-ResNets, U-Nets with a simplified, wavelet-based encoder without learnable parameters. Further, we show how to design novel U-Net architectures which encode function constraints, natural bases, or the geometry of the data. In diffusion models, our framework enables us to identify that high-frequency information is dominated by noise exponentially faster, and show how U-Nets with average pooling exploit this. In our experiments, we demonstrate how Multi-ResNets achieve competitive and often superior performance compared to classical U-Nets in image segmentation, PDE surrogate modelling, and generative modelling with diffusion models. Our U-Net framework paves the way to study the theoretical properties of U-Nets and design natural, scalable neural architectures for a multitude of problems beyond the square.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Neural Preconditioning via Krylov Subspace Geometry

    math.NA 2025-07 conditional novelty 5.0 of 10

    Fine-tuning a neural preconditioner with a differentiable FGMRES loss on principal angles cuts average FGMRES iterations roughly tenfold on mixed-dimensional 3D-1D problems.

Pith tools