@@ -51,7 +51,7 @@ CIFAR10, the clustering provided by D-Cliques, in combination with Clique
Averaging, provides faster convergence and lower variance than diverse
neighborhoods.
In practice, the difficulty of obtaining a random graph in which each node has a neighborhood with similar skew as D-Cliques, while not using more edges, actually makes the construction with a decentralized algorithm harder. Indeed, there are more constraints in selecting potential candidates for swapping.
In practice, the difficulty of obtaining a random graph in which each node has a neighborhood with similar skew as D-Cliques, while not using more edges, makes the construction with a decentralized algorithm harder. Indeed, there are more constraints in selecting potential candidates for swapping.