Demo Data from EDBT 2026 / reviewers in the wild / expert
Alex Shonenkov
dblp:287/9081
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 67% Deep learning architectures and training · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
backpropagation |
0.7 | 1 | 2023 | Few-bit Backward: Quantized Gradients of Activation Functions for Memory Footprint Reduction · ICML 2023 |
Machine learning › Efficient and distributed learning › communication compression
gradient quantization |
0.7 | 1 | 2023 | Few-bit Backward: Quantized Gradients of Activation Functions for Memory Footprint Reduction · ICML 2023 |
Machine learning › Efficient and distributed learning
memory-efficient training |
0.7 | 1 | 2023 | Few-bit Backward: Quantized Gradients of Activation Functions for Memory Footprint Reduction · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
piecewise-constant approximation · 0.7dynamic programming · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Few-bit Backward: Quantized Gradients of Activation Functions for Memory Footprint ReductionabstractMemory 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 induce additional memory costs that, as we show, can be significantly reduced by quantization of the gradients. We propose a systematic approach to compute optimal quantization of the retained gradients of the pointwise nonlinear functions with only a few bits per each element. We show that such approximation can be achieved by computing an optimal piecewise-constant approximation of the derivative of the activation function, which can be done by dynamic programming. The drop-in replacements are implemented for all popular nonlinearities and can be used in any existing pipeline. We confirm the memory reduction and the same convergence on several open benchmarks. Georgii S. Novikov, Daniel Bershatsky, Julia Gusak, Alex Shonenkov, Denis Dimitrov, Ivan V. Oseledets |
ICML | 4 |