April 24, 2024, 4:43 a.m. | Mattia Bianchi, Sergio Grammatico

cs.LG updates on arXiv.org arxiv.org

arXiv:2404.15273v1 Announce Type: cross
Abstract: Distributed decision problems features a group of agents that can only communicate over a peer-to-peer network, without a central memory. In applications such as network control and data ranking, each agent is only affected by a small portion of the decision vector: this sparsity is typically ignored in distributed algorithms, while it could be leveraged to improve efficiency and scalability. To address this issue, our recent paper introduces Estimation Network Design (END), a graph theoretical …

abstract agent agents applications arxiv control cs.dc cs.lg cs.ma data decision design distributed features framework math.oc memory network optimization peer peer-to-peer ranking small sparsity type vector

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne