Atul Saroop

dblp:21/2266 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0003-0321-5069ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1

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.

Databases, data mining, and information retrieval
3 papers
Information retrieval · 83% Recommender systems · 17%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › neural retrieval
dense retrieval
1.012026
ReSuMe: Retriever-Summarizer Mutual Enhancement via Reinforcement Learning · WWW 2026
Information retrieval
text summarization
1.012026
ReSuMe: Retriever-Summarizer Mutual Enhancement via Reinforcement Learning · WWW 2026
Information retrieval
e-commerce search
0.712023
Beyond Hard Negatives in Product Search: Semantic Matching Using One-Class Classification (SMOCC) · WSDM 2023
Information retrieval
semantic matching
0.712023
Beyond Hard Negatives in Product Search: Semantic Matching Using One-Class Classification (SMOCC) · WSDM 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression › probabilistic regression
bayesian regression
0.312018
Bayesian Models for Product Size Recommendations · WWW 2018
Recommender systems › e-commerce recommendation
product recommendation
0.312018
Bayesian Models for Product Size Recommendations · WWW 2018
Recommender systems › fashion recommendation
size recommendation
0.312018
Bayesian Models for Product Size Recommendations · WWW 2018

Methods — techniques the papers use, named apart from their topics

contrastive learning · 1.7reinforcement learning · 1.0language model fine-tuning · 1.0group relative policy optimization · 1.0polya-gamma augmentation · 0.7one-class classification · 0.7mean-field variational inference · 0.7hard negative mining · 0.7bayesian probit · 0.7bayesian logit · 0.7
YearPublicationVenuePosition
2026 ReSuMe: Retriever-Summarizer Mutual Enhancement via Reinforcement Learning
abstract
We present ReSuMe, a general framework for mutual enhancement of dense retrieval systems and document summarizers through reinforcement learning. The framework jointly optimizes a language model for generating retrieval-oriented summaries and adapts the retrieval model to these summaries through alternating fine-tuning phases. We employ Group Relative Policy Optimization (GRPO) to fine-tune the language model based on retrieval relevance rather than linguistic quality alone, while the retrieval model is iteratively updated using contrastive learning on the generated summaries. This co-optimization process addresses the fundamental distribution shift problem that arises when retrieval models trained on full documents must operate on synthetic summaries during inference. By progressively reducing this distribution gap, our framework yields two key benefits: improved retrieval performance and a high-quality document summarizer optimized for retrieval tasks. We demonstrate our framework using Contriever on the MS-MARCO dataset, achieving consistent improvements of 13.2% in MRR@10 and 6.7% in Recall@100 over the baseline. The framework is model-agnostic and can be applied to enhance any dense retrieval system while simultaneously producing an effective document summarization model.
Owais Makroo, Nikhil Pattisapu, Karan Gupta 0002, Ankit Gandhi, Vijay Huddar, Atul Saroop
WWW6
2023 Beyond Hard Negatives in Product Search: Semantic Matching Using One-Class Classification (SMOCC)
abstract
Semantic matching is an important component of a product search pipeline. Its goal is to capture the semantic intent of the search query as opposed to the syntactic matching performed by a lexical matching system. A semantic matching model captures relationships like synonyms, and also captures common behavioral patterns to retrieve relevant results by generalizing from purchase data. They however suffer from lack of availability of informative negative examples for model training. Various methods have been proposed in the past to address this issue based upon hard-negative mining and contrastive learning.
Arindam Bhattacharya, Ankit Gandhi, Vijay Huddar, Ankith M. S, Aayush Moroney, Atul Saroop, Rahul Bhagat
WSDM6
2019 A Riemannian gossip approach to subspace learning on Grassmann manifold
Bamdev Mishra, Hiroyuki Kasai, Pratik Jawanpuria, Atul Saroop
Mach. Learn.4
2018 Bayesian Models for Product Size Recommendations
abstract
Lack of calibrated product sizing in popular categories such as apparel and shoes leads to customers purchasing incorrect sizes, which in turn results in high return rates due to fit issues. We address the problem of product size recommendations based on customer purchase and return data. We propose a novel approach based on Bayesian logit and probit regression models with ordinal categories Small, Fit, Largeto model size fits as a function of the difference between latent sizes of customers and products. We propose posterior computation based on mean-field variational inference, leveraging the Polya-Gamma augmentation for the logit prior, that results in simple updates, enabling our technique to efficiently handle large datasets. Our Bayesian approach effectively deals with issues arising from noise and sparsity in the data providing robust recommendations. Offline experiments with real-life shoe datasets show that our model outperforms the state-of-the-art in 5 of 6 datasets. and leads to an improvement of 17-26% in AUC over baselines when predicting size fit outcomes.
Vivek Sembium, Rajeev Rastogi, Lavanya Sita Tekumalla, Atul Saroop
WWW4
2017 Recommending Product Sizes to Customers
abstract
We propose a novel latent factor model for recommending product size fits {Small, Fit, Large} to customers. Latent factors for customers and products in our model correspond to their physical true size, and are learnt from past product purchase and returns data. The outcome for a customer, product pair is predicted based on the difference between customer and product true sizes, and efficient algorithms are proposed for computing customer and product true size values that minimize two loss function variants. In experiments with Amazon shoe datasets, we show that our latent factor models incorporating personas, and leveraging return codes show a 17-21% AUC improvement compared to baselines. In an online A/B test, our algorithms show an improvement of 0.49% in percentage of Fit transactions over control.
Vivek Sembium, Rajeev Rastogi, Atul Saroop, Srujana Merugu
RecSys3
2013 On the diffusion of messages in on-line social networks
Aditya Karnik, Atul Saroop, Vivek S. Borkar
Perform. Evaluation2
2011 Timing Tweets to Increase Effectiveness of Information Campaigns
Onkar Dabeer, Prachi Mehendale, Aditya Karnik, Atul Saroop
ICWSM4