Demo Data from EDBT 2026 / reviewers in the wild / expert
Peihong Liu
dblp:359/9508
· 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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
memory-efficient training |
0.7 | 1 | 2023 | Coop: Memory is not a Commodity · NeurIPS 2023 |
Machine learning › Efficient and distributed learning › memory-efficient training
re-materialization |
0.7 | 1 | 2023 | Coop: Memory is not a Commodity · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
recomputation · 0.7checkpointing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Coop: Memory is not a CommodityabstractTensor rematerialization allows the training of deep neural networks (DNNs) under limited memory budgets by checkpointing the models and recomputing the evicted tensors as needed. However, the existing tensor rematerialization techniques overlook the memory system in deep learning frameworks and implicitly assume that free memory blocks at different addresses are identical. Under this flawed assumption, discontiguous tensors are evicted, among which some are not used to allocate the new tensor. This leads to severe memory fragmentation and increases the cost of potential rematerializations.
To address this issue, we propose to evict tensors within a sliding window to ensure all evictions are contiguous and are immediately used. Furthermore, we proposed cheap tensor partitioning and recomputable in-place to further reduce the rematerialization cost by optimizing the tensor allocation.
We named our method Coop as it is a co-optimization of tensor allocation and tensor rematerialization. We evaluated Coop on eight representative DNNs. The experimental results demonstrate that Coop achieves up to $2\times$ memory saving and hugely reduces compute overhead, search latency, and memory fragmentation compared to the state-of-the-art baselines. Shihan Ma, Peihong Liu, Jinhui Yuan |
NeurIPS | 3 |