activity
20122026
most citedFeature Clustering for Accelerating Parallel Coordinate Descent

39 citations · 200 across the 57 of their papers we have counts for

collaborators
Showing cs.LGShow all

21 papers · 1 filter

cs.LG2026

EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks

Sai Karthik Navuluru, Siddhartha Shankar Das, Franck Dernoncourt +7

Sparse GNN training reduces computation, but deciding which edges to keep can be costly. Reusing one sparse graph is cheap, but locks training to a fixed topology, while varying it…

cs.LG2026

Scaffold: Support Graph Theory Based Sparsification for Graph Neural Networks

Siddhartha Shankar Das, Sai Karthik Navuluru, S M Ferdous +7

Graph neural networks (GNNs) rely on message passing over graph edges, making their computational and memory costs strongly dependent on graph density. Graph sparsification offers…

cs.LG2026

Unifying Graph Neural Networks Through a Common Layer Equation

Sai Karthik Navuluru, Siddhartha Shankar Das, Bo Ni +9

Graph neural networks are commonly described through family-specific equations whose notation obscures shared computations and structural differences. We introduce a common layer e…

cs.LG2025

Knowledge Homophily in Large Language Models

Utkarsh Sahu, Zhisheng Qi, Mahantesh Halappanavar +6

Large Language Models (LLMs) have been increasingly studied as neural knowledge bases for supporting knowledge-intensive applications such as question answering and fact checking.…

cs.LG2025★ 1 cited

Towards High Resolution Probabilistic Coastal Inundation Forecasting from Sparse Observations

Kazi Ashik Islam, Zakaria Mehrab, Mahantesh Halappanavar +5

Coastal flooding poses increasing threats to communities worldwide, necessitating accurate and hyper-local inundation forecasting for effective emergency response. However, real-wo…

cs.LG2025

SGS-GNN: A Supervised Graph Sparsification method for Graph Neural Networks

Siddhartha Shankar Das, Naheed Anjum Arafat, Muftiqur Rahman +3

We propose SGS-GNN, a novel supervised graph sparsifier that learns the sampling probability distribution of edges and samples sparse subgraphs of a user-specified size to reduce t…