HyperAIHyperAI

Command Palette

Search for a command to run...

FuseReg: 레이어 융합 정규화가 표현 오토인코더의 재구성-생성 간극을 완화한다

초록

표현 오토인코더(RAE)는 사전 학습된 시각 인코더의 특징을 재구성 및 확산 잠재 변수로 재사용하여 강력한 시각 표현을 이미지 생성에 통합한다. 그러나 RAE는 여전히 생성기와 픽셀 디코더가 공유하는 잠재 공간을 형성할 인코더 레이어를 결정해야 한다. 이 선택에는 트레이드오프가 따른다. 얕은 레이어는 미세한 픽셀 디테일을 더 잘 보존하는 경향이 있는 반면, 깊은 레이어는 더 나은 생성 지표를 산출하는 경향이 있다. 따라서 고정된 휴리스틱 레이어 융합은 서로 다른 정보에서 이점을 얻는 두 단계를 결합하게 된다. 우리는 휴리스틱 특징 선택을 인코더 레이어의 무작위 부분집합에 대한 학습으로 대체하는 FuseReg를 소개한다. 기본 메커니즘을 이론적으로 분석하면, 부분집합 샘플링은 레이어 간 불일치에 대한 민감도에 명시적으로 페널티를 부과한다. ImageNet-256과 DINOv3-L을 사용한 실험에서 단일 FuseReg 디코더가 재학습 없이 전체, 희소, 단일 레이어 융합으로부터 재구성을 수행하며 고정 융합에 특화된 디코더보다 높은 PSNR을 달성한다. 이러한 유연성은 생성에도 이점을 준다. RAEv2 DiT-XL 생성기를 변경하지 않고 디코더만 교체하는 것만으로 비조건 gFID가 27% 감소한다. 동일한 정규화 원리는 확산 학습으로 확장되며, 두 단계를 공동으로 정규화하면 DiT-Base에서 비조건 gFID가 29% 감소한다. 이 결과는 레이어 융합에 대한 강건성을 위해 다운스트림 모델을 학습시키면 사전 학습된 인코더를 수정하지 않고도 재구성-생성 간극이 좁아진다는 것을 보여준다.

One-sentence Summary

Researchers at USC PSI Lab and collaborators propose FuseReg, which regularizes representation autoencoders by training on random subsets of encoder layers to penalize cross-layer disagreement, enabling a single decoder to reconstruct from full, sparse, and single-layer fusions without retraining while improving PSNR and reducing unguided gFID by up to 29%.

Key Contributions

  • FuseReg is a layer-fusion regularizer that trains representation autoencoder decoders and generators on normalized fusions of randomly sampled encoder layers, replacing fixed heuristic layer selection.
  • A theoretical analysis shows that randomized subset sampling preserves the full-layer mean while making cross-layer disagreement an explicit regularization penalty and establishes a second-order separation from deterministic global fusion methods.
  • On ImageNet-256 with DINOv3-L, a single FuseReg decoder reconstructs from full, sparse, and single-layer fusions without retraining and achieves higher PSNR than decoders specialized to fixed fusions; decoder replacement alone reduces unguided gFID from 3.01 to 2.21 at k=23, while joint regularization reduces DiT-Base gFID from 13.96 to 9.93.

Introduction

The authors work with representation autoencoders (RAEs), where a frozen visual encoder defines the latent space of a diffusion model but its hierarchical features must be collapsed into a single latent through layer fusion. This interface matters because the decoder reconstructs pixels from generated latents while the generator models the latent distribution, and prior fixed fusion choices such as RAEv2 create a reconstruction-generation gap: reconstruction favors shallow pixel-aligned layers, whereas diffusion favors deeper semantic layers. For example, in the DINOv3-L setting, expanding the fused subset from k=7 to k=23 improves reconstruction PSNR from 22.58 to 27.04 dB but worsens unguided gFID from 1.65 to 3.01. The authors introduce FuseReg, a layer-fusion regularization approach that trains the decoder and generator on randomly sampled, normalized subsets of encoder layers. This preserves the full-layer representation in expectation while reducing reliance on any single layer composition, yielding a single decoder that supports full, sparse, and single-layer fusions without retraining, and improving generation quality without architectural changes or additional computational cost.

Method

The authors address the limitations of fixed layer fusion in Representation Autoencoders by introducing FuseReg, a method that leverages randomized layer fusion as a regularization technique. In traditional setups, a fixed fusion rule or a learned global gate exposes downstream models to only a single layer composition during training. However, learned gates often fail to utilize deep semantic features effectively, instead collapsing to rely almost exclusively on shallow, pixel-aligned layers.

As shown in the figure below:

To overcome this dependency on fixed shortcuts, the authors replace deterministic fusion weights with a mean-preserving distribution over layer subsets. Given an image and a frozen encoder, the layer-normalized tokens from KKK chosen layers are mapped to a single latent representation. While a standard normalized fusion uses fixed weights aaa such that za=∑k=1Kakhkz_a = \sum_{k=1}^K a_k h_kza​=∑k=1K​ak​hk​ with 1⊤a=1\mathbf{1}^\top a = 11⊤a=1, FuseReg samples a separate layer-dropout mask for each training example. For a drop rate p∈[0,1)p \in [0, 1)p∈[0,1), the method draws an independent and identically distributed Bernoulli mask mmm and conditions it on being nonzero. The resulting fused latent is computed as:

