VLDB 2026 Research / reviewers in the wild / expert
Shanu Vashishtha
dblp:339/7512
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0004-0712-373XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Personalized Product Search Ranking: A Multi-Task Learning Approach with Tabular and Non-Tabular Data
Lalitesh Morishetti, Abhay Kumar 0001, Jonathan Scott, Kaushiki Nag, Gunjan Sharma, Shanu Vashishtha, Rahul Sridhar, Rohit Chatter, Kannan Achan |
IEEE Big Data | 6 |
| 2024 | Leveraging User-Generated Reviews for Recommender Systems with Dynamic HeadersabstractE-commerce platforms have a vast catalog of items to cater to their customers’ shopping interests. Most of these platforms assist their customers in the shopping process by offering optimized recommendation carousels, designed to help customers quickly locate their desired items. Many models have been proposed in academic literature to generate and enhance the ranking and recall set of items in these carousels. Conventionally, the accompanying carousel title text (header) of these carousels remains static. In most instances, a generic text such as “Items similar to your current viewing” is utilized. Fixed variations such as the inclusion of specific attributes “Other items from a similar seller” or “Items from a similar brand” in addition to “frequently bought together” or “considered together” are observed as well. This work proposes a novel approach to customize the header generation process of these carousels. Our work leverages user-generated reviews that lay focus on specific attributes (aspects) of an item that were favorably perceived by users during their interaction with the given item. We extract these aspects from reviews and train a graph neural network-based model under the framework of a conditional ranking task. We refer to our innovative methodology as Dynamic Text Snippets (DTS) which generates multiple header texts for an anchor item and its recall set. Our approach demonstrates the potential of utilizing user-generated reviews and presents a unique paradigm for exploring increasingly context-aware recommendation systems. Shanu Vashishtha, Abhay Kumar 0001, Lalitesh Morishetti, Kaushiki Nag, Kannan Achan |
ECAI | 1 |
| 2024 | Chaining Text-to-Image and Large Language Model: A Novel Approach for Generating Personalized e-commerce BannersabstractText-to-image models such as stable diffusion have opened a plethora of opportunities for generating art. Recent literature has surveyed the use of text-to-image models for enhancing the work of many creative artists. Many e-commerce platforms employ a manual process to generate the banners, which is time-consuming and has limitations of scalability. In this work, we demonstrate the use of text-to-image models for generating personalized web banners with dynamic content for online shoppers based on their interactions. The novelty in this approach lies in converting users' interaction data to meaningful prompts without human intervention. To this end, we utilize a large language model (LLM) to systematically extract a tuple of attributes from item meta-information. The attributes are then passed to a text-to-image model via prompt engineering to generate images for the banner. Our results show that the proposed approach can create high-quality personalized banners for users. Shanu Vashishtha, Abhinav Prakash, Lalitesh Morishetti, Kaushiki Nag, Yokila Arora, Kannan Achan |
KDD | 1 |
| 2022 | Prospect-Net: Top-K Retrieval Problem Using Prospect TheoryabstractIn e-Commerce Industry, customers’ purchase decision of an item are usually influenced by the reference price of that item, which is implied within the context of the items (e.g. prices of an item set from search/recommendation) or external environments (e.g. prices from another e-Commerce platform). Despite of the prevalence and influence of the reference price on customers’ behavior, existing works in Information Retrieval domain do not exploit the value of the reference price in ranking problems. In this paper, we propose a list-wise ranking model named "Prospect-Net" by incorporating the prospect theory, which is the theoretical foundation for framing the reference price. We consider the Top-K retrieval task under a product recommendation setting, and demonstrate the effectiveness of Prospect-Net to capture various forms of reference price under different scenarios. Polynomial solutions are proposed to solve the Top-K retrieval problem for some of the cases where the reference price is dependent on the recommended set of items to the user. Both offline e valuation and online experiments are performed on a real-world industrial dataset with significant performance improvement. Reza Yousefi Maragheh, Ramin Giahi, Jianpeng Xu, Lalitesh Morishetti, Shanu Vashishtha, Kaushiki Nag, Jason H. D. Cho, Evren Körpeoglu, Kannan Achan |
IEEE Big Data | 5 |