12 papers
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…
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…
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…
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…
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…