Demo Data from EDBT 2026 / reviewers in the wild / expert
Karish Grover
dblp:302/4912
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 4 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
3 papers |
Graph learning · 66% Information extraction and text analysis · 15% Representation and self-supervised learning · 12% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph anomaly detection |
0.9 | 1 | 2025 | CurvGAD: Leveraging Curvature for Enhanced Graph Anomaly Detection · ICML 2025 |
Machine learning › Graph learning
graph autoencoder |
0.9 | 1 | 2025 | CurvGAD: Leveraging Curvature for Enhanced Graph Anomaly Detection · ICML 2025 |
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Spectro-Riemannian Graph Neural Networks · ICLR 2025 |
Machine learning › Graph learning
graph representation learning |
0.9 | 1 | 2025 | Spectro-Riemannian Graph Neural Networks · ICLR 2025 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › geometric representation learning
riemannian manifold representation |
0.9 | 1 | 2025 | Spectro-Riemannian Graph Neural Networks · ICLR 2025 |
Machine learning › Graph learning › graph neural network
spectral graph neural network |
0.9 | 1 | 2025 | Spectro-Riemannian Graph Neural Networks · ICLR 2025 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
abstract meaning representation |
0.6 | 1 | 2022 | Public Wisdom Matters! Discourse-Aware Hyperbolic Fourier Co-Attention for Social Text Classification · NeurIPS 2022 |
Natural language and speech › Information extraction and text analysis
discourse analysis |
0.6 | 1 | 2022 | Public Wisdom Matters! Discourse-Aware Hyperbolic Fourier Co-Attention for Social Text Classification · NeurIPS 2022 |
Machine learning › Graph learning › graph representation learning
hyperbolic graph representation learning |
0.6 | 1 | 2022 | Public Wisdom Matters! Discourse-Aware Hyperbolic Fourier Co-Attention for Social Text Classification · NeurIPS 2022 |
Natural language and speech › Information extraction and text analysis › text classification
social media text classification |
0.6 | 1 | 2022 | Public Wisdom Matters! Discourse-Aware Hyperbolic Fourier Co-Attention for Social Text Classification · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
spectral filtering · 0.9riemannian encoder · 0.9ollivier-ricci flow · 0.9ollivier-ricci curvature · 0.9mixed-curvature manifold · 0.9hyperbolic graph representation learning · 0.6fourier co-attention · 0.6abstract meaning representation · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Spectro-Riemannian Graph Neural NetworksabstractCan integrating spectral and curvature signals unlock new potential in graph representation learning? Non-Euclidean geometries, particularly Riemannian manifolds such as hyperbolic (negative curvature) and spherical (positive curvature), offer powerful inductive biases for embedding complex graph structures like scale-free, hierarchical, and cyclic patterns. Meanwhile, spectral filtering excels at processing signal variations across graphs, making it effective in homophilic and heterophilic settings. Leveraging both can significantly enhance the learned representations. To this end, we propose Spectro-Riemannian Graph Neural Networks (CUSP) - the first graph representation learning paradigm that unifies both CUrvature (geometric) and SPectral insights. CUSP is a mixed-curvature spectral GNN that learns spectral filters to optimize node embeddings in products of constant curvature manifolds (hyperbolic, spherical, and Euclidean). Specifically, CUSP introduces three novel components: (a) Cusp Laplacian, an extension of the traditional graph Laplacian based on Ollivier-Ricci curvature, designed to capture the curvature signals better; (b) Cusp Filtering, which employs multiple Riemannian graph filters to obtain cues from various bands in the eigenspectrum; and (c) Cusp Pooling, a hierarchical attention mechanism combined with a curvature-based positional encoding to assess the relative importance of differently curved substructures in our graph. Empirical evaluation across eight homophilic and heterophilic datasets demonstrates the superiority of CUSP in node classification and link prediction tasks, with a gain of up to 5.3\% over state-of-the-art models. Karish Grover, Xiang Song 0003, Qi Zhu 0008, Vassilis N. Ioannidis, Christos Faloutsos |
ICLR | 1 |
| 2025 | CurvGAD: Leveraging Curvature for Enhanced Graph Anomaly DetectionabstractDoes the intrinsic curvature of complex networks hold the key to unveiling graph anomalies that conventional approaches overlook? Reconstruction-based graph anomaly detection (GAD) methods overlook such geometric outliers, focusing only on structural and attribute-level anomalies. To this end, we propose CurvGAD - a mixed-curvature graph autoencoder that introduces the notion of curvature-based geometric anomalies. CurvGAD introduces two parallel pipelines for enhanced anomaly interpretability: (1) Curvature-equivariant geometry reconstruction, which focuses exclusively on reconstructing the edge curvatures using a mixed-curvature, Riemannian encoder and Gaussian kernel-based decoder; and (2) Curvature-invariant structure and attribute reconstruction, which decouples structural and attribute anomalies from geometric irregularities by regularizing graph curvature under discrete Ollivier-Ricci flow, thereby isolating the non-geometric anomalies. By leveraging curvature, CurvGAD refines the existing anomaly classifications and identifies new curvature-driven anomalies. Extensive experimentation over 10 real-world datasets (both homophilic and heterophilic) demonstrates an improvement of up to 6.5% over state-of-the-art GAD methods. The code is available at: https://github.com/karish-grover/curvgad. Karish Grover, Geoffrey J. Gordon, Christos Faloutsos |
ICML | 1 |
| 2022 | Multi-Relational Graph Transformer for Automatic Short Answer GradingabstractRajat Agarwal, Varun Khurana, Karish Grover, Mukesh Mohania, Vikram Goyal. Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2022. Rajat Agarwal, Varun Khurana, Karish Grover, Mukesh K. Mohania, Vikram Goyal |
NAACL-HLT | 3 |
| 2022 | Public Wisdom Matters! Discourse-Aware Hyperbolic Fourier Co-Attention for Social Text ClassificationabstractSocial media has become the fulcrum of all forms of communication. Classifying social texts such as fake news, rumour, sarcasm, etc. has gained significant attention. The surface-level signals expressed by a social-text itself may not be adequate for such tasks; therefore, recent methods attempted to incorporate other intrinsic signals such as user behavior and the underlying graph structure. Oftentimes, the public wisdom expressed through the comments/replies to a social-text acts as a surrogate of crowd-sourced view and may provide us with complementary signals. State-of-the-art methods on social-text classification tend to ignore such a rich hierarchical signal. Here, we propose Hyphen, a discourse-aware hyperbolic spectral co-attention network. Hyphen is a fusion of hyperbolic graph representation learning with a novel Fourier co-attention mechanism in an attempt to generalise the social-text classification tasks by incorporating public discourse. We parse public discourse as an Abstract Meaning Representation (AMR) graph and use the powerful hyperbolic geometric representation to model graphs with hierarchical structure. Finally, we equip it with a novel Fourier co-attention mechanism to capture the correlation between the source post and public discourse. Extensive experiments on four different social-text classification tasks, namely detecting fake news, hate speech, rumour, and sarcasm, show that Hyphen generalises well, and achieves state-of-the-art results on ten benchmark datasets. We also employ a sentence-level fact-checked and annotated dataset to evaluate how Hyphen is capable of producing explanations as analogous evidence to the final prediction. Karish Grover, S. M. Phaneendra Angara, Md. Shad Akhtar, Tanmoy Chakraborty 0002 |
NeurIPS | 1 |