GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated Learning

نویسندگان

چکیده

Federated Learning (FL) bridges the gap between collaborative machine learning and preserving data privacy. To sustain long-term operation of an FL ecosystem, it is important to attract high-quality owners with appropriate incentive schemes. As building block such schemes, essential fairly evaluate participants’ contribution performance final model without exposing their private data. Shapley Value (SV)–based techniques have been widely adopted provide a fair evaluation participant contributions. However, existing approaches incur significant computation costs, making them difficult apply in practice. In this article, we propose Guided Truncation Gradient (GTG-Shapley) approach address challenge. It reconstructs models from gradient updates for SV calculation instead repeatedly training different combinations participants. addition, design guided Monte Carlo sampling combined within-round between-round truncation further reduce number reconstructions evaluations required. This accomplished through extensive experiments under diverse realistic distribution settings. The results demonstrate that GTG-Shapley can closely approximate actual values while significantly increasing computational efficiency compared state-of-the-art, especially non-i.i.d.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entity Resolution and Federated Learning get a Federated Resolution

Consider two data providers, each maintaining records of different feature sets about common entities. They aim to learn a linear model over the whole set of features. This problem of federated learning over vertically partitioned data includes a crucial upstream issue: entity resolution, i.e. finding the correspondence between the rows of the datasets. It is well known that entity resolution, ...

متن کامل

Accurate and Efficient Expression Evaluation and Linear Algebra

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By ‘accurate’ we mean that the computed answer has relative error less than 1, i.e., has some correct leading digits. We also address efficiency, by which we mean algorithms that run in polynomial t...

متن کامل

Accurate and efficient evaluation of Schur and Jack functions

We present new algorithms for computing the values of the Schur sλ(x1, x2, . . . , xn) and Jack J α λ (x1, x2, . . . , xn) functions in floating point arithmetic. These algorithms deliver guaranteed high relative accuracy for positive data (xi, α > 0) and run in time that is only linear in n.

متن کامل

Federated Multi-Task Learning

Federated learning poses new statistical and systems challenges in training machinelearning models over distributed networks of devices. In this work, we show thatmulti-task learning is naturally suited to handle the statistical challenges of thissetting, and propose a novel systems-aware optimization method, MOCHA, that isrobust to practical systems issues. Our method and theor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Intelligent Systems and Technology

سال: 2022

ISSN: ['2157-6904', '2157-6912']

DOI: https://doi.org/10.1145/3501811