In optimizers that choose a join-order solver by a size rule, join ordering is an algorithm-selection problem, because dynamic programming (DP), genetic search (GEQO), and Monte Carlo tree search (MCTS) each win on different queries. PostgreSQL nevertheless chooses among them by relation count alone, although queries w...
В. В. Бурлаков, A. Rybakina, Sergey Kudashev et al.· 0 citations
This paper proposes a novel UCB-type algorithm, M-LCB, designed to manage a pool of self-learning experts in a stochastic environment while accounting for a limited per-round learning budget and derives anytime regret bounds for M-LCB that scale with the individual regrets of the experts.
Ilgam Latypov, A. Suvorikova, Alexey Kroshnin et al.· 1 citation
A two-phase accelerated method that achieves, with high probability, an accelerated optimization contribution and smooth-subclass-optimal statistical dependence on accuracy, up to logarithmic and generalized-smoothness factors.
D. Dvinskikh, A. Gasnikov, A. Lobanov et al.· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.