The following pages link to (Q2921693):
Displaying 50 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)
- Exploratory distributions for convex functions (Q1737974) (← links)
- Accelerating reinforcement learning with a directional-Gaussian-smoothing evolution strategy (Q2055215) (← links)
- A new one-point residual-feedback oracle for black-box learning and control (Q2063773) (← links)
- Derivative-free optimization over multi-user MIMO networks (Q2090228) (← links)
- Distributed online bandit optimization under random quantization (Q2097746) (← links)
- Noisy zeroth-order optimization for non-smooth saddle point problems (Q2104286) (← links)
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization (Q2143221) (← links)
- Smoothed functional-based gradient algorithms for off-policy reinforcement learning: a non-asymptotic viewpoint (Q2242923) (← links)
- Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
- Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games (Q2303656) (← 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)
- Minimax efficient finite-difference stochastic gradient estimators using black-box function evaluations (Q2661588) (← links)
- Decentralized online convex optimization based on signs of relative states (Q2665168) (← links)
- Personalized optimization with user's feedback (Q2665405) (← links)
- A mixed finite differences scheme for gradient approximation (Q2671431) (← links)
- Online strongly convex optimization with unknown delays (Q2673315) (← links)
- Zeroth-order feedback optimization for cooperative multi-agent systems (Q2682294) (← links)
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
- Event-triggered distributed online convex optimization with delayed bandit feedback (Q2698149) (← 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)
- Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems (Q4969058) (← links)
- Robust Power Management via Learning and Game Design (Q4994161) (← links)
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise (Q4997171) (← links)
- (Q4998871) (← links)
- (Q4999102) (← links)
- On Gradient-Based Learning in Continuous Games (Q5027020) (← links)
- Finite Difference Gradient Approximation: To Randomize or Not? (Q5057983) (← links)
- Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling (Q5072595) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Portfolio selection algorithm under financial crisis: a case study with Bursa Malaysia (Q5083004) (← links)
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information (Q5095163) (← links)
- Technical Note—Nonstationary Stochastic Optimization Under <i>L</i><sub><i>p,q</i></sub>-Variation Measures (Q5129221) (← links)
- Data-Driven Decisions for Problems with an Unspecified Objective Function (Q5137432) (← links)
- Policy Gradient Methods for the Noisy Linear Quadratic Regulator over a Finite Horizon (Q5157372) (← links)
- (Q5159454) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Partial Monitoring—Classification, Regret Bounds, and Algorithms (Q5247607) (← links)
