Serverless federated auprc optimization for multi-party collaborative imbalanced data mining

X Wu, Z Hu, J Pei, H Huang - Proceedings of the 29th ACM SIGKDD …, 2023 - dl.acm.org
To address the big data challenges, serverless multi-party collaborative training has recently
attracted attention in the data mining community, since they can cut down the …

Complexity of single loop algorithms for nonlinear programming with stochastic objective and constraints

A Alacaoglu, SJ Wright - International Conference on …, 2024 - proceedings.mlr.press
We analyze the sample complexity of single-loop quadratic penalty and augmented
Lagrangian algorithms for solving nonconvex optimization problems with functional equality …

Compressed decentralized proximal stochastic gradient method for nonconvex composite problems with heterogeneous data

Y Yan, J Chen, PY Chen, X Cui… - … on Machine Learning, 2023 - proceedings.mlr.press
We first propose a decentralized proximal stochastic gradient tracking method (DProxSGT)
for nonconvex stochastic composite problems, with data heterogeneously distributed on …

Interact: Achieving low sample and communication complexities in decentralized bilevel learning over networks

Z Liu, X Zhang, P Khanduri, S Lu, J Liu - Proceedings of the Twenty …, 2022 - dl.acm.org
In recent years, decentralized bilevel optimization problems have received increasing
attention in the networking and machine learning communities. However, for decentralized …

Powered stochastic optimization with hypergradient descent for large-scale learning systems

Z Yang, X Li - Expert Systems with Applications, 2024 - Elsevier
Stochastic optimization (SO) algorithms based on the Powerball function, namely powered
stochastic optimization (PoweredSO) algorithms, have been confirmed, effectively, and …

Docom: Compressed decentralized optimization with near-optimal sample complexity

CY Yau, HT Wai - arxiv preprint arxiv:2202.00255, 2022 - arxiv.org
This paper proposes the Doubly Compressed Momentum-assisted stochastic gradient
tracking algorithm $\texttt {DoCoM} $ for communication-efficient decentralized optimization …

Achieving linear speedup in decentralized stochastic compositional minimax optimization

H Gao - arxiv preprint arxiv:2307.13430, 2023 - arxiv.org
The stochastic compositional minimax problem has attracted a surge of attention in recent
years since it covers many emerging machine learning models. Meanwhile, due to the …

Faster adaptive decentralized learning algorithms

F Huang, J Zhao - arxiv preprint arxiv:2408.09775, 2024 - arxiv.org
Decentralized learning recently has received increasing attention in machine learning due
to its advantages in implementation simplicity and system robustness, data privacy …

Anarchic federated learning with delayed gradient averaging

D Li, X Gong - Proceedings of the Twenty-fourth International …, 2023 - dl.acm.org
The rapid advances in federated learning (FL) in the past few years have recently inspired a
great deal of research on this emerging topic. Existing work on FL often assume that clients …