mlsanityData to 14 Oct 2026

NysAct: A Scalable Preconditioned Gradient Descent using Nystrom Approximation

arXiv 2506.08360 ↗First posted 10 Jun 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Adaptive gradient methods are computationally efficient and converge quickly, but they often suffer from poor generalization. In contrast, second-order methods enhance convergence and generalization but typically incur high computational and memory costs. In this work, we introduce NysAct, a scalable first-order gradient preconditioning method that strikes a balance between state-of-the-art first-order and second-order optimization methods. NysAct leverages an eigenvalue-shifted Nystrom method to approximate the activation covariance matrix, which is used as a preconditioning matrix, significantly reducing time and memory complexities with minimal impact on test accuracy. Our experiments show that NysAct not only achieves improved test accuracy compared to both first-order and second-order methods but also demands considerably less computational resources than existing second-order methods. Code is available at https://github.com/hseung88/nysact.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 42 references that are in the map. First posted on arXiv 10 Jun 2025.

Builds on

27 of 42 references.

References · 27

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2016Densely Connected Convolutional Networkscited by 6,720
  5. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  6. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  7. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  8. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  9. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
  10. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
  11. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
  12. 2017Random Erasing Data Augmentationcited by 1,239
15 more
  1. 2016Deep Networks with Stochastic Depthcited by 979
  2. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  3. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  4. 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 279
  5. 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 265
  6. 2021TrivialAugment: Tuning-free Yet State-of-the-Art Data Augmentationcited by 227
  7. 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 202
  8. 2020Practical Quasi-Newton Methods for Training Deep Neural Networkscited by 68
  9. 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
  10. 2019Augment your batch: better training with larger batchescited by 37
  11. 2022Gradient Descent on Neurons and its Link to Approximate Second-Order Optimizationcited by 30
  12. 2017Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Datacited by 23
  13. 2021Better SGD using Second-order Momentumcited by 15
  14. 2022SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimatescited by 8
  15. 2021Sublinear Time Approximation of Text Similarity Matricescited by 3

Built on by

Not cited yet.