Ronak Shah

dblp:19/355 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 56% Recommender systems · 44%
Human-computer interaction and pervasive computing
1 paper
Learning and educational technologies · 100%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › large-scale recommendation › multi-stage recommender systems
candidate generation
0.912025
Towards Web-scale Recommendations with LLMs: From Quality-aware Ranking to Candidate Generation · KDD (1) 2025
Recommender systems
large-scale recommendation
0.912025
Towards Web-scale Recommendations with LLMs: From Quality-aware Ranking to Candidate Generation · KDD (1) 2025
Information retrieval › ranking › multi-objective ranking
quality-aware ranking
0.912025
Towards Web-scale Recommendations with LLMs: From Quality-aware Ranking to Candidate Generation · KDD (1) 2025
Information retrieval
ranking
0.912025
Towards Web-scale Recommendations with LLMs: From Quality-aware Ranking to Candidate Generation · KDD (1) 2025
Learning and educational technologies › AI in education
AI-assisted learning
0.612022
ALLURE: A Multi-Modal Guided Environment for Helping Children Learn to Solve a Rubik's Cube with Automatic Solving and Interactive Explanations · AAAI 2022
Information retrieval
search engines
0.312025
Towards Web-scale Recommendations with LLMs: From Quality-aware Ranking to Candidate Generation · KDD (1) 2025
Information retrieval
web search
0.312025
Towards Web-scale Recommendations with LLMs: From Quality-aware Ranking to Candidate Generation · KDD (1) 2025

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

large language model · 0.9RecoDCG · 0.9
YearPublicationVenuePosition
2025 Towards Web-scale Recommendations with LLMs: From Quality-aware Ranking to Candidate Generation
abstract
Explore Further @ Bing is a webpage-to-webpage recommendation product, enhancing the search experience on Bing by surfacing engaging webpage recommendations tied to the search result URLs. In this paper, we present our approach for leveraging Large Language Models (LLMs) for enhancing our web-scale recommendation system. We describe the development and validation of our LLM-powered recommendation quality metric RecoDCG. We discuss our core techniques for utilizing LLMs to make our ranking stage quality-aware. Furthermore, we detail Q' recall, a recall path that enhances our system's candidate generation stage by leveraging LLMs to produce complementary and engaging recommendation candidates. We also address how we optimize our system for multiple objectives, balancing recommendation quality with click metrics. We deploy our work to production, achieving a significant improvement in recommendation quality. We share results from offline and online experiments as well as insights and steps we took to ensure our approaches scale effectively for our web-scale needs.
Jaidev Shah, Iman Barjasteh, Amey Barapatre, Rana Forsati, Xue Deng, Blake Shepard, Ronak Shah, Linjun Yang
KDD (1)10
2022 ALLURE: A Multi-Modal Guided Environment for Helping Children Learn to Solve a Rubik's Cube with Automatic Solving and Interactive Explanations
abstract
Modern artificial intelligence (AI) methods have been used to solve problems that many humans struggle to solve. This opens up new opportunities for knowledge discovery and education. We demonstrate ALLURE, an educational AI system for learning to solve the Rubik’s cube that is designed to help students improve their problem solving skills. ALLURE can both find and explain its own strategies for solving the Rubik’s cube as well as build on user-provided strategies. Collaboration between AI and user happens using visual and natural language modalities.
Kausik Lakkaraju, Thahimum Hassan, Vedant Khandelwal, Prathamjeet Singh, Cassidy Bradley, Ronak Shah, Forest Agostinelli, Biplav Srivastava, Dezhi Wu
AAAI6
2011 Object Mining for Large Video data
abstract
We propose a method for achieving a novel concise graph-based representation for retrieval of objects from large video data. The emphasis in this paper is towards achieving a compact representation of video data for faster retrieval. Specifically, we use information available from scripts and subtitles in order to group all occurrences of an object in video data, which provides a separate representation for each scene. Further, based on the premise that the number of objects in a shot are typically much less than the number of video frames in that shot, we propose a graph-based representation in which vertices represent objects rather than video frames. Key advantages of the proposed approach include faster retrieval, efficiency in performing tasks such as spatial re-ranking and graph partitioning and a single representation for both retrieval and summarization applications. We demonstrate efficacy of the proposed approach in retrieval and summarization applications over video data consisting of episodes of a popular TV series Friends.
Ronak Shah, Rishabh Iyer 0001, Subhasis Chaudhuri
BMVC1
2006 Robust Occluded Shape Recognition
Ronak Shah, Anima Mishra, Subrata Rakshit
ACCV (1)1