Efficient Randomized Subspace Embeddings for Distributed Optimization Under a Communication Budget

Keyphrases

• Source Code 100%
• Oracle 100%
• Distributed Optimization 100%
• Coding Scheme 100%
• Subspace Embedding 100%
• Numerical Simulation 50%
• Information Theory 50%
• Polynomial Complexity 50%
• Convergence Rate 50%
• High Probability 50%
• (R)-1 50%
• Matching Rate 50%
• Optimization Algorithm 50%
• Encoding Method 50%
• Subgradient 50%
• Computational Efficiency 50%
• Hadamard 50%
• Efficient Optimization 50%
• Descent Direction 50%
• Strongly Convex 50%
• Inverse Transform 50%
• Near-linear Time 50%
• First-order Optimization Method 50%
• Optimal Covering 50%
• Gradient Sparsification 50%
• Random Subspace 50%
• Nonsmooth Objective 50%
• Exact Gradients 50%
• Performance Lower Bounds 50%

Mathematics

• Coding Scheme 100%
• Convex 100%
• Polynomial 50%
• Optimality 50%
• Linear Time 50%
• Convergence Rate 50%
• Subgradient 50%
• Descent Direction 50%
• Inverse Transform 50%
• Transform Space 50%
• Computer Simulation 50%
• Probability 50%