Communication-Efficient Distributed Linear Discriminant Analysis for Binary Classification
From MaRDI portal
Publication:5089448
DOI10.5705/ss.202020.0374OpenAlexW3174385625MaRDI QIDQ5089448
Publication date: 19 July 2022
Published in: Statistica Sinica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5705/ss.202020.0374
random matrixrelative efficiencydistributed learninglinear discriminant analysis (LDA)deterministic equivalent
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral convergence for a general class of random 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
- Distributed linear regression by averaging
- Distributed estimation of principal eigenspaces
- Quantile regression under memory constraint
- Distributed inference for quantile regression processes
- Random Matrix Methods for Wireless Communications
- A Massive Data Framework for M-Estimators with Cubic-Rate
- A split-and-conquer approach for analysis of
- A Direct Estimation Approach to Sparse Linear Discriminant Analysis
- On the optimality of averaging in distributed statistical learning
- High-Dimensional Statistics
- Computational Limits of A Distributed Algorithm For Smoothing Spline
- A Scalable Bootstrap for Massive Data
- An asymptotic analysis of distributed nonparametric methods
- Communication-Efficient Distributed Statistical Inference
- First-Order Newton-Type Estimator for Distributed Estimation and Inference
- Communication-Efficient Accurate Statistical Estimation
This page was built for publication: Communication-Efficient Distributed Linear Discriminant Analysis for Binary Classification
