Optimizing the Optimal Weighted Average: Efficient Distributed Sparse Classification

doi:10.1007/978-3-032-06096-9_9

Optimizing the Optimal Weighted Average: Efficient Distributed Sparse Classification

2026-01-01

0

PRE

AI

DOI：10.1007/978-3-032-06096-9_9

Original

Original request for help

Save

Abstract

En 中文

While distributed training is often viewed as a solution to optimizing linear models on increasingly large datasets, inter-machine communication costs of popular distributed approaches can dominate as data dimensionality increases. Recent work on non-interactive algorithms shows that approximate solutions for linear models can be obtained efficiently with only a single round of communication among machines. However, this approximation often degenerates as the number of machines increases. In this paper, building on the recent optimal weighted average method, we introduce a new technique, ACOWA, that allows an extra round of communication to achieve noticeably better approximation quality with minor runtime increases. Results show that for sparse distributed logistic regression, ACOWA obtains solutions that are more faithful to the empirical risk minimizer and attain substantially higher accuracy than other distributed algorithms. We also introduce isoefficiency analysis to distributed logistic regression and show that ACOWA maintains favorable scaling with respect to data size and processor count relative to prior distributed algorithms.

Keywords:

LASSO

REGULARIZATION

Optimizing the Optimal Weighted Average: Efficient Distributed Sparse Classification

Abstract

Journal

Organization