Distributed support-vector-machine over dynamic balanced directed networks
원문 초록
In this paper, we consider the binary classification problem via distributed Support-Vector-Machines (SVM), where the idea is to train a network of agents, with limited share of data, to cooperatively learn the SVM classifier for the global database. Agents only share processed information regarding the classifier parameters and the gradient of the local loss functions instead of their raw data. In contrast to the existing work, we propose a continuous-time algorithm that incorporates network topology changes in discrete jumps. This hybrid nature allows us to remove chattering that arises because of the discretization of the underlying CT process. We show that the proposed algorithm converges to the SVM classifier over time-varying weight balanced directed graphs by using arguments from the matrix perturbation theory.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Inverse Scene Text Removal
EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements
PatchDEMUX: A Certifiably Robust Framework for Multi-label Classifiers Against Adversarial Patches
LGAR: Zero-Shot LLM-Guided Neural Ranking for Abstract Screening in Systematic Literature Reviews
Rhapsody: A Dataset for Highlight Detection in Podcasts
Token-level Accept or Reject: A Micro Alignment Approach for Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.