Masked Autoencoders Are Scalable Vision Learners

Kaiming He, Xinlei Chen, Saining Xie, Yanghao Li, Piotr Dollár, Ross Girshick

2021 · CVPR

Masked Autoencoders Are Scalable Vision Learners

Problem

Framing

Vision self-supervision had not matched supervised ViT pre-training at scale, and masked prediction looked too easy on redundant images. MAE closes this gap with heavy patch masking and an asymmetric encoder-decoder that reconstructs pixels from only visible patches. On ImageNet-1K, ViT-H reaches 87.8% top-1.

Currently Used Methods

Foundational

Proposed Method

Architecture

MAE splits an image into patches, masks about 75%, and feeds only visible patches to the ViT encoder. Mask tokens are inserted only after the encoder, then a small decoder reconstructs all patches; the decoder is discarded for downstream use. The default decoder has depth 8 and width 512.

Architecture diagram: visible patches enter the encoder, mask tokens are added only before a lightweight decoder that reconstructs the full image.

Loss / Objective

The training target is pixel reconstruction on masked patches only.

L(x,x^)=1MiMx^ixi22\mathcal{L}(\mathbf{x}, \hat{\mathbf{x}}) = \frac{1}{|\mathcal{M}|} \sum_{i \in \mathcal{M}} \| \hat{\mathbf{x}}_i - \mathbf{x}_i \|_2^2

Algorithm

Pre-training samples a random mask set, encodes visible patches, decodes the full sequence, and optimizes masked-patch MSE.

x^=Dϕ(Eθ(xV),mM),minθ,ϕ  1MiMx^ixi22\hat{\mathbf{x}} = D_{\phi}\big(E_{\theta}(\mathbf{x}_{\mathcal{V}}), \mathbf{m}_{\mathcal{M}}\big), \qquad \min_{\theta,\phi} \; \frac{1}{|\mathcal{M}|} \sum_{i \in \mathcal{M}} \| \hat{\mathbf{x}}_i - \mathbf{x}_i \|_2^2

Training Procedure

Evaluation

Datasets

Metrics

Headline results

Results plot: ImageNet validation accuracy versus masking ratio, showing a sweet spot around 75% for fine-tuning and linear probing.

Ablations

Method Strengths and Weaknesses

Strengths

Weaknesses

Suggestions from the authors

Links

Prior Papers

Further Papers