zm=∑kmkhk∑kmkz_m = \frac{\sum_k m_k h_k}{\sum_k m_k}zm​=∑k​mk​∑k​mk​hk​​

This normalization is critical because it ensures that the expected value of the sampled latent equals the full-layer mean. Consequently, the variation introduced by the sampling strictly targets directions where the encoder layers disagree without shifting the average representation.

The framework applies this randomized fusion to both the pixel decoder and the diffusion transformer, but employs separate drop rates for each stage since they solve fundamentally different prediction problems. For the decoder, subset fusions are used to reconstruct pixels. The decoder is trained to map the sampled latent zmz_mzm​ back to the image using a combination of pixel, perceptual, and adversarial objectives. This forces the decoder to reconstruct images from multiple layer compositions, reducing its reliance on shallow-layer shortcuts.

For the diffusion transformer, the generator receives noisy subset fusions but is trained to predict the full-layer aggregate target. Using a flow-matching interpolant built from the subset aggregate, the model regresses the full-layer target with a time-weighted prediction loss. Setting the drop rate to zero recovers the standard full-fusion objective, while any positive rate trains the generator to map multiple subset fusions to the same full-layer target.

Theoretical analysis confirms that this normalized subset sampling preserves the all-layer representation on average while adding variance precisely along the components where layers disagree. Furthermore, the second moment of these random fusion weights spans the entire layer-contrast subspace. Because deterministic input-independent fusion rules possess a rank-one second moment, no fixed global fusion can match both the mean and the variance properties of the randomized approach, making FuseReg a uniquely effective regularizer for bridging the reconstruction and generation gap.

Experiment

The evaluation uses a frozen DINOv3-L encoder and a ViT decoder trained on ImageNet-256 with matched DiT-Base and DiT-XL budgets, and it isolates decoder, generator, and joint effects by testing one decoder across different layer fusions, swapping decoders while fixing the generator and latents, and jointly regularizing both stages. The experiments show that a randomized-fusion decoder reconstructs robustly across full, subset, and single-layer fusions, whereas fixed-fusion decoders specialize and degrade on shifted fusions; improving decoder robustness also improves generation with the generator fixed, especially for shifted fusions. Joint regularization yields complementary gains on DiT-Base but more nuanced, metric-dependent behavior on DiT-XL, motivating separate selection of decoder and generator regularization rates depending on scale, evaluation metric, and guidance.

The experiment compares reconstruction quality across full, subset, and single-layer fusions. Fixed-fusion RAEv2 decoders perform well only on the fusion they were trained on and degrade sharply when transferred to other fusions. A single FuseReg decoder, trained across nontrivial fusions, retains consistently strong PSNR, SSIM, and rFID across all evaluated fusion types. Fixed-fusion RAEv2 decoders specialize heavily to their training fusion, with large drops in PSNR and rFID on off-training fusions. The FuseReg decoder matches or exceeds the deterministic decoders across all tested fusions, keeping rFID below 0.6 and SSIM above 0.67 in every case.

In this unguided ImageNet-256 Inception Score sweep, decoder regularization has a non-monotonic effect: small decoder rates improve over the fixed-fusion baseline, but larger decoder rates reduce scores. Generator regularization generally lowers Inception Score, so the strongest results come from no or little generator regularization paired with a modest decoder rate. The best Inception Score appears at zero generator rate with a small decoder rate, improving substantially over the reproduced fixed-fusion baseline. For each generator rate, scores tend to peak at decoder rates of 0.05 or 0.1 and then decline as decoder regularization increases. High generator regularization combined with high decoder regularization produces the lowest scores in the sweep.

The first experiment evaluates reconstruction quality across full, subset, and single-layer fusions, showing that fixed-fusion RAEv2 decoders overfit to their training fusion and degrade sharply when transferred, while a single FuseReg decoder trained across nontrivial fusions maintains consistently strong PSNR, SSIM, and rFID. The second experiment sweeps decoder and generator regularization on unguided ImageNet-256 using Inception Score, finding that mild decoder regularization improves over the fixed-fusion baseline but larger amounts hurt, and generator regularization generally reduces scores. The best setup uses no or little generator regularization with a modest decoder rate, whereas high regularization on both sides yields the lowest scores.


AI로 AI 구축

아이디어에서 출시까지 — 무료 AI 코코딩, 즉시 사용 가능한 환경, 최적의 GPU 가격으로 AI 개발을 가속화하세요.

AI 협업 코딩
바로 사용 가능한 GPU
최적의 가격

HyperAI Newsletters

최신 정보 구독하기
한국 시간 매주 월요일 오전 9시 에 이번 주의 최신 업데이트를 메일로 발송합니다
이메일 서비스 제공: MailChimp