Self-supervised hypergraph representation learning can produce informative node embeddings, but existing methods often require deep encoders trained for hundreds of epochs, making embedding generation costly even for hypergraphs with a few thousand nodes. This limits applications requiring embeddings for many or evolvi...
P. Megha, Harshit Kumar, Srajan Agarwal et al.· 0 citations
An affinity-guided rewiring method that estimates the graph and the node representation together and alternates, in the spirit of expectation maximisation, between training a lightweight graph neural network on the current graph and re-weighting candidate edges under a modularity objective with a pseudo-label homophily...
Harshit Kumar, Sujan Chakraborty, Priyanka Saha et al.· 0 citations
This work proposes Supervised Spike Agreement-Dependent Plasticity (Supervised SADP), a gradient-free supervised Hebbian learning algorithm in which class information is embedded directly into the Hebbian plasticity computation rather than introduced through reward modulation.
S. GouriLakshmi, A. Chandrasekharan, Harshit Kumar et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.