返回
Asynchronous Distributed Learning From Constraints
DOI:10.1109/TNNLS.2019.2947740.png)
摘要
En 中文
In this brief, the extension of the framework of Learning from Constraints (LfC) to a distributed setting where multiple parties, connected over the network, contribute to the learning process is studied. LfC relies on the generic notion of constraint to inject knowledge into the learning problem, and, due to its generality, it deals with possibly nonconvex constraints, enforced either in a hard or soft way. Motivated by recent progresses in the field of distributed and constrained nonconvex optimization, we apply the (distributed) asynchronous method of multipliers (ASYMM) to LfC. The study shows that such a method allows us to support scenarios where selected constraints (i.e., knowledge), data, and outcomes of the learning process can be locally stored in each computational node without being shared with the rest of the network, opening the road to further investigations into privacy-preserving LfC. Constraints act as a bridge between what is shared over the net and what is private to each node, and no central authority is required. We demonstrate the applicability of these ideas in two distributed real-world settings in the context of digit recognition and document classification.
Keyword:
Knowledge engineering
Distributed databases
Optimization
Task analysis
Learning systems
Bridges
Neural networks
Artificial neural networks
distributed algorithms
optimization
semisupervised learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.7K
被引数:
7.2W
机构
引用论文
Distributed Constrained Optimization and Consensus in Uncertain Networks via Proximal Minimization基于近端最小化的不确定网络中的分布式约束优化和一致性
A distributed asynchronous method of multipliers for constrained nonconvex optimization
AUTOMATICA
IF5.9

