arXiv research

Improved distributed learning with reduced communication costs.

Swarm systems constitute a challenging problem for reinforcement learning (RL) as the algorithm needs to learn decentralized control policies that can cope with limited local sensing and communication abilities of the agents. While it is often difficult to directly define the behavior of the agents, simple communicatio…

MACC learns communication protocols by adapting counterfactual reasoning.

New protocol reduces communication costs for heterogeneous bandits over complex networks.

Agents learn to communicate and solve navigation tasks efficiently.

We prove a general connection between the communication complexity of two-player games and the sample complexity of their multi-player locally private analogues. We use this connection to prove sample complexity lower bounds for locally differentially private protocols as straightforward corollaries of results from com…

We study distribution testing with communication and memory constraints in the following computational models: (1) The {\em one-pass streaming model} where the goal is to minimize the sample complexity of the protocol subject to a memory constraint, and (2) A {\em distributed model} where the data samples reside at mul…

We study the problem of regret minimization for distributed bandits learning, in which $M$ agents work collaboratively to minimize their total regret under the coordination of a central server. Our goal is to design communication protocols with near-optimal regret and little communication cost, which is measured by the…

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

We propose an efficient protocol for decentralized training of deep neural networks from distributed data sources. The proposed protocol allows to handle different phases of model training equally well and to quickly adapt to concept drifts. This leads to a reduction of communication by an order of magnitude compared t…

Efficiently handles large support vectors in kernelized online learning.

The study sets criteria for efficient communication in distributed online learning.

ODC protocol improves learning in asynchronous multi-agent bandits.

ComEx protocol reduces communication costs in cooperative bandits.

We consider the problem of learning classifiers for labeled data that has been distributed across several nodes. Our goal is to find a single classifier, with small approximation error, across all datasets while minimizing the communication between nodes. This setting models real-world communication bottlenecks in the …

Secure Aggregation protocols allow a collection of mutually distrust parties, each holding a private value, to collaboratively compute the sum of those values without revealing the values themselves. We consider training a deep neural network in the Federated Learning model, using distributed stochastic gradient descen…

Federated learning promises to make machine learning feasible on distributed, private datasets by implementing gradient descent using secure aggregation methods. The idea is to compute a global weight update without revealing the contributions of individual users. Current practical protocols for secure aggregation work…

The problem of secure friend discovery on a social network has long been proposed and studied. The requirement is that a pair of nodes can make befriending decisions with minimum information exposed to the other party. In this paper, we propose to use community detection to tackle the problem of secure friend discovery…

This study aims to improve communication between fragmented blockchain systems in finance.

Agents collaboratively learn optimal policies in MDPs with limited capabilities.

This paper improves MARL for networked systems through new protocols and discount factors.

Aave community attack led to irretrievable debt and questioned decentralization in DeFi lending.

Applying machine learning techniques to the quickly growing data in science and industry requires highly-scalable algorithms. Large datasets are most commonly processed "data parallel" distributed across many nodes. Each node's contribution to the overall gradient is summed using a global allreduce. This allreduce is t…

Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one of them is pulled by several players at the same stage. We present a decentralized algorithm that achieves the same performance as a centra…

Novel framework for systemic risk analysis in financial markets.

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used …

In recent work, Cheu et al. (Eurocrypt 2019) proposed a protocol for $n$-party real summation in the shuffle model of differential privacy with $O_{ε, δ}(1)$ error and $Θ(ε\sqrt{n})$ one-bit messages per party. In contrast, every local model protocol for real summation must incur error $Ω(1/\sqrt{n})$, and there exist …

Distributing Neural Network training is of particular interest for several reasons including scaling using computing clusters, training at data sources such as IOT devices and edge servers, utilizing underutilized resources across heterogeneous environments, and so on. Most contemporary approaches primarily address sca…

Paper proposes a secure protocol for federated learning.

In distributed learning, the goal is to perform a learning task over data distributed across multiple nodes with minimal (expensive) communication. Prior work (Daume III et al., 2012) proposes a general model that bounds the communication required for learning classifiers while allowing for $\eps$ training error on lin…

FastSecAgg improves federated learning security and efficiency.

Paper sets fundamental limits for distributed covariance estimation with constrained communication.

Paper improves regret bounds for distributed experts problem.

This paper critiques flawed MVTS anomaly detection evaluation methods and proposes a simple baseline.

Proposes a decentralized insurance protocol for DeFi.

Proposes a credit scoring system for Aave accounts.

A scalable protocol for federated averaging with privacy and correctness guarantees.

An efficient LDP protocol for QMLE with improved practicality and theoretical guarantees.

Study on TVL computation in DeFi protocols, proposing verifiable metrics.

A novel framework for adaptive multi-agent communication in reinforcement learning.

A novel algorithm reduces regret in multi-agent multi-armed bandits through gossip-based communication.

A decentralized policy achieves logarithmic regret for multi-agent MAB problems with communication constraints.

Paper develops LDP protocols for computing U-statistics with various error bounds.

The study analyzes how cross-chain interoperability affects decentralized lending protocols' performance.

A new algorithm reduces regret in cooperative multi-agent bandits with heavy-tailed data.

A protocol reduces transaction costs for portfolio managers.

This work studies differential privacy in the context of the recently proposed shuffle model. Unlike in the local model, where the server collecting privatized data from users can track back an input to a specific user, in the shuffle model users submit their privatized inputs to a server anonymously. This setup yields…

Graphs help agents learn emergent communication.