{"ID":2844867,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.05104","arxiv_id":"2511.05104","title":"A Zeroth-order Resilient Algorithm for Distributed Online Optimization against Byzantine Edge Attacks","abstract":"In this paper, we propose a zeroth-order resilient distributed online algorithm for networks under Byzantine edge attacks. We assume that both the edges attacked by Byzantine adversaries and the objective function are time-varying. Moreover, we focus on the scenario where the complete time-varying objective function cannot be observed, and only its value at a certain point is available. Using deterministic difference, we design a zeroth-order distributed online optimization algorithm against Byzantine edge attacks and provide an upper bound on the dynamic regret of the algorithm. Finally, a simulation example is given justifying the theoretical results.","short_abstract":"In this paper, we propose a zeroth-order resilient distributed online algorithm for networks under Byzantine edge attacks. We assume that both the edges attacked by Byzantine adversaries and the objective function are time-varying. Moreover, we focus on the scenario where the complete time-varying objective function ca...","url_abs":"https://arxiv.org/abs/2511.05104","url_pdf":"https://arxiv.org/pdf/2511.05104v1","authors":"[\"Yuhang Liu\",\"Wenjun Mei\"]","published":"2025-11-07T09:43:05Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}