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.

169,051 papers · 148 categories

Trend · papers per month

0111 · Aug 201919922001200920172026
5 results for GADMM

Q-GADMM reduces communication in decentralized ML by quantizing model updates.

problem Reducing communication in decentralized ML while maintaining accuracy.
method Quantized group ADMM (Q-GADMM) with adaptive quantization.
result Q-GADMM achieves similar accuracy and convergence to non-quantized methods with less communication.

GADMM reduces communication costs in distributed machine learning.

problem Efficiently solving distributed machine learning problems with reduced communication costs.
method Group Alternating Direction Method of Multipliers (GADMM) framework.
result GADMM converges to the optimal solution for convex loss functions and is faster and more communication-efficient than state-of-the-art algorithms.

Efficient decentralized learning framework reduces communication costs.

problem Efficiently solve optimization problems in distributed learning networks.
method Censored and Quantized Generalized GADMM (CQ-GGADMM) framework.
result Achieves linear convergence rate under strong convexity assumptions.

A new decentralized deep learning method reduces communication costs without sacrificing accuracy.

problem Efficient decentralized deep learning with reduced communication costs.
method Layer-wise federated group ADMM (L-FGADMM) with adjusted communication periods for different layers.
result By skipping the largest layer consensus, L-FGADMM achieves similar test accuracy to federated learning with significantly reduced communication cost.

Paper tackles distributed linear regression with compositional covariates.

problem Solving distributed statistical methodology and computing for massive compositional data.
method Proposes two distributed optimization techniques based on ADMM and CDMM for solving constrained convex optimization problems.
result Established convergence theories for the proposed algorithms under regularity conditions.