MetaStore: Analyzing Deep Learning Meta-Data at Scale
Huayi Zhang, Binwei Yan, Lei Cao, Samuel Madden, Elke A. Rundensteiner
摘要
The process of training deep learning models produces a huge amount of meta-data, including but not limited to losses, hidden feature embeddings, and gradients. Model diagnosis tools have been developed to analyze losses and feature embeddings with the aim to improve the performance of these models. However, gradients, despite carrying rich information that is potentially relevant for model interpretation and data debugging, have yet to be fully explored due to their size and complexity. Each single gradient has a size as large as the number of parameters of the neural net - often measured in the tens of millions. This makes it extremely challenging to efficiently collect, store, and analyze large numbers of gradients in these models. In this work, we develop MetaStore to fill this gap. MetaStore leverages our observation that storing certain compact intermediate results produced in the back propagation process, namely, the prefix and suffix gradients, is sufficient for the exact restoration of the original gradient. These prefix and suffix gradients are much more compact than the original gradients, thus allowing us to address the gradient collection and storage challenges. Furthermore, MetaStore features a rich set of analytics operators that allow the users to analyze the gradients for data debugging or model interpretation. Rather than first having to restore the original gradients and then run analytics on top of this decompressed view, MetaStore directly executes these operators on the compact prefix and suffix structures, making gradient-based analytics efficient and scalable. Our experiments on popular deep learning models such as VGG, BERT, and ResNet and benchmark image and text datasets demonstrate that MetaStore outperforms strong baseline methods from 4 to 678x in storage costs and from 2 to 1000x in running time.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Analyzing and Optimizing Perturbation of DP-SGD GeometricallyJiawei Duan, Haibo Hu, Qingqing Ye, Xinyue SunICDE 2025 · 被引用 3 次
- CLID-MU: Cross-Layer Information Divergence Based Meta Update Strategy for Learning with Noisy LabelsRuofan Hu, Dongyu Zhang, Huayi Zhang, Elke A. RundensteinerKDD 2025
它引用的顶会 Paper16
- Deep Learning with Differential PrivacyMartín Abadi, Andy Chu, Ian J. Goodfellow, H. Brendan McMahan 等CCS 2016 · 被引用 7,620 次
- Estimating Training Data Influence by Tracing Gradient DescentGarima Pruthi, Frederick Liu, Satyen Kale, Mukund SundararajanNeurIPS 2020 · 被引用 784 次
- LESS: Selecting Influential Data for Targeted Instruction TuningMengzhou Xia, Sadhika Malladi, Suchin Gururangan, Sanjeev Arora 等ICML 2024 · 被引用 460 次
- Identifying Mislabeled Data using the Area Under the Margin RankingGeoff Pleiss, Tianyi Zhang, Ethan R. Elenberg, Kilian Q. WeinbergerNeurIPS 2020 · 被引用 398 次
- Data Valuation using Reinforcement LearningJinsung Yoon, Sercan Ömer Arik, Tomas PfisterICML 2020 · 被引用 236 次
相关 Paper
- Error Feedback Can Accurately Compress PreconditionersIonut-Vlad Modoranu, Aleksei Kalinov, Eldar Kurtic, Elias Frantar 等ICML 2024 · 被引用 6 次
- Indirect Stochastic Gradient Quantization and Its Application in Distributed Deep LearningAfshin Abdi, Faramarz FekriAAAI 2020 · 被引用 5 次
- EvoStore: Towards Scalable Storage of Evolving Learning ModelsRobert Underwood, Meghana Madhyastha, Randal C. Burns, Bogdan NicolaeHPDC 2024 · 被引用 3 次
- BackPACK: Packing more into BackpropFelix Dangel, Frederik Kunstner, Philipp HennigICLR 2020 · 被引用 114 次
- SwitchTop-k: Scaling Top-k Compression on Programmable SwitchesYijun Li, Jiawei Huang, Jingling Liu, Zhaoyi Li 等KDD 2025
