Compressing Vision Transformers in Geospatial Transfer Learning with Manifold-Constrained Optimization

Thomas Snyder, H. Lexie Yang, Stefan Schnake, Steffen Schotthöfer
1/12/2026
cs.CVcs.AI

No confident code implementation found for this paper.

Abstract

Deploying geospatial foundation models on resource-constrained edge devices demands compact architectures that maintain high downstream performance. However, their large parameter counts and the accuracy loss often induced by compression limit practical adoption. In this work, we leverage manifold-constrained optimization framework DLRT to compress large vision transformer-based geospatial foundation models during transfer learning. By enforcing structured low-dimensional parameterizations aligned with downstream objectives, this approach achieves strong compression while preserving task-specific accuracy. We show that the method outperforms of-the-shelf low-rank methods as LoRA. Experiments on diverse geospatial benchmarks confirm substantial parameter reduction with minimal accuracy loss, enabling high-performing, on-device geospatial models.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{snyder2026compressing,
  title  = {Compressing Vision Transformers in Geospatial Transfer Learning with Manifold-Constrained Optimization},
  author = {Thomas Snyder and H. Lexie Yang and Stefan Schnake and Steffen Schotthöfer},
  year   = {2026},
  eprint = {2601.08882},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.08882v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.08882.svg)](https://codeofpaper.com/paper/2601.08882)

Discussion