Demo Data from EDBT 2026 / reviewers in the wild / expert
Ajinkya Pankaj Deshpande
dblp:358/6430
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 · 87% Representation and self-supervised learning · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph representation learning
node representation learning |
0.7 | 1 | 2023 | FiGURe: Simple and Efficient Unsupervised Node Representations with Filter Augmentations · NeurIPS 2023 |
Machine learning › Graph learning › graph representation learning
unsupervised graph representation learning |
0.7 | 1 | 2023 | FiGURe: Simple and Efficient Unsupervised Node Representations with Filter Augmentations · NeurIPS 2023 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.2 | 1 | 2023 | FiGURe: Simple and Efficient Unsupervised Node Representations with Filter Augmentations · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
random fourier features · 0.7filter augmentation · 0.7contrastive learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | FiGURe: Simple and Efficient Unsupervised Node Representations with Filter AugmentationsabstractUnsupervised node representations learnt using contrastive learning-based methods have shown good performance on downstream tasks. However, these methods rely on augmentations that mimic low-pass filters, limiting their performance on tasks requiring different eigen-spectrum parts. This paper presents a simple filter-based augmentation method to capture different parts of the eigen-spectrum. We show significant improvements using these augmentations. Further, we show that sharing the same weights across these different filter augmentations is possible, reducing the computational load. In addition, previous works have shown that good performance on downstream tasks requires high dimensional representations. Working with high dimensions increases the computations, especially when multiple augmentations are involved. We mitigate this problem and recover good performance through lower dimensional embeddings using simple random Fourier feature projections. Our method, FiGURe, achieves an average gain of up to 4.4\%, compared to the state-of-the-art unsupervised models, across all datasets in consideration, both homophilic and heterophilic. Our code can be found at: https://github.com/Microsoft/figure. Chanakya Ajit Ekbote, Ajinkya Pankaj Deshpande, Arun Iyer, Sundararajan Sellamanickam, Ramakrishna Bairi |
NeurIPS | 2 |