CVLGMay 22, 2023

Getting ViT in Shape: Scaling Laws for Compute-Optimal Model Design

arXiv:2305.13035v5111 citations
Originality Highly original
AI Analysis

This addresses the inefficiency of blindly scaling up vision models for researchers and practitioners, offering a more informed approach to model design.

The paper tackled the problem of designing compute-optimal model shapes, such as width and depth, for vision transformers, resulting in SoViT, which achieves competitive performance with models over twice its size, e.g., 90.3% fine-tuning accuracy on ILSRCV2012, while reducing inference cost by more than half.

Scaling laws have been recently employed to derive compute-optimal model size (number of parameters) for a given compute duration. We advance and refine such methods to infer compute-optimal model shapes, such as width and depth, and successfully implement this in vision transformers. Our shape-optimized vision transformer, SoViT, achieves results competitive with models that exceed twice its size, despite being pre-trained with an equivalent amount of compute. For example, SoViT-400m/14 achieves 90.3% fine-tuning accuracy on ILSRCV2012, surpassing the much larger ViT-g/14 and approaching ViT-G/14 under identical settings, with also less than half the inference cost. We conduct a thorough evaluation across multiple tasks, such as image classification, captioning, VQA and zero-shot transfer, demonstrating the effectiveness of our model across a broad range of domains and identifying limitations. Overall, our findings challenge the prevailing approach of blindly scaling up vision models and pave a path for a more informed scaling.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes