Distributed Gradient Descent Algorithm Robust to an Arbitrary Number of Byzantine Attackers.
Xinyang CaoLifeng LaiPublished in: IEEE Trans. Signal Process. (2019)
Keyphrases
- cost function
- computational complexity
- computational effort
- learning algorithm
- computational cost
- optimal solution
- optimization algorithm
- segmentation algorithm
- detection algorithm
- parameter tuning
- objective function
- estimation error
- experimental evaluation
- times faster
- k means
- np hard
- dynamic programming
- fault tolerant
- preprocessing
- space complexity
- high accuracy
- memory requirements
- significant improvement
- simulated annealing
- markov random field
- genetic algorithm
- worst case
- search space
- search algorithm
- similarity measure
- negative matrix factorization
- cluster centers
- randomized algorithm
- single scan