Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

S. Karthik Mukkavilli

dblp:241/5086 · also Surya Karthik Mukkavilli · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0003-4967-2644ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
HoGA: Higher-Order Graph Attention via Diversity-Aware k-Hop Sampling · WSDM 2026
Machine learning › Graph learning › graph neural network
message passing
1.012026
HoGA: Higher-Order Graph Attention via Diversity-Aware k-Hop Sampling · WSDM 2026
Data mining › structured data mining
graph mining
0.312026
HoGA: Higher-Order Graph Attention via Diversity-Aware k-Hop Sampling · WSDM 2026
Data mining › structured data mining › graph mining › graph learning
node classification
0.312026
HoGA: Higher-Order Graph Attention via Diversity-Aware k-Hop Sampling · WSDM 2026

Methods — techniques the papers use, named apart from their topics

subgraph sampling · 2.0k-hop sampling · 2.0attention mechanism · 2.0
YearPublicationVenuePosition
2026 HoGA: Higher-Order Graph Attention via Diversity-Aware k-Hop Sampling
abstract
Graphs model latent variable relationships in many real-world systems, and Message Passing Neural Networks (MPNNs) are widely used to learn such structures for downstream tasks. While edge-based MPNNs effectively capture local interactions, their expressive power is theoretically bounded, limiting the discovery of higher-order relationships. We introduce the Higher-Order Graph Attention (HoGA) module, which constructs a k-order attention matrix by sampling subgraphs to maximize diversity among feature vectors. Unlike existing higher-order attention methods that greedily resample similar k-order relationships, HoGA targets diverse modalities in higher-order topology, reducing redundancy and expanding the range of captured substructures. Applied to two single-hop attention models, HoGA achieves at least a 5% accuracy gain on all benchmark node classification datasets and outperforms recent baselines on six of eight datasets. Code is available at https://github.com/TB862/Higher_Order.
Thomas Bailie, Yun Sing Koh, S. Karthik Mukkavilli
WSDM3
2023 TensorBank: Tensor Lakehouse for Foundation Model Training
abstract
Storing and streaming high dimensional data for foundation model training became a critical requirement with the rise of foundation models beyond natural language. In this paper we introduce TensorBank – a petabyte scale tensor lakehouse capable of streaming tensors from Cloud Object Store (COS) to GPU memory at wire speed based on complex relational queries. We use Hierarchical Statistical Indices (HSI) for query acceleration. Our architecture allows to directly address tensors on block level using HTTP range reads. Once in GPU memory, data can be transformed using PyTorch transforms. We provide a generic PyTorch dataset type with a corresponding dataset factory translating relational queries and requested transformations as an instance. By making use of the HSI, irrelevant blocks can be skipped without reading them as those indices contain statistics on their content at different hierarchical resolution levels. This is an opinionated architecture powered by open standards and making heavy use of open-source technology. Although, hardened for production use using geospatial-temporal data, this architecture generalizes to other use cases like computer vision, computational neuroscience, biological sequence analysis and more.
Romeo Kienzler, Johannes Schmude, Naomi Simumba, Benedikt Blumenstiel, Marcus Freitag, Daiki Kimura, Zoltan Arnold Nagy, Michael Behrendt, Hendrik F. Hamann, S. Karthik Mukkavilli, Daniel Civitarese
IEEE Big Data10