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

99197296394 · Jun 202019922001200920172026
48 results for Parameter server

To keep up with increasing dataset sizes and model complexity, distributed training has become a necessity for large machine learning tasks. Parameter servers ease the implementation of distributed parameter management---a key concern in distributed training---, but can induce severe communication overhead. To reduce c…

2020-02-03abs ↗pdf ↗

Paper proposes a GPU-based system for training massive deep learning models in ads systems.

problem Training massive deep learning models with terabyte-scale parameters in ads systems.
method Hierarchical GPU parameter server with 3-layer storage (GPU High-Bandwidth Memory, CPU main memory, SSD).
result 4-node hierarchical GPU parameter server trains a model 2X faster than a 150-node in-memory system.

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.

Machine Learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component failures, which can be all encompassed within the spectrum of a …

2019-05-05abs ↗pdf ↗

The parameter server architecture is prevalently used for distributed deep learning. Each worker machine in a parameter server system trains the complete model, which leads to a hefty amount of network data transfer between workers and servers. We empirically observe that the data transfer has a non-negligible impact o…

2018-12-27abs ↗pdf ↗

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 three new robust aggregation rules for distributed synchronous Stochastic Gradient Descent~(SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server~(PS) architecture. We prove the Byzantine resilie…

2018-02-27abs ↗pdf ↗

Paper explores differential privacy in high-dimensional federated learning, tackling server trustworthiness and estimation.

problem Maintaining privacy in distributed environments with high-dimensional data.
method Investigates scenarios with untrusted and trusted central servers, introduces novel federated estimation algorithms for linear regression models.
result Tight minimax rates depend on high-dimensionality even with sparsity assumptions, and novel algorithms handle slight variations among distributed models.

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 ↗

We propose a novel robust aggregation rule for distributed synchronous Stochastic Gradient Descent~(SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server~(PS) architecture. We prove the Byzantine resilience…

2018-05-23abs ↗pdf ↗

Machine Learning (ML) solutions are nowadays distributed and are prone to various types of component failures, which can be encompassed in so-called Byzantine behavior. This paper introduces LiuBei, a Byzantine-resilient ML algorithm that does not trust any individual component in the network (neither workers nor serve…

2019-11-18abs ↗pdf ↗

A novel decentralized deep learning algorithm using gradient-based optimization.

problem Decentralized deep learning in networked systems without a central server.
method Heavy-ball acceleration method and consensus protocol for model and gradient-momentum sharing.
result The proposed algorithm outperforms competing methods in various communication topologies.

Corella protects client data privacy in multi-server learning with correlated queries.

problem Protecting client data privacy in multi-server machine learning.
method Proposes a private multi-server learning approach using correlated queries and strong noise.
result Mitigates client data leakage with high accuracy and minimal computational effort.

This work improves communication efficiency in federated learning over wireless networks by optimizing energy consumption.

problem Optimizing energy consumption in federated learning over wireless networks.
method Adopting SignSGD for gradient sign exchange, considering channel capacity with outage, and proposing a stochastic sign-based algorithm for uneven data distribution.
result Proposed methods achieve a balance between learning performance and energy consumption.

Collaborative personalization, such as through learned user representations (embeddings), can improve the prediction accuracy of neural-network-based models significantly. We propose Federated User Representation Learning (FURL), a simple, scalable, privacy-preserving and resource-efficient way to utilize existing neur…

2019-09-27abs ↗pdf ↗

More frequent model updates in FL increase generalization error.

problem Negative impact of frequent communication on FL model generalization.
method Analyzed the effect of the number of rounds of model aggregation on generalization error.
result Generalization error increases with more frequent model updates.

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 ↗

Most commonly used distributed machine learning systems are either synchronous or centralized asynchronous. Synchronous algorithms like AllReduce-SGD perform poorly in a heterogeneous environment, while asynchronous algorithms using a parameter server suffer from 1) communication bottleneck at parameter servers when wo…

2017-10-18abs ↗pdf ↗

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.

Deep learning (DL) training-as-a-service (TaaS) is an important emerging industrial workload. The unique challenge of TaaS is that it must satisfy a wide range of customers who have no experience and resources to tune DL hyper-parameters, and meticulous tuning for each user's dataset is prohibitively expensive. Therefo…

2016-11-18abs ↗pdf ↗

Federated learning is viewed as a hierarchical latent variable model for new algorithm development.

problem Training models privately across multiple clients while maintaining privacy and efficiency.
method Viewing federated learning as a hierarchical latent variable model and applying Expectation-Maximization (EM) algorithm.
result Proposes FedSparse, a federated learning algorithm that promotes sparsity and reduces communication and inference costs.

Hippo optimizes deep learning hyper-parameters by reducing redundant trials.

problem Redundant hyper-parameter trials in hyper-parameter optimization.
method Hippo breaks down hyper-parameter sequences into stages and executes them in a tree structure.
result Hippo reduces GPU-hours and training time significantly compared to existing methods.

A new federated learning algorithm improves on existing methods by exploiting data smoothness.

problem Federated learning optimization with smooth loss functions.
method Federated Low Rank Gradient Descent (FedLRGD) algorithm.
result FedLRGD outperforms Federated Averaging (FedAve) in federated oracle complexity under certain conditions.

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 ↗

In distributed ML applications, shared parameters are usually replicated among computing nodes to minimize network overhead. Therefore, proper consistency model must be carefully chosen to ensure algorithm's correctness and provide high throughput. Existing consistency models used in general-purpose databases and moder…

2013-12-30abs ↗pdf ↗

DaringFed incentivizes clients in OFL with dynamic rewards under TII.

problem Designing incentives for OFL clients under dynamic, incomplete information.
method Formulated as a dynamic signaling and pricing allocation problem in a Bayesian persuasion game.
result Optimal design of DaringFed improves accuracy and convergence speed by 16.99%.

Algorithm stabilizes queues in asymmetric systems with unknown service rates.

problem Stabilizing queues in multi-class multi-server systems with unknown service rates.
method Proposes UCB and Thompson Sampling algorithms to stabilize queues while learning service rates.
result Achieves system stability with an average queue length bound of \(O(\min\{N,K\}/ε)\) for large time horizon \(T\).

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 ↗

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 ↗

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 ↗