Search arXivSearch

arXiv · 2203.03192

Dynamic Pricing for Client Recruitment in Federated Learning

Abstract

Though federated learning (FL) well preserves clients' data privacy, many clients are still reluctant to join FL given the communication cost and energy consumption in their mobile devices. It is important to design pricing compensations to motivate enough clients to join FL and distributively train the global model. Prior pricing mechanisms for FL are static and cannot adapt to clients' random arrival pattern over time. We propose a new dynamic pricing solution in closed-form by constructing the Hamiltonian function to optimally balance the client recruitment time and the model training time, without knowing clients' actual arrivals or training costs. During the client recruitment phase, we offer time-dependent monetary rewards per client arrival to trade-off between the total payment and the FL model's accuracy loss. Such reward gradually increases when we approach to the recruitment deadline or have greater data aging, and we also extend the deadline if the clients' training time per iteration becomes shorter. Further, we extend to consider heterogeneous client types in training data size and training time per iteration. We successfully extend our dynamic pricing solution and develop an optimal algorithm of linear complexity to monotonically select client types for FL. Finally, we also show the robustness of our solution against estimation error of clients' data sizes and run numerical experiments to validate our conclusion.

Explore related subjects

Keep this discovery

BibTeXRIS

Xuehe Wang, Shensheng Zheng, Lingjie Duan. 2022-03-07. Dynamic Pricing for Client Recruitment in Federated Learning. https://arxiv.org/abs/2203.03192

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT