mlsanityData to 7 Oct 2026

TensorGRaD: Tensor Gradient Robust Decomposition for Memory-Efficient Neural Operator Training

arXiv 2501.02379 ↗First posted 4 Jan 2025cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Scientific problems require resolving multi-scale phenomena across different resolutions and learning solution operators in infinite-dimensional function spaces. Neural operators provide a powerful framework for this, using tensor-parameterized layers to capture complex, multi-dimensional relationships. However, scaling neural operators to high-resolution problems leads to significant computational demands, making the training of industrial-scale models prohibitive. In this work, we introduce TensorGRaD, a novel method that directly addresses the memory challenges associated with optimizing large tensor-structured weights. Our approach, based on a texitrobust tensor decomposition, factorizes gradients as the sum of a low-rank tensor and a sparse one to efficiently capture information within optimizer states, including outliers. Additionally, we provide a recipe for mixed precision training of TensorGRaD, achieving further memory savings without sacrificing accuracy. We showcase the effectiveness of TensorGRaD on Fourier Neural Operators, a class of models crucial for solving partial differential equations (PDE). We provide theoretical guarantees for TensorGRaD, demonstrating its fundamental advantage over matrix-based gradient compression methods. We empirically demonstrate large improvements across various PDE tasks, including the challenging turbulent Navier-Stokes case at a Reynolds number of 105. TensorGRaD reduces total memory usage by over 50% while maintaining and sometimes even improving accuracy.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 24 of its 32 references that are in the map. First posted on arXiv 4 Jan 2025.

Builds on

24 of 32 references.

References · 24

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  3. 2023Segment Anythingcited by 8,158
  4. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
  5. 2016Training Deep Nets with Sublinear Memory Costcited by 825
  6. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  7. 2021Neural Operator: Learning Maps Between Function Spacescited by 413
  8. 2023Geometry-Informed Neural Operator for Large-Scale 3D PDEscited by 293
  9. 2015Tensorizing Neural Networkscited by 246
  10. 2023Spherical Fourier Neural Operators: Learning Stable Dynamics on the Spherecited by 225
  11. 2023Neural Operators for Accelerating Scientific Simulations and Designcited by 218
  12. 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 199
12 more
  1. 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 161
  2. 2016TensorLy: Tensor Learning in Pythoncited by 104
  3. 2023Multi-Grid Tensorized Fourier Neural Operator for High-Resolution PDEscited by 66
  4. 2021Tensor Methods in Computer Vision and Deep Learningcited by 52
  5. 2024SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretrainingcited by 44
  6. 2022Incremental Spatial and Spectral Learning of Neural Operators for Solving Large-Scale PDEscited by 25
  7. 2024Rethinking Conventional Wisdom in Machine Learning: From Generalization to Scalingcited by 21
  8. 2024Grass: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradientscited by 17
  9. 2024LoQT: Low-Rank Adapters for Quantized Pretrainingcited by 12
  10. 2020Optimization Landscape of Tucker Decompositioncited by 10
  11. 2023Guaranteed Approximation Bounds for Mixed-Precision Neural Operatorscited by 9
  12. 2024Coarse Graining with Neural Operators for Simulating Chaotic Systemscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.