Skip to content

Author

Alex Pothen

We have 5 of 7 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Aug 2026

MolSelector: A Machine Learning Framework for Interpretable Subset Selection from Molecular Science Data Sets.

We describe MolSelector, a machine learning framework for selecting representative subsets of molecular science data sets for efficient and accurate neural network training. As part of MolSelector, we introduce the interpretable Atypicality Score algorithm, which identifies molecules that are typical versus atypical of...

Caitlin Whitter, Aurora E. Clark, Alex Pothen et al. · 0 citations
#machine learning Preprint Oct 2026

EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks

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 across epochs can require repeated sampling or recomputation. We introduce EDiS (Edge-Disjoint Subgraph sparsification framework), which se...

S. Navuluru, Siddhartha Shankar Das, Franck Dernoncourt et al. · 0 citations
#machine learning Preprint Sep 2026

Scaffold: Support Graph Theory Based Sparsification for Graph Neural Networks

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 a natural way to reduce these costs, but removing edges indiscriminately can distort important communication structure and degrade predictiv...

Siddhartha Shankar Das, S. Navuluru, S. M. Ferdous et al. · 0 citations
Book Open access Aug 2026

SGS-GNN: A Supervised Graph Sparsifier for Graph Neural Networks

SGS-GNN improves F1-scores by 4% relative to full training and up to 30% on heterophilic graphs and outperforms state-of-the-art methods by 4–7% at similar sparsity levels while reducing peak memory usage by up to 3.9×.

Siddhartha Shankar Das, Naheed Anjum Arafat, Muftiqur Rahman et al. · 1 citation
Book Open access Aug 2026

SGS-GNN: A Supervised Graph Sparsifier for Graph Neural Networks

SGS-GNN improves F1-scores by 4% relative to full training and up to 30% on heterophilic graphs and outperforms state-of-the-art methods by 4–7% at similar sparsity levels while reducing peak memory usage by up to 3.9×.

Siddhartha Shankar Das, Naheed Anjum Arafat, Muftiqur Rahman et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.