Pages that link to "Item:Q2921693"

The following pages link to Online convex optimization in the bandit setting: gradient descent without a gradient (Q2921693):

Displaying 31 items.

• (Q5159454) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Partial Monitoring—Classification, Regret Bounds, and Algorithms (Q5247607) (← links)
• Interior-Point Methods for Full-Information and Bandit Online Learning (Q5271795) (← links)
• An Online Policy Gradient Algorithm for Markov Decision Processes with Continuous States and Actions (Q5380403) (← 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)
• Zeroth-order optimization with orthogonal random directions (Q6038668) (← links)
• Gradient-free federated learning methods with \(l_1\) and \(l_2\)-randomization for non-smooth convex stochastic optimization problems (Q6053598) (← links)
• Online distributed detection of sensor networks with delayed information (Q6061066) (← links)
• Distributed online bandit linear regressions with differential privacy (Q6082820) (← links)
• Online bandit convex optimisation with stochastic constraints via two-point feedback (Q6115925) (← links)
• Decentralized online convex optimization with compressed communications (Q6136129) (← links)
• Nonsmooth optimization by Lie bracket approximations into random directions (Q6161345) (← links)
• Stochastic Saddle Point Problems with Decision-Dependent Distributions (Q6176418) (← links)
• Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks (Q6180222) (← links)
• Distributed bandit online optimisation for energy management in smart grids (Q6191335) (← links)
• Distributed zeroth-order optimization: convergence rates that match centralized counterpart (Q6537281) (← links)
• Adversarial bandits with knapsacks (Q6551256) (← links)
• Nonlinear optimization filters for stochastic time-varying convex optimization (Q6577289) (← links)
• Adaptive control using stochastic approach for unknown but bounded disturbances and its application in balancing control (Q6578803) (← links)
• Gradient-free algorithms for distributed online convex optimization (Q6581072) (← links)
• Stochastic adversarial noise in the ``black box'' optimization problem (Q6588731) (← links)
• Distributed constrained online convex optimization with adaptive quantization (Q6605970) (← links)
• On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing (Q6608067) (← links)
• Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach (Q6611353) (← links)
• Online non-monotone diminishing return submodular maximization in the bandit setting (Q6631565) (← links)
• Estimation of several parameters in discretely-observed stochastic differential equations with additive fractional noise (Q6635300) (← links)
• Stochastic zeroth order descent with structured directions (Q6642789) (← links)
• Online Statistical Inference for Stochastic Optimization via Kiefer-Wolfowitz Methods (Q6651403) (← links)
• Towards data auctions with externalities (Q6665683) (← links)