VLDB 2026 Research / reviewers in the wild / expert
Manish Chandra
dblp:297/0821
· DBLP profile ↗
5ranked-venue papers in the field
4as first author
5since 2021 · last 2026
0009-0000-6156-5337ORCID · corroborated
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 5 (4 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LURE-RAG: Lightweight Utility-Driven Reranking for Efficient RAG
Manish Chandra, Debasis Ganguly, Iadh Ounis |
ECIR (1) | 1 |
| 2025 | One Size Doesn't Fit All: Predicting the Number of Examples for In-Context Learning
Manish Chandra, Debasis Ganguly, Iadh Ounis |
ECIR (1) | 1 |
| 2024 | "In-Context Learning" or: How I learned to stop worrying and love "Applied Information Retrieval"abstractWith the increasing ability of large language models (LLMs), in-context learning (ICL) has evolved as a new paradigm for natural language processing (NLP), where instead of fine- tuning the parameters of an LLM specific to a downstream task with labeled examples,a small number of such examples is appended to a prompt instruction for controlling the decoder's generation process. ICL, thus, is conceptually similar to a non-parametric approach, such as k-NN,where the prediction for each instance essentially depends on the local topology, i.e., on a localised set of similar instances and their labels (called few-shot examples). This suggests that a test instance in ICL is analogous to a query in IR, and similar examples in ICL retrieved from a training set relate to a set of documents retrieved from a collection in IR. While standard unsupervised ranking models can be used to retrieve these few-shot examples from a training set, the effectiveness of the examples can potentially be improved by re-defining the notion of relevance specific to its utility for the downstream task, i.e., considering an example to be relevant if including it in the prompt instruction leads to a correct prediction. With this task-specific notion of relevance, it is possible to train a supervised ranking model (e.g., a bi-encoder or cross-encoder), which potentially learns to optimally select the few-shot examples. We believe that the recent advances in neural rankers can potentially find a use case for this task of optimally choosing examples for more effective downstream ICL predictions. Andrew Parry, Debasis Ganguly, Manish Chandra |
SIGIR | 3 |
| 2023 | 'Choose your Data Wisely': Active Learning based Selection with Multi-Objective Optimisation for Mitigating StereotypesabstractData-driven (deep) learning methods has led to parameterised abstractions of the data, often leading to stereotype societal biases in their predictions, e.g., predicting more frequently that women are weaker than men, or that African Americans are more likely to commit crimes than Caucasians. Standard approaches of mitigating such stereotypical biases from deep neural models include modifying the training dataset (pre-processing), or adjusting the model parameters with a bias-specific objective (in-processing). In our work, we approach this bias mitigation from a different perspective - that of an active learning-based selection of a subset of data instances towards training a model optimised for both effectiveness and fairness. Specifically speaking, the imbalances in the attribute value priors can be alleviated by constructing a balanced subset of the data instances with two selection objectives - first, of improving the model confidence of the primary task itself (a standard practice in active learning), and the second, of taking into account the parity of the model predictions with respect to the sensitive attributes, such as gender and race etc. We demonstrate that our proposed selection function achieves better results in terms of both the primary task effectiveness and fairness. The results are further shown to improve when this active learning-based data selection is combined with an in-process method of multi-objective training. Manish Chandra, Debasis Ganguly, Tulika Saha, Iadh Ounis |
CIKM | 1 |
| 2021 | NIP-GCN: An Augmented Graph Convolutional Network with Node Interaction PatternsabstractIn this paper, we propose an augmented Graph Convolutional Network (GCN) mechanism wherein additional information of local interaction patterns between a node with its neighbors (specifically, in the form of distribution of cosine similarity values of a pre-trained node vector with its neighbors) is used to enrich a node's representation prior to training a GCN. This provides additional information about the structural properties of a node, which the standard convolution operation in a GCN can then leverage for obtaining potentially improved effectiveness in a down-stream task. Our experiments demonstrate that adding these node interaction patterns (NIPs) along with an additional noise-contrastive pairwise document similarity objective within a GCN improves the linked document classification task. Manish Chandra, Debasis Ganguly, Pabitra Mitra, Bithika Pal, James Thomas 0001 |
SIGIR | 1 |