VLDB 2026 Research / reviewers in the wild / expert
Yuriy Dorn
dblp:347/3260
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0003-0533-3018ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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.
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% | |
| Databases, data mining, and information retrieval
2 papers |
Recommender systems · 70% Information retrieval · 30% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
sequential recommendation |
1.0 | 1 | 2026 | VK-LSVD: A Large-Scale Industrial Dataset for Short-Video Recommendation · WWW 2026 |
Recommender systems › video recommendation
short-video recommendation |
1.0 | 1 | 2026 | VK-LSVD: A Large-Scale Industrial Dataset for Short-Video Recommendation · WWW 2026 |
Algorithmic game theory and mechanism design › mechanism design › auction design
ad auction |
0.9 | 1 | 2025 | BAT: Benchmark for Auto-bidding Task · WWW 2025 |
Algorithmic game theory and mechanism design › mechanism design
auction design |
0.9 | 1 | 2025 | BAT: Benchmark for Auto-bidding Task · WWW 2025 |
Algorithmic game theory and mechanism design › auction theory › bidding strategy
auto-bidding |
0.9 | 1 | 2025 | BAT: Benchmark for Auto-bidding Task · WWW 2025 |
Algorithmic game theory and mechanism design › online advertising
budget pacing |
0.9 | 1 | 2025 | BAT: Benchmark for Auto-bidding Task · WWW 2025 |
Algorithmic game theory and mechanism design › online advertising
real-time bidding |
0.9 | 1 | 2025 | BAT: Benchmark for Auto-bidding Task · WWW 2025 |
Recommender systems
cold-start recommendation |
0.3 | 1 | 2026 | VK-LSVD: A Large-Scale Industrial Dataset for Short-Video Recommendation · WWW 2026 |
Performance modeling and evaluation
benchmarking |
0.3 | 1 | 2025 | BAT: Benchmark for Auto-bidding Task · WWW 2025 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.7optimization · 1.7linear attribution model · 1.0implicit feedback modeling · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | RRE-GTC: A Geo-Temporal Cluster Dataset for Real-Estate Price Estimation and Market-Aware SearchabstractReal-estate platforms represent a complex Information Retrieval (IR) environment where user relevance depends on high-dimensional intersections of location, time, and physical attributes. However, research into Geo-spatial Information Retrieval (GIR) and location-based recommendations is currently impeded by a lack of open, high-quality datasets that capture both the temporal evolution of markets and granular accessibility signals. To bridge this gap, we introduce RRE-GTC (Ru-Real-Estate Geo-Temporal Clusters), an open resource designed to benchmark ranking, pricing, and recommendation algorithms in dynamic spatial contexts. Derived from a massive collection of apartment listings in major Russian cities, RRE-GTC aggregates 456,182 geo-temporal clusters, offering a privacy-preserving alternative to releasing raw listing-level data. The dataset provides rich and distinct features: (i) geo-temporal price dynamics (stratified percentiles over time), (ii) detailed item metadata (building stock, supply volume), and (iii) transport accessibility signals (e.g., proximity, transport density). Uniquely, the resource includes a ''transport-isolated'' price signal derived from a linear attribution model, enabling novel research into attribute-based ranking and explainable search (e.g., separating ''location value'' from ''intrinsic quality''). Released under the Apache-2.0 license and hosted on Hugging Face, RRE-GTC lowers the barrier for experimenting with content-based recommendation and retrieval, spatiotemporal ranking, and market-aware search filtration. Irina Govorova, Aleksandr Alekseitsev, Irina Podlipnova, Meruza Kubentayeva, Yuriy Dorn |
SIGIR | 5 |
| 2026 | VK-LSVD: A Large-Scale Industrial Dataset for Short-Video RecommendationabstractShort-video recommendation presents unique challenges, such as modeling rapid user interest shifts from implicit feedback, but progress is constrained by a lack of large-scale open datasets that reflect real-world platform dynamics. To bridge this gap, we introduce the VK Large Short-Video Dataset (VK-LSVD), the largest publicly available industrial dataset of its kind. VK-LSVD offers an unprecedented scale of over 40 billion interactions from 10 million users and almost 20 million videos over six months, alongside rich features including content embeddings, diverse feedback signals, and contextual metadata. Our analysis supports the dataset's quality and diversity. The dataset's immediate impact is confirmed by its central role in the live VK RecSys Challenge 2025. VK-LSVD provides a vital, open dataset to use in building realistic benchmarks to accelerate research in sequential recommendation, cold-start scenarios, and next-generation recommender systems. Aleksandr Poslavsky, Alexander D'yakonov, Yuriy Dorn, Andrey Zimovnov |
WWW | 3 |
| 2025 | Fast UCB-type Algorithms for Stochastic Bandits with Heavy and Super Heavy Symmetric Noise
Yuriy Dorn, Alexandr Katrutsa, Ilgam Latypov, Andrey Pudovikov |
AAMAS | 1 |
| 2025 | BAT: Benchmark for Auto-bidding TaskabstractThe optimization of bidding strategies for online advertising slot auctions presents a critical challenge across numerous digital marketplaces. A significant obstacle to the development, evaluation, and refinement of real-time autobidding algorithms is the scarcity of comprehensive datasets and standardized benchmarks. To address this deficiency, we present an auction benchmark encompassing the two most prevalent auction formats. We implement a series of robust baselines on a novel dataset, addressing the most salient Real-Time Bidding (RTB) problem domains: budget pacing uniformity and Cost Per Click (CPC) constraint optimization. This benchmark provides a user-friendly and intuitive framework for researchers and practitioners to develop and refine innovative autobidding algorithms, thereby facilitating advancements in the field of programmatic advertising. The implementation and additional resources can be accessed at the following repository https://github.com/avito-tech/bat-autobidding-benchmark, https://doi.org/10.5281/zenodo.14794182. Alexandra Khirianova, Ekaterina Solodneva, Andrey Pudovikov, Sergey Osokin, Egor Samosvat, Yuriy Dorn, Alexander Ledovsky, Yana Zenkova |
WWW | 6 |