Pushing the Limits of Gradient Descent for Efficient Learning on Large Images

Deepak Gupta, Gowreesh Mago, Arnav Chavan, Dilip Prasad, Rajat Mani Thomas

Abstract: Traditional deep learning models are trained and tested on relatively low-resolution images (< 300 px), and cannot be directly operated on large-scale images due to compute and memory constraints. We propose Patch Gradient Descent (PatchGD), an effective learning strategy that allows us to train the existing CNN and transformer architectures (hereby referred to as deep learning models) on large-scale images in an end-to-end manner. PatchGD is based on the hypothesis that instead of performing gradient-based updates on an entire image at once, it should be possible to achieve a good solution by performing model updates on only small parts of the image at a time, ensuring that the majority of it is covered over the course of iterations. PatchGD thus extensively enjoys better memory and compute efficiency when training models on large-scale images. PatchGD is thoroughly evaluated on PANDA, UltraMNIST, TCGA, and ImageNet datasets with ResNet50, MobileNetV2, ConvNeXtV2, and DeiT models under different memory constraints. Our evaluation clearly shows that PatchGD is much more stable and efficient than the standard gradient-descent method in handling large images, especially when the compute memory is limited. Code is available at https://github.com/nyunAI/PatchGD.

Submission Length: Regular submission (no more than 12 pages of main content)

Changes Since Last Submission:

Minor changes were made to the manuscript for the camera-ready version, including:
- Adjustments to spacing and overall formatting
- Minor grammatical corrections
- Addition of the code repository link

Code: https://github.com/nyunAI/PatchGD

Assigned Action Editor: ~Ozan_Sener1

Submission Number: 2142