Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

3672107143 · Jun 202019922001200920172026
48 results for server update

Optimal client sampling reduces communication in federated learning.

problem Efficiently aggregate model updates from distributed clients in federated learning.
method Model weights as an Ornstein-Uhlenbeck process to estimate uncommunicated updates; optimal client sampling strategy.
result Significant reduction in communication with competitive or superior performance.

Federated learning systems are vulnerable to attacks from malicious clients. As the central server in the system cannot govern the behaviors of the clients, a rogue client may initiate an attack by sending malicious model updates to the server, so as to degrade the learning performance or enforce targeted model poisoni…

2020-02-01abs ↗pdf ↗

Federated learning can be vulnerable to adversarial attacks, which this work addresses.

problem Federated learning's adversarial vulnerability when deployed.
method Bias-Variance decomposition for federated learning, proposing Fed_BVA framework.
result Fed_BVA framework generates adversarial examples to improve robustness.

FedGLOMO accelerates FL convergence for non-convex functions.

problem Efficiently solving non-convex optimization problems in federated learning with client heterogeneity.
method Combines global and local momentum updates to reduce variance and improve convergence rate.
result Achieves O(ε1.5)\mathcal{O}(ε^{-1.5}) convergence to εε-stationary point, compared to O(ε2)\mathcal{O}(ε^{-2}).

This work provides bounds on generalization error and privacy leakage in federated learning.

problem Bounding generalization error and privacy leakage in federated learning.
method Information-theoretic framework for classical, distributed, and federated learning.
result Upper and lower bounds on generalization error and privacy leakage.

Local adaptive methods in FL can accelerate convergence but introduce bias, which is corrected.

problem The effect of using adaptive optimization methods for local updates in federated learning.
method Proposed correction techniques to overcome the bias introduced by local adaptive methods.
result Correction techniques can achieve faster convergence and higher test accuracy than baseline methods.

Detects backdoors in outsourced models by replicating training steps across multiple servers.

problem Detecting backdoors in models trained on cloud providers without prior knowledge.
method Replicate training steps across multiple servers to identify deviations and malicious updates.
result 99.6% accuracy in identifying backdoored models out of 50% malicious providers.

Federated learning is a method of training a global model from decentralized data distributed across client devices. Here, model parameters are computed locally by each client device and exchanged with a central server, which aggregates the local models for a global view, without requiring sharing of training data. The…

2020-02-21abs ↗pdf ↗

Asynchronous distributed stochastic gradient descent methods have trouble converging because of stale gradients. A gradient update sent to a parameter server by a client is stale if the parameters used to calculate that gradient have since been updated on the server. Approaches have been proposed to circumvent this pro…

2016-01-15abs ↗pdf ↗

Byzantine-resilient federated learning with local iterations and robust mean estimation.

problem Byzantine clients disrupt federated learning with local iterations.
method Local SGD iterations, robust mean estimation, and matrix concentration result.
result Convergence analysis for strongly-convex and non-convex smooth objectives in heterogeneous data settings.

Paper tackles federated linear bandit learning with AirComp for noisy channels.

problem Minimize cumulative regret in federated linear bandit learning.
method Proposes a federated linear bandits scheme using over-the-air computation (AirComp) over noisy fading channels.
result Determines the regret bound of the proposed scheme.

DFedAvgM is a decentralized FedAvg with momentum for privacy and communication efficiency.

problem Efficiently train models with privacy and communication efficiency in federated learning.
method Decentralized Federated Averaging with Momentum (DFedAvgM) on clients connected by an undirected graph, using stochastic gradient descent with momentum and quantization.
result DFedAvgM converges under trivial assumptions and can be improved with the PŁ property, numerically verified.

We propose Zeno++, a new robust asynchronous Stochastic Gradient Descent~(SGD) procedure which tolerates Byzantine failures of the workers. In contrast to previous work, Zeno++ removes some unrealistic restrictions on worker-server communications, allowing for fully asynchronous updates from anonymous workers, arbitrar…

2019-03-17abs ↗pdf ↗

CSE-FSL reduces communication and storage costs in federated learning.

problem High communication and storage costs in federated learning.
method CSE-FSL uses an auxiliary network to locally update client models and sends only selected epochs' smashed data.
result Significant communication reduction with state-of-the-art convergence and model accuracy.

Develops a new deep learning framework for privacy-preserving text representations.

problem Privacy concerns in deep learning frameworks requiring data pooling to a trusted server.
method Three modules: embedding, randomization, and classifier. Novel LDP protocol reduces privacy impact on accuracy.
result Framework delivers comparable or better performance than non-private and existing LDP protocols.

Collaborative learning allows participants to jointly train a model without data sharing. To update the model parameters, the central server broadcasts model parameters to the clients, and the clients send updating directions such as gradients to the server. While data do not leave a client device, the communicated gra…

2019-09-24abs ↗pdf ↗

Distributed model training is vulnerable to byzantine system failures and adversarial compute nodes, i.e., nodes that use malicious updates to corrupt the global model stored at a parameter server (PS). To guarantee some form of robustness, recent work suggests using variants of the geometric median as an aggregation r…

2018-03-27abs ↗pdf ↗

This work tackles resource allocation in asynchronous and stochastic systems.

