Genre
Revisiting Graph Contrastive Learning from the Perspective of Graph Spectrum
Graph Contrastive Learning (GCL), learning the node representations by augmenting graphs, has attracted considerable attentions.
OntheSimilaritybetweentheLaplace andNeuralTangentKernels
Finally, we provide experiments on real data comparing NTK and the Laplace kernel, along with a larger class ofฮณ-exponential kernels. We show that these perform almost identically.
Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
We consider nonconvex stochastic optimization problems in the asynchronous centralized distributed setup where the communication times from workers to a server can not be ignored, and the computation and communication times are potentially different for all workers.
