Code for running the random, herding, k-center baselines
GooLiang opened this issue · 4 comments
GooLiang commented
Hi! thanks for your awesome work.
I am trying to reproduce the results of random, herding, k-center baseline results in the paper.
As mentioned in the paper, using the implementation provided by "DATASET CONDENSATION WITH GRADIENT MATCHING" for Herding, K-Center, and DC.
However, "DATASET CONDENSATION WITH GRADIENT MATCHING"'s code also does not provide source code implementation.
Could you share the source code used to run the random, herding, k-center algorithm?
ChandlerBang commented
GooLiang commented
Appreciate for your help!
GooLiang commented
Hello author, can you provide the source code of DC-Graph?
ChandlerBang commented
You can make simple adjustment on GCond to get DC-Graph:
- replace the adjacency matrix
A
of the original with a zero matrix (which removes all the existing edges). - fix the condensed adjacency matrix
A'
to an identity matrix.