TrAct: Making First-layer Pre-Activations Trainable
Not on the map. Why?
Abstract (arXiv)
We consider the training of the first layer of vision models and notice the clear relationship between pixel values and gradient update magnitudes: the gradients arriving at the weights of a first layer are by definition directly proportional to (normalized) input pixel values. Thus, an image with low contrast has a smaller impact on learning than an image with higher contrast, and a very bright or very dark image has a stronger impact on the weights than an image with moderate brightness. In this work, we propose performing gradient descent on the embeddings produced by the first layer of the model. However, switching to discrete inputs with an embedding layer is not a reasonable option for vision models. Thus, we propose the conceptual procedure of (i) a gradient descent step on first layer activations to construct an activation proposal, and (ii) finding the optimal weights of the first layer, i.e., those weights which minimize the squared distance to the activation proposal. We provide a closed form solution of the procedure and adjust it for robust stochastic training while computing everything efficiently. Empirically, we find that TrAct (Training Activations) speeds up training by factors between 1.25x and 4x while requiring only a small computational overhead. We demonstrate the utility of TrAct with different optimizers for a range of different vision models including convolutional and transformer architectures.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 46 references that are in the map. First posted on arXiv 31 Oct 2024.
Builds on
33 of 46 references.
References · 33
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2016Layer Normalizationcited by 5,579
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
21 more
- 2017Squeeze-and-Excitation Networkscited by 4,763
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2016Wide Residual Networkscited by 3,057
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,540
- 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
- 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,509
- 2017ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devicescited by 1,194
- 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,132
- 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,097
- 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
- 2016Deep Networks with Stochastic Depthcited by 973
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2016Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networkscited by 541
- 2022DeiT III: Revenge of the ViTcited by 417
- 2019BackPACK: Packing more into backpropcited by 77
- 2021ViViT: Curvature access through the generalized Gauss-Newton's low-rank structurecited by 16
- 2020Whitening and second order optimization both make information in the dataset unusable during training, and can reduce or prevent generalizationcited by 14
- 2023Dual PatchNormcited by 9
- 2023ISAAC Newton: Input-based Approximate Curvature for Newton's Methodcited by 6
- 2024Newton Losses: Using Curvature Information for Learning with Differentiable Algorithmscited by 2
Built on by
Not cited yet.