Aishwarya Reganti
Aishwarya Reganti has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Charles Dickens
Snorkel AI, Redwood City, CA, USA
2 shared publications - Danai Koutra
University of Michigan
2 shared publications - Edward W. Huang
Amazon, Palo Alto, CA, USA
2 shared publications - Jiong Zhu
University of Michigan, Ann Arbor, MI, USA
2 shared publications - Karthik Subbian
Amazon, Palo Alto, CA, USA
2 shared publications - Amitava Das
Wipro AI Lab
1 shared publication
Latest Publications
- Open Access
- 28 December 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (1) , 1-26
Simplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregation
Distributed graph neural network (GNN) training facilitates learning on massive graphs that surpass the storage and computational capabilities of a single machine. Traditional distributed frameworks strive for performance parity with centralized training by maximally recovering cross-instance node dependencies, relying either on inter-instance communication or periodic fallback to centralized training. However, these processes create overhead and constrain the scalability of the framework. In this work, we propose a streamlined framework for distributed GNN training that eliminates these costly operations, yielding improved scalability, convergence speed, and performance over state-of-the-art approaches. Our framework (1) comprises independent trainers that asynchronously learn local models from locally available parts of the training graph and (2) synchronizes these local models only through periodic (time-based) model aggregation. Contrary to prevailing belief, our theoretical analysis shows that it is not essential to maximize the recovery of cross-instance node dependencies to achieve performance parity with centralized training. Instead, our framework leverages randomized assignment of nodes or super-nodes (i.e., collections of original nodes) to partition the training graph in order to enhance data uniformity and minimize discrepancies in gradient and loss function across instances. Experiments on social and e-commerce networks with up to 1.3 billion edges show that our proposed framework achieves state-of-the-art performance and 2.31 \(\times\) speedup compared to the fastest baseline despite using less training data.- 28 December 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (1) , 1-26
Open AccessSimplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregation
Distributed graph neural network (GNN) training facilitates learning on massive graphs that surpass the storage and computational capabilities of a single machine. Traditional distributed frameworks strive for performance parity with centralized training by maximally recovering cross-instance node dependencies, relying either on inter-instance communication or periodic fallback to centralized training. However, these processes create overhead and constrain the scalability of the framework. In this work, we propose a streamlined framework for distributed GNN training that eliminates these costly operations, yielding improved scalability, convergence speed, and performance over state-of-the-art approaches. Our framework (1) comprises independent trainers that asynchronously learn local models from locally available parts of the training graph and (2) synchronizes these local models only through periodic (time-based) model aggregation. Contrary to prevailing belief, our theoretical analysis shows that it is not essential to maximize the recovery of cross-instance node dependencies to achieve performance parity with centralized training. Instead, our framework leverages randomized assignment of nodes or super-nodes (i.e., collections of original nodes) to partition the training graph in order to enhance data uniformity and minimize discrepancies in gradient and loss function across instances. Experiments on social and e-commerce networks with up to 1.3 billion edges show that our proposed framework achieves state-of-the-art performance and 2.31 \(\times\) speedup compared to the fastest baseline despite using less training data. - Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 1502-1510
Graph Coarsening via Convolution Matching for Scalable Graph Neural Network Training
Graph summarization as a preprocessing step is an effective and complementary technique for scalable graph neural network (GNN) training. In this work, we propose the Coarsening Via Convolution Matching (ConvMatch) algorithm and a highly scalable variant, A-ConvMatch, for creating summarized graphs that preserve the output of graph convolution. We evaluate ConvMatch on six real-world link prediction and node classification graph datasets, and show it is efficient and preserves prediction performance while significantly reducing the graph size. Notably, ConvMatch achieves up to 95% of the prediction performance of GNNs on node classification while trained on graphs summarized down to 1% the size of the original graph. Furthermore, on link prediction tasks, ConvMatch consistently outperforms all baselines, achieving up to a 2X improvement.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 1502-1510
Open AccessGraph Coarsening via Convolution Matching for Scalable Graph Neural Network Training
Graph summarization as a preprocessing step is an effective and complementary technique for scalable graph neural network (GNN) training. In this work, we propose the Coarsening Via Convolution Matching (ConvMatch) algorithm and a highly scalable variant, A-ConvMatch, for creating summarized graphs that preserve the output of graph convolution. We evaluate ConvMatch on six real-world link prediction and node classification graph datasets, and show it is efficient and preserves prediction performance while significantly reducing the graph size. Notably, ConvMatch achieves up to 95% of the prediction performance of GNNs on node classification while trained on graphs summarized down to 1% the size of the original graph. Furthermore, on link prediction tasks, ConvMatch consistently outperforms all baselines, achieving up to a 2X improvement.
- Open Access
- 25 February 2017
- Published by Association for Computing Machinery (ACM)
- p. 235-238
Socio-Ethnic Ingredients of Social Network Communities
In network science, a community is considered to be a group of nodes densely connected internally and sparsely connected externally. Detecting and analyzing communities from social networks has attracted immense attention over the last decade. However, the semantic interpretation of a community is hardly studied. In this paper, we attempt to understand { em whether individuals in a community possess similar personalities, values and ethical background}. To this end, we collect Twitter values corpus, extract the network communities and propose automatic models to determine personality, values, considered as ethnicity of individuals. Various experiments are performed to understand the characteristics or blend of characteristics of individuals within a community.
- 25 February 2017
- Published by Association for Computing Machinery (ACM)
- p. 235-238
Open AccessSocio-Ethnic Ingredients of Social Network Communities
In network science, a community is considered to be a group of nodes densely connected internally and sparsely connected externally. Detecting and analyzing communities from social networks has attracted immense attention over the last decade. However, the semantic interpretation of a community is hardly studied. In this paper, we attempt to understand { em whether individuals in a community possess similar personalities, values and ethical background}. To this end, we collect Twitter values corpus, extract the network communities and propose automatic models to determine personality, values, considered as ethnicity of individuals. Various experiments are performed to understand the characteristics or blend of characteristics of individuals within a community.