Distributed linear regression by averaging
From MaRDI portal
Publication:2039793
DOI10.1214/20-AOS1984zbMath1486.62199arXiv1810.00412OpenAlexW3150749950MaRDI QIDQ2039793
Publication date: 5 July 2021
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.00412
Ridge regression; shrinkage estimators (Lasso) (62J07) Linear regression; mixed models (62J05) Random matrices (probabilistic aspects) (60B20) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Parallel numerical computation (65Y05)
Related Items
Canonical thresholding for nonsparse high-dimensional linear regression ⋮ Communication-Efficient Distributed Linear Discriminant Analysis for Binary Classification ⋮ Tracy-Widom limit for the largest eigenvalue of high-dimensional covariance matrices in elliptical distributions ⋮ Robust distributed multicategory angle-based classification for massive data ⋮ High-Dimensional Analysis of Double Descent for Linear Regression with Random Projections ⋮ Unnamed Item ⋮ High-dimensional linear models: a random matrix perspective ⋮ Distributed adaptive Huber regression ⋮ Statistical modeling and an adaptive averaging technique for strong convergence of the dynamic mode decomposition ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Primal-dual subgradient methods for convex problems
- A partially linear framework for massive heterogeneous data
- High dimensional robust M-estimation: asymptotic variance via approximate message passing
- Spectral convergence for a general class of random matrices
- All convex invariant functions of hermitian matrices
- Spectral analysis of large dimensional random matrices
- Distributed testing and estimation under sparse high dimensional models
- Divide and conquer in nonstandard problems and the super-efficiency phenomenon
- Adaptive distributed methods under communication constraints
- Distributed estimation of principal eigenspaces
- Quantile regression under memory constraint
- Distributed inference for quantile regression processes
- Deterministic equivalents for certain functionals of large random matrices
- On early stopping in gradient descent learning
- Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates
- Random Matrix Methods for Wireless Communications
- On robust regression with high-dimensional predictors
- A Massive Data Framework for M-Estimators with Cubic-Rate
- A split-and-conquer approach for analysis of
- Eigenvalue Distributions of Sums and Products of Large Random Matrices Via Incremental Matrix Expansions
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- On the optimality of averaging in distributed statistical learning
- Convex Analysis on the Hermitian Matrices
- WONDER: Weighted one-shot distributed ridge regression in high dimensions
- Distributed Subgradient Methods for Multi-Agent Optimization
- Communication-Efficient Distributed Statistical Inference
- A Deterministic Equivalent for the Analysis of Correlated MIMO Multiple Access Channels
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Communication lower bounds for statistical estimation problems via a distributed data processing inequality
- Random Matrix Theory and Wireless Communications
