15 papers
Improved Analysis of Adaptive Task Allocation and Non-Stationary Processing Times
Grigory Begunov, Ilgam Latypov, Yuriy Dorn +1
We study the task allocation problem, where our goal is to develop an online algorithm that efficiently distributes tasks among workers based on their computational performance. Th…
Manifold-Aware Information Gain and Lower Bounds for Gaussian-Process Bandits on Riemannian Quotient Spaces
Yuriy Dorn, Changsheng Chen, Ning Xie
We prove a regret lower bound for Gaussian-process bandits on a smooth compact Riemannian manifold $\M$ of dimension with intrinsic Matérn- kernel () that exposes how…
Geometry-Aware Multi-Armed Bandits for Antenna Beam Selection on Spheres, Tori, $\SO(3)$, and Reconfigurable Intelligent Surfaces
Yuriy Dorn, Changsheng Chen, Ning Xie
Beam alignment in mmWave phased arrays and RIS-assisted links is a stochastic bandit under both short TTI budgets and Doppler-induced non-stationarity. The arm space is a Riemannia…
Practical MCTS-based Query Optimization: A Reproducibility Study and new MCTS algorithm for complex queries
Vladimir Burlakov, Alena Rybakina, Sergey Kudashev +4
Monte Carlo Tree Search (MCTS) has been proposed as a transformative approach to join-order optimization in database query processing, with recent frameworks such as AlphaJoin and…
VK-LSVD: A Large-Scale Industrial Dataset for Short-Video Recommendation
Aleksandr Poslavsky, Alexander D'yakonov, Yuriy Dorn +1
Short-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…
Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms
Andrey Pudovikov, Alexandra Khirianova, Ekaterina Solodneva +3
Advertisement auctions play a crucial role in revenue generation for e-commerce companies. To make the bidding procedure scalable to thousands of auctions, the automatic bidding (a…
Robust autobidding for noisy conversion prediction models
Andrey Pudovikov, Alexandra Khirianova, Ekaterina Solodneva +4
Managing millions of digital auctions is an essential task for modern advertising auction systems. The main approach to managing digital auctions is an autobidding approach, which…
BAT: Benchmark for Auto-bidding Task
Alexandra Khirianova, Ekaterina Solodneva, Andrey Pudovikov +5
The optimization of bidding strategies for online advertising slot auctions presents a critical challenge across numerous digital marketplaces. A significant obstacle to the develo…
RARe: Raising Ad Revenue Framework with Context-Aware Reranking
Ekaterina Solodneva, Alexandra Khirianova, Aleksandr Katrutsa +4
Modern recommender systems excel at optimizing search result relevance for e-commerce platforms. While maintaining this relevance, platforms seek opportunities to maximize revenue…
Functional multi-armed bandit and the best function identification problems
Yuriy Dorn, Aleksandr Katrutsa, Ilgam Latypov +1
Bandit optimization usually refers to the class of online optimization problems with limited feedback, namely, a decision maker uses only the objective value at the current point t…
Optimizing Online Advertising with Multi-Armed Bandits: Mitigating the Cold Start Problem under Auction Dynamics
Anastasiia Soboleva, Andrey Pudovikov, Roman Snetkov +3
Online advertising platforms often face a common challenge: the cold start problem. Insufficient behavioral data (clicks) makes accurate click-through rate (CTR) forecasting of new…
Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness
Anastasiia Soboleva, Alexander Ledovsky, Yuriy Dorn +3
The majority of online marketplaces offer promotion programs to sellers to acquire additional customers for their products. These programs typically allow sellers to allocate adver…
Learning-Augmented Online Caching: New Upper Bounds
Daniel Skachkov, Denis Ponomaryov, Yuri Dorn +1
We address the problem of learning-augmented online caching in the scenario when each request is accompanied by a prediction of the next occurrence of the requested page. We improv…
EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement
Alexander Demin, Yuriy Dorn, Aleksandr Katrutsa +4
Optimal page replacement is an important problem in efficient buffer management. The range of replacement strategies known in the literature varies from simple but efficient FIFO-b…
Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise
Yuriy Dorn, Aleksandr Katrutsa, Ilgam Latypov +1
In this study, we propose a new method for constructing UCB-type algorithms for stochastic multi-armed bandits based on general convex optimization methods with an inexact oracle.…