VLDB 2026 Research / reviewers in the wild / expert
Akshay Sethi
dblp:192/2758
· DBLP profile ↗
8ranked-venue papers
5as first author
4since 2021 · last 2025
0000-0001-9284-8452ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 5 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | TAG2M- A Task-Agnostic Knowledge Distillation Framework for Distilling GNN to MLPabstractGraph Neural Networks (Gnns) have achieved remarkable success in various downstream tasks, such as node classification and link prediction. Yet, efficiently deploying Gnns remains a challenge due to their computational complexity. Graph knowledge distillation aims to address this by transferring task-specific structural knowledge from teacher Gnns to lightweight student Gnns or Multi-Layer Perceptrons (MLPs). Despite its promise, existing distillation approaches suffer from several limitations: (i) they require extensive task-specific supervision(ii) they must be retrained separately for each downstream task, and (iii) they often struggle in heterophilous settings. To overcome these challenges, we propose TAG2M, a Task-Agnostic Gnn-to-MLP distillation framework designed for efficient and accurate few-shot inference. TAG2M introduces several novel strategies, including a self-supervised contrastive loss that captures topological information solely from node attributes. Additionally, it leverages Lipschitz embeddings to encode positional information with provable distortion bounds, ensuring robust representation learning. To further enhance adaptability for few-shot inference, TAG2M incorporates a learnable prompt head, which facilitates rapid task adaptation even in label-scarce settings. Unlike prior methods, TAG2M generalizes well across both homophilous and heterophilous datasets while delivering a significant computational advantage, achieving up to a 20X -200X speed-up. Extensive evaluations on 11 public datasets demonstrate its superior accuracy across diverse tasks, including node classification, link prediction, and node regression, outperforming state-of-the-art approaches. Ram Ganesh V, Ayush Singh, Aditi Rai, Harsh Pal, Deepanshu Bagotia, Akshay Sethi, Aakarsh Malhotra, Sayan Ranu |
KDD (2) | 6 |
| 2025 | Proactive Detection of Model Degradation in Financial Fraud Prediction with Delayed Labels
Akshay Sethi, Priyanshi Gupta, Sparsh Kansotia, Kamal Kant, Nitish Srivasatava |
ECML/PKDD (9) | 1 |
| 2023 | Auto-TabTransformer: Hierarchical Transformers for Self and Semi Supervised Learning in Tabular DataabstractSelf and Semi-Supervised Learning have shown promising results in language and computer vision but are still underexplored in the context of tabular data. This paper focuses on exploring self and semi-supervised methods for tabular data. Towards this, we have proposed Auto-Tab Transformer, a method for training hierarchical transformers in a self and semi-supervised setup using redundancy reduction. The technique focuses on key aspects of self and semi-supervised learning: feature encoding, pre-training objective, training methodology and neural architecture. Performing extensive experiments on four publically accessible datasets, we show that Auto-Tab Transformer achieves state of the art (SOTA) results in the less labelled data domain. We conduct extensive ablation studies detailing the importance of all the components used. Akshay Sethi, Sonia Gupta, Ayush Agarwal, Nancy Agrawal, Siddhartha Asthana |
IJCNN | 1 |
| 2023 | Learning Representations for Bipartite Graphs Using Multi-task Self-supervised Learning
Akshay Sethi, Sonia Gupta, Aakarsh Malhotra, Siddhartha Asthana |
ECML/PKDD (3) | 1 |
| 2020 | Representation Learning for Dynamic Graphs: A SurveyabstractGraphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static graphs. However, many applications involve evolving graphs. This introduces important challenges for learning and inference since nodes, attributes, and edges change over time. In this survey, we review the recent advances in representation learning for dynamic graphs, including dynamic knowledge graphs. We describe existing models from an encoder-decoder perspective, categorize these encoders and decoders based on the techniques they employ, and analyze the approaches in each category. We also review several prominent applications and widely used datasets and highlight directions for future research. Mehran Kazemi, Rishab Goel, Kshitij Jain 0001, Ivan Kobyzev, Akshay Sethi, Peter Forsyth, Pascal Poupart |
J. Mach. Learn. Res. | 5 |
| 2019 | Residual Codean Autoencoder for Facial Attribute Analysis
Akshay Sethi, Maneet Singh, Richa Singh 0001, Mayank Vatsa |
Pattern Recognit. Lett. | 1 |
| 2018 | Democratization of Deep Learning Using DARVIZabstractWith an abundance of research papers in deep learning, adoption and reproducibility of existing works becomes a challenge. To make a DL developer life easy, we propose a novel system, DARVIZ, to visually design a DL model using a drag-and-drop framework in an platform agnostic manner. The code could be automatically generated in both Caffe and Keras. DARVIZ could import (i) any existing Caffe code, or (ii) a research paper containing a DL design; extract the design, and present it in visual editor. Anush Sankaran, Naveen Panwar, Shreya Khare, Senthil Mani, Akshay Sethi, Rahul Aralikatte, Neelamadhav Gantayat |
AAAI | 5 |
| 2018 | DLPaper2Code: Auto-Generation of Code From Deep Learning Research PapersabstractWith an abundance of research papers in deep learning, reproducibility or adoption of the existing works becomes a challenge. This is due to the lack of open source implementations provided by the authors. Even if the source code is available, then re-implementing research papers in a different library is a daunting task. To address these challenges, we propose a novel extensible approach, DLPaper2Code, to extract and understand deep learning design flow diagrams and tables available in a research paper and convert them to an abstract computational graph. The extracted computational graph is then converted into execution ready source code in both Keras and Caffe, in real-time. An arXiv-like website is created where the automatically generated designs is made publicly available for 5,000 research papers. The generated designs could be rated and edited using an intuitive drag-and-drop UI framework in a crowd sourced manner. To evaluate our approach, we create a simulated dataset with over 216,000 valid deep learning design flow diagrams using a manually defined grammar. Experiments on the simulated dataset show that the proposed framework provide more than 93% accuracy in flow diagram content extraction. Akshay Sethi, Anush Sankaran, Naveen Panwar, Shreya Khare, Senthil Mani |
AAAI | 1 |