Privacy-preserving distributed projected one-point bandit online optimization over directed graphs
From MaRDI portal
Publication:6583485
DOI10.1002/ASJC.3148MaRDI QIDQ6583485FDOQ6583485
Authors: Mengli Wei, Zhiqiang Yang, Qiutong Ji, Zhongyuan Zhao 
Publication date: 6 August 2024
Published in: Asian Journal of Control (Search for Journal in Brave)
Recommendations
- Privacy preserving distributed online projected residual feedback optimization over unbalanced directed graphs
- Distributed online bandit linear regressions with differential privacy
- A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs
- Differentially private distributed online learning over time‐varying digraphs via dual averaging
- A differentially private distributed optimization method for constrained optimization
Cites Work
- Differential Privacy
- Constrained Consensus and Optimization in Multi-Agent Networks
- Online learning and online convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Interior-Point Methods for Full-Information and Bandit Online Learning
- Distributed Time-Varying Quadratic Optimization for Multiple Agents Under Undirected Graphs
- Distributed subgradient method for multi-agent optimization with quantized communication
- Distributed Subgradient Projection Algorithm Over Directed Graphs
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Cloud-Enabled Differentially Private Multiagent Optimization With Constraints
- Privacy-Preserving Distributed Online Optimization Over Unbalanced Digraphs via Subgradient Rescaling
- Online Distributed Convex Optimization on Dynamic Networks
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Algorithms for Robust Convex Optimization via the Scenario Approach
- Strong consistency of random gradient-free algorithms for distributed optimization
- Enabling Privacy-Preservation in Decentralized Optimization
Cited In (2)
This page was built for publication: Privacy-preserving distributed projected one-point bandit online optimization over directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6583485)
