Pages that link to "Item:Q2354481"
From MaRDI portal
The following pages link to On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481):
Displaying 6 items.
- Two-armed bandit problem and batch version of the mirror descent algorithm (Q2081125) (← links)
- Gaussian two-armed bandit and optimization of batch data processing (Q2190921) (← links)
- On efficient randomized algorithms for finding the PageRank vector (Q2354453) (← links)
- Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)
- (Q5096506) (← links)
- High-probability complexity bounds for non-smooth stochastic convex optimization with heavy-tailed noise (Q6655806) (← links)
