Averaging versus voting: a comparative study of strategies for distributed classification
From MaRDI portal
Publication:2668577
DOI10.3934/mfc.2020017zbMath1486.68161MaRDI QIDQ2668577
Honglan Xu, Donglin Wang, Qiang Wu
Publication date: 7 March 2022
Published in: Mathematical Foundations of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mfc.2020017
voting; logistic regression; averaging; support vector machine; divide and conquer; distributed classification
62J12: Generalized linear models (logistic models)
68T05: Learning and adaptive systems in artificial intelligence
68W15: Distributed algorithms
68T09: Computational aspects of data analysis and big data
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-kernel regularized classifiers
- Support vector machines are universally consistent
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support-vector networks
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates
- Support Vector Machines
- On the optimality of averaging in distributed statistical learning
- Thresholded spectral algorithms for sparse approximations
- Learning theory of distributed spectral algorithms
- Theory of Reproducing Kernels
- The elements of statistical learning. Data mining, inference, and prediction