Distributed constrained online convex optimization with adaptive quantization
From MaRDI portal
Recommendations
- Distributed online bandit optimization under random quantization
- Distributed online constrained convex optimization with event-triggered communication
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
- Decentralized online convex optimization with compressed communications
- Event-triggered distributed online convex optimization with delayed bandit feedback
Cites work
- A Saddle Point Algorithm for Networked Online Convex Optimization
- An Exact Quantized Decentralized Gradient Descent Algorithm
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach
- Decentralized online convex optimization with compressed communications
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed dual averaging method for multi-agent optimization with quantized communication
- Distributed online bandit optimization under random quantization
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Distributed Online Optimization With Long-Term Constraints
- Fast Convergence Rates of Distributed Subgradient Methods With Adaptive Quantization
- Logarithmic regret algorithms for online convex optimization
- Non-stationary stochastic optimization
- On Maintaining Linear Convergence of Distributed Learning and Optimization Under Limited Communication
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
- Online Learning of Feasible Strategies in Unknown Environments
- Quantization Design for Distributed Optimization
- Quantized Consensus by the ADMM: Probabilistic Versus Deterministic Quantizers
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- Trading regret for efficiency: online convex optimization with long term constraints
Cited in
(2)
This page was built for publication: Distributed constrained online convex optimization with adaptive quantization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605970)
