Distributed online bandit optimization under random quantization
From MaRDI portal
Publication:2097746
Recommendations
- Event-triggered distributed online convex optimization with delayed bandit feedback
- Distributed subgradient method for multi-agent optimization with quantized communication
- A distributed conjugate gradient online learning method over networks
- Distributed gradient tracking methods with finite data rates
- Adaptive online distributed optimization in dynamic environments
Cites work
- A distributed fixed-time optimization algorithm for multi-agent systems
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle
- Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
- Constrained Consensus and Optimization in Multi-Agent Networks
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Decentralized online convex optimization based on signs of relative states
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Discrete-Time Optimization in Multiagent Networks Using Only Sign of Relative State
- Distributed Mirror Descent for Online Composite Optimization
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Fast linear iterations for distributed averaging
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Optimal distributed stochastic mirror descent for strongly convex optimization
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Random gradient-free minimization of convex functions
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
Cited in
(18)- On the probability of correct selection by distributed voting in stochastic optimization
- A distributed conjugate gradient online learning method over networks
- Decentralized online convex optimization based on signs of relative states
- Event-triggered distributed online convex optimization with delayed bandit feedback
- Distributed Stochastic Online Learning Policies for Opportunistic Spectrum Access
- Adaptive online distributed optimization in dynamic environments
- Distributed online bandit linear regressions with differential privacy
- Distributed delayed dual averaging for distributed optimization over time-varying digraphs
- Distributed strategies for mixed equilibrium problems: continuous-time theoretical approaches
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- Distributed constrained optimization with periodic dynamic quantization
- Distributed constrained online convex optimization with adaptive quantization
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Distributed online adaptive algorithm with quantized communication
- Stochastic extremum seeking with binary-valued measurements and its application to distributed optimization
- Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm
This page was built for publication: Distributed online bandit optimization under random quantization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097746)