problem Distributed resource allocation in asynchronous and stochastic settings.
method Approximate stochastic primal-dual approach with asynchronous updates.
result The Asynchronous stochastic Primal-Dual (Asyn-PD) algorithm converges to the saddle point solution at a rate of O(1/t)O(1/t).

This paper evaluates and compares gradient leakage attacks in federated learning.

problem Gradient leakage attacks compromise client privacy in federated learning.
method Formal and experimental analysis of gradient leakage attacks, evaluation of attack effectiveness and cost.
result Gradient leakage attacks can reconstruct private local training data from shared parameter updates.

Paper develops a federated learning method to protect privacy without sacrificing model utility.

problem Privacy leakage in federated learning due to information exchange between edge devices and server.
method Combines local gradient perturbation, secure aggregation, and zCDP for privacy protection.
result Demonstrates superior trade-off between privacy and model utility through extensive experiments.

AdaQuantFL reduces communication in federated learning by adaptively quantizing model updates.

problem Efficient communication of model updates in federated learning with high-dimensional models and limited bandwidth.
method AdaQuantFL uses adaptive quantization to reduce the number of bits for model updates while maintaining low error floor.
result AdaQuantFL converges in fewer communicated bits compared to fixed quantization levels, with minimal impact on accuracy.

Distributed optimization often consists of two updating phases: local optimization and inter-node communication. Conventional approaches require working nodes to communicate with the server every one or few iterations to guarantee convergence. In this paper, we establish a completely different conclusion that each node…

2019-06-14abs ↗pdf ↗

In federated learning, a central server coordinates the training of a single model on a massively distributed network of devices. This setting can be naturally extended to a multi-task learning framework, to handle real-world federated datasets that typically show strong statistical heterogeneity among devices. Despite…

2019-06-14abs ↗pdf ↗

A(DP)2^2SGD improves federated learning privacy and efficiency.

problem Privacy and efficiency in federated learning with asynchronous decentralized parallel SGD.
method Differentially private asynchronous decentralized parallel SGD (A(DP)2^2SGD) using R{é}nyi differential privacy.
result Achieves optimal convergence rate and comparable model accuracy to SSGD but faster.

FedLoRU improves FL efficiency by using low-rank updates.

problem Communication inefficiency and performance reduction in Federated Learning.
method Proposes FedLoRU, a low-rank update framework for FL, which reduces communication costs while maintaining performance.
result FedLoRU achieves convergence rates similar to FedAvg and is robust to heterogeneous and large numbers of clients.

We propose a real-time context-aware learning system along with the architecture that runs on the mobile devices, provide services to the user and manage the IoT devices. In this system, an application running on mobile devices collected data from the sensors, learned about the user-defined context, made predictions in…

2018-10-26abs ↗pdf ↗

New framework provides privacy guarantees for practical federated learning.

problem Inadequate privacy guarantees for federated learning due to restrictive assumptions.
method Fed-α\alpha-NormEC, integrating multiple local updates, partial client participation, and standard assumptions.
result Provably convergent and differentially private federated learning framework.

The current standalone deep learning framework tends to result in overfitting and low utility. This problem can be addressed by either a centralized framework that deploys a central server to train a global model on the joint data from all parties, or a distributed framework that leverages a parameter server to aggrega…

2019-06-04abs ↗pdf ↗

New insights into convergence and accuracy trade-offs in federated and meta-learning.

problem Understanding the trade-offs between convergence and accuracy in federated and meta-learning.
method Generalized local update methods, proving equivalence to first-order optimization on a surrogate loss.
result Novel convergence rates and insights into the importance of algorithmic choices in communication-limited settings.

Tensor factorization models offer an effective approach to convert massive electronic health records into meaningful clinical concepts (phenotypes) for data analysis. These models need a large amount of diverse samples to avoid population bias. An open challenge is how to derive phenotypes jointly across multiple hospi…

2017-04-11abs ↗pdf ↗

Federated CTMC model estimates bridge deterioration hazards without sharing raw data.

problem Bridge inspection data privacy and cross-organizational data sharing constraints.
method Federated CTMC hazard model with local optimization and FedAvg aggregation.
result Federated model converges on global benchmark parameters without data transfer.

We study distributed stochastic convex optimization under the delayed gradient model where the server nodes perform parameter updates, while the worker nodes compute stochastic gradients. We discuss, analyze, and experiment with a setup motivated by the behavior of real-world distributed computation networks, where the…

2015-08-20abs ↗pdf ↗

Study protects federated learning models from eavesdropping attacks.

problem Protecting client models in federated learning from eavesdropping adversaries.
method Theoretical analysis and numerical experiments examining various factors.
result Theoretical and experimental results show the effectiveness of protection methods.

Secure federated learning framework resists adversarial users.

problem Resilience against adversarial (Byzantine) users in federated learning.
method Integrated stochastic quantization, verifiable outlier detection, and secure model aggregation.
result First single-server Byzantine-resilient secure aggregation framework (BREA) for secure federated learning.

Study on incentivizing truthfulness in federated learning with heterogeneous data.

problem Manipulated updates in federated learning due to data heterogeneity.
method Formulated a game-theoretic approach to prevent clients from misreporting their gradient updates.
result Developed a payment rule that provably disincentivizes sending modified updates in federated learning.