Papers › DataDAM: Efficient Dataset Distillation with Attention Matching
DataDAM: Efficient Dataset Distillation with Attention Matching
Ahmad Sajedi, Samir Khaki, Ehsan Amjadian, Lucy Z. Liu, Yuri A. Lawryshyn, Konstantinos N. Plataniotis
Researchers have long tried to minimize training costs in deep learning while maintaining strong generalization across diverse datasets. Emerging research on dataset distillation aims to reduce training costs by creating a small synthetic set that contains the information of a larger real dataset and ultimately achieves test accuracy equivalent to a model trained on the whole dataset. Unfortunately, the synthetic data generated by previous methods are not guaranteed to distribute and discriminate as well as the original training data, and they incur significant computational costs. Despite promising results, there still exists a significant performance gap between models trained on condensed synthetic sets and those trained on the whole dataset. In this paper, we address these challenges using efficient Dataset Distillation with Attention Matching (DataDAM), achieving state-of-the-art performance while reducing training costs. Specifically, we learn synthetic images by matching the spatial attention maps of real and synthetic data generated by different layers within a family of randomly initialized neural networks. Our method outperforms the prior methods on several datasets, including CIFAR10/100, TinyImageNet, ImageNet-1K, and subsets of ImageNet-1K across most of the settings, and achieves improvements of up to 6.5% and 4.1% on CIFAR100 and ImageNet-1K, respectively. We also show that our high-quality distilled images have practical benefits for downstream applications, such as continual learning and neural architecture search.
In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.00093")
Code
Syntology Ran 35 of 43 code samples harvested from 1 repository linked to this paper; 8 have no recorded run. Of those that ran: 15 ran · our draft was wrong; 1 ran · fixture could not drive it; 19 ran with no contract checked.
By repository: official repository: 43 samples from 1 repository, 35 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
43 samples harvested; 35 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.
Licence: 43 of the 43 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from datadistillation/datadam. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
3a77313e815f4446 · report
e115409c4e00e969 · report
4e14cbaa48d8cc75 · report
0e55526126f5ac6a · report
881b5b714601c990 · report
cacbe6eda6096eec · report
450f5b303bbc3417 · report
8ac93772f8b62582 · report
2632cd271d2b1d41 · report
9b66b60a7704b891 · report
87825ad2fefad289 · report
7c9efcd20eaa83da · report
a356b663f3ac431b · report
2c1568b6ce72e1c9 · report
812296fd5aaf4e41 · report
7266bcefd6533fab · report
3c2e1728144bb05d · report
fd9a30700758c3bc · report
ab31aadcda7a9603 · report
d0f0d585cc626bd7 · report
9e7a6f74075e564f · report
d5630ef1d9988d5a · report
2c7c8872bf76354a · report
cd229917ccd77249 · report
19457c962ab49bdd · report
21792c325f5769e6 · report
e98b4502952690a9 · report
1cad5517390bb5b5 · report
b551aeb91085de7c · report
e2b5b619f5661137 · report
e7e9168fac4fe2a7 · report
ab6f69dd3438d7cf · report
94b4020af89df30d · report
c464d3d7b7e65175 · report
ce2cd9ed7e80e7e5 · report
351e66f1c6171f1f · report
59602e0b7b844b46 · report
d420983fabce48c3 · report
4116a89fdeeb7778 · report
4fa3d915bca9fa98 · report
736fa42944cf4c63 · report
a34fe411a5565754 · report
e11ae486efd933fd · report
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections