Communication-efficient distributed gradient descent via random projection
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7626722 (Why is no real title available?)
- A Note on Distributed Quantile Regression by Pilot Sampling and One-Step Updating
- A Scalable Bootstrap for Massive Data
- A Stochastic Approximation Method
- A distributed and integrated method of moments for high-dimensional correlated data analysis
- A massive data framework for M-estimators with cubic-rate
- A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques
- Accelerated Distributed Nesterov Gradient Descent
- Aggregated estimating equation estimation
- Automatic, dynamic, and nearly optimal learning rate specification via local quadratic approximation
- Communication-Efficient Accurate Statistical Estimation
- Communication-efficient algorithms for statistical optimization
- Communication-efficient distributed statistical inference
- Distributed community detection in dynamic graphs
- Distributed estimation of principal eigenspaces
- Distributed one-step upgraded estimation for non-uniformly and non-randomly distributed data
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Gaussian Differential Privacy
- Heterogeneity-aware and communication-efficient distributed statistical inference
- On the optimality of averaging in distributed statistical learning
- Quasi-Newton updating for large-scale distributed learning
Cited in
(1)
This page was built for publication: Communication-efficient distributed gradient descent via random projection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963026)
