Pith. sign in

REVIEW 1 cited by

Pre-training with Random Orthogonal Projection Image Modeling

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 2310.18737 v2 pith:4WUZOX3T submitted 2023-10-28 cs.CV cs.AIcs.LG

classification cs.CVcs.AIcs.LG
keywords randomimagemaskingprojectionmodelingorthogonalinformationmasked
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Masked Image Modeling (MIM) is a powerful self-supervised strategy for visual pre-training without the use of labels. MIM applies random crops to input images, processes them with an encoder, and then recovers the masked inputs with a decoder, which encourages the network to capture and learn structural information about objects and scenes. The intermediate feature representations obtained from MIM are suitable for fine-tuning on downstream tasks. In this paper, we propose an Image Modeling framework based on random orthogonal projection instead of binary masking as in MIM. Our proposed Random Orthogonal Projection Image Modeling (ROPIM) reduces spatially-wise token information under guaranteed bound on the noise variance and can be considered as masking entire spatial image area under locally varying masking degrees. Since ROPIM uses a random subspace for the projection that realizes the masking step, the readily available complement of the subspace can be used during unmasking to promote recovery of removed information. In this paper, we show that using random orthogonal projection leads to superior performance compared to crop-based masking. We demonstrate state-of-the-art results on several popular benchmarks.

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. Generalized Category Discovery via Token Manifold Capacity Learning

    cs.LG 2025-05 conditional novelty 4.0 of 10

    MTMC adds a nuclear-norm loss on class tokens to GCD objectives and reports small accuracy gains on several image benchmarks.

Pith tools