Demo Data from VLDB 2026 / reviewers in the wild / expert
Philip Zmushko
dblp:393/1266
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 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 · 50% Language models and text generation · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
large language model training |
0.9 | 1 | 2025 | FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Training · ICML 2025 |
Machine learning › Efficient and distributed learning
memory optimization |
0.9 | 1 | 2025 | FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Training · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
signSGD · 0.9low-rank adaptation · 0.9gradient splitting · 0.9adam · 0.9SGD · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable TrainingabstractWith the increase in the number of parameters in large language models, the training process increasingly demands larger volumes of GPU memory. A significant portion of this memory is typically consumed by the optimizer state. To overcome this challenge, recent approaches such as low-rank adaptation (LoRA), low-rank gradient projection (GaLore), and blockwise optimization (BAdam) have been proposed. However, in all these algorithms, the effective rank of the weight updates remains low-rank, which can lead to a substantial loss of information from the gradient. This loss can be critically important, especially during the pre-training stage. In this paper, we introduce FRUGAL (Full-Rank Updates with GrAdient spLitting), a new memory-efficient optimization framework. FRUGAL leverages gradient splitting to perform low-dimensional updates using advanced algorithms (such as Adam), while updates along the remaining directions are executed via state-free methods like SGD or signSGD. Our framework can be integrated with various low-rank update selection techniques, including GaLore and BAdam. We provide theoretical convergence guarantees for our framework when using SGDM for low-dimensional updates and SGD for state-free updates. Additionally, our method consistently outperforms concurrent approaches, achieving state-of-the-art results in pre-training and fine-tuning tasks while balancing memory efficiency and performance metrics. Philip Zmushko, Aleksandr Beznosikov, Martin Takác 0001, Samuel Horváth |
ICML | 1 |