The following pages link to (Q2921693):
Displayed 19 items.
- On two continuum armed bandit problems in high dimensions (Q260274) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- Perspectives on multiagent learning (Q1028921) (← links)
- Warranty optimization in a dynamic environment (Q1040028) (← links)
- Parallel distributed block coordinate descent methods based on pairwise comparison oracle (Q1675626) (← links)
- Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← links)
- Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
- Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (Q2397263) (← links)
- Random gradient-free minimization of convex functions (Q2397749) (← links)
- Online linear optimization and adaptive routing (Q2462507) (← links)
- Non-Stationary Stochastic Optimization (Q2795881) (← links)
- Truthful Mechanisms with Implicit Payment Computation (Q2796397) (← links)
- The Data-Driven Newsvendor Problem: New Bounds and Insights (Q2797452) (← links)
- Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand (Q2967620) (← links)
- No Regret Learning in Oligopolies: Cournot vs. Bertrand (Q3162528) (← links)
- (Q4637020) (← links)
- Partial Monitoring—Classification, Regret Bounds, and Algorithms (Q5247607) (← links)
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization (Q5962719) (← links)