← Search

Julia Gusak

6 accepted papers

2025

HiRemate: Hierarchical Approach for Efficient Re-materialization of Neural Networks

ICML 2025poster

Training deep neural networks (DNNs) on memory-limited GPUs is challenging, as storing intermediate activations often exceeds available memory. Re-materialization, a technique that preserves exact computations, addresses this by selectively recomputing activations instead of storing them. However,…

Cited by 0SourcePDFScholar
2023

Few-bit Backward: Quantized Gradients of Activation Functions for Memory Footprint Reduction

ICML 2023poster

Memory footprint is one of the main limiting factors for large neural network training. In backpropagation, one needs to store the input to each operation in the computational graph. Every modern neural network model has quite a few pointwise nonlinearities in its architecture, and such operations i…

2023

Rockmate: an Efficient, Fast, Automatic and Generic Tool for Re-materialization in PyTorch

ICML 2023oral

We propose Rockmate to control the memory requirements when training PyTorch DNN models. Rockmate is an automatic tool that starts from the model code and generates an equivalent model, using a predefined amount of memory for activations, at the cost of a few re-computations. Rockmate automatically…

2022

Survey on Efficient Training of Large Neural Networks

IJCAI 2022poster

Modern Deep Neural Networks (DNNs) require significant memory to store weight, activations, and other intermediate tensors during training. Hence, many models don’t fit one GPU device or can be trained using only a small per-GPU batch size. This survey provides a systematic overview of the approache…

2020

Interpolation Technique to Speed Up Gradients Propagation in Neural ODEs

NeurIPS 2020poster

We propose a simple interpolation-based method for the efficient approximation of gradients in neural ODE models. We compare it with reverse dynamic method (known in literature as “adjoint method”) to train neural ODEs on classification, density estimation and inference approximation tasks. We als…

2020

Stable Low-rank Tensor Decomposition for Compression of Convolutional Neural Network

ECCV 2020poster

Most state-of-the-art deep neural networks are overparameterized and exhibit a high computational cost. A straightforward approach to this problem is to replace convolutional kernels with its low-rank tensor approximations, whereas the Canonical Polyadic tensor Decomposition is one of the most suite…

Cited by 194SourcePDFScholar