Demo Data from VLDB 2026 / reviewers in the wild / expert
Vishan Vishesh Oberoi
dblp:420/4402
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 |
Recommender systems · 67% Information retrieval · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › evaluation
benchmark |
0.9 | 1 | 2025 | ORBIT - Open Recommendation Benchmark for Reproducible Research with Hidden Tests · NeurIPS 2025 |
Recommender systems
recommender system evaluation |
0.9 | 1 | 2025 | ORBIT - Open Recommendation Benchmark for Reproducible Research with Hidden Tests · NeurIPS 2025 |
Recommender systems › content recommendation
web page recommendation |
0.9 | 1 | 2025 | ORBIT - Open Recommendation Benchmark for Reproducible Research with Hidden Tests · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
prompted LLM baseline · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ORBIT - Open Recommendation Benchmark for Reproducible Research with Hidden TestsabstractRecommender systems are among the most impactful AI applications, interacting with billions of users every day, guiding them to relevant products, services, or information tailored to their preferences.However, the research and development of recommender systems are hindered by existing datasets that fail to capture realistic user behaviors and inconsistent evaluation settings that lead to ambiguous conclusions.This paper introduces the \textbf{O}pen \textbf{R}ecommendation \textbf{B}enchmark for Reproducible Research with H\textbf{I}dden \textbf{T}ests (\textbf{ORBIT}), a unified benchmark for consistent and realistic evaluation of recommendation models. ORBIT offers a standardized evaluation framework of public datasets with reproducible splits and transparent settings for its public leaderboard. Additionally, ORBIT introduces a new webpage recommendation task, ClueWeb-Reco, featuring web browsing sequences from 87 million public, high-quality webpages. ClueWeb-Reco is a synthetic dataset derived from real, user-consented, and privacy-guaranteed browsing data. It aligns with modern recommendation scenarios and is reserved as the hidden test part of our leaderboard to challenge recommendation models' generalization ability. ORBIT measures 12 representative recommendation models on its public benchmark and introduces a prompted LLM baseline on the ClueWeb-Reco hidden test.Our benchmark results reflect general improvements of recommender systems on the public datasets, with variable individual performances.The results on the hidden test reveal the limitations of existing approaches in large-scale webpage recommendation and highlight the potential for improvements with LLM integrations.ORBIT benchmark, leaderboard, and codebase are available at \url{https://www.open-reco-bench.ai}. Jingyuan He, Jiongnan Liu 0001, Vishan Vishesh Oberoi, Bolin Wu, Mahima Jagadeesh Patel, Kangrui Mao, Chuning Shi, I-Ta Lee, Arnold Overwijk, Chenyan Xiong |
NeurIPS | 3 |