Kai Wang, Yanqing Liu, Yang You, Zheng Zhu, Wei Jiang, Jianyang Gu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Dataset distillation aims to synthesize small datasets with little information loss from original large-scale ones for reducing storage and training costs. Recent state-ofthe-art methods mainly constrain the sample synthesis process by matching synthetic images and the original ones regarding gradients, embedding distributions, or training trajectories. Although there are various matching objectives, currently the strategy for selecting original images is limited to naive random sampling. We argue that random sampling overlooks the evenness of the selected sample distribution, which may result in noisy or biased matching targets. Besides, the sample diversity is also not constrained by random sampling. These factors together lead to optimization instability in the distilling process and degrade the training efficiency. Accordingly, we propose a novel matching strategy named as Dataset distillation by REpresentAtive Matching (DREAM), where only representative original images are selected for matching. DREAM is able to be easily plugged into popular dataset distillation frameworks and reduce the distilling iterations by more than 8 times without performance drop. Given sufficient training time, DREAM further provides significant improvements and achieves state-of-the-art performances.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.14416")
get_code_for_paper("2302.14416")
have("2302.14416")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.14416.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.14416)
Connect an agent — have() is free.