DoCoM: Compressed Decentralized Optimization with Near-Optimal Sample Complexity.
Chung-Yiu YauHoi-To WaiPublished in: Trans. Mach. Learn. Res. (2023)
Keyphrases
- sample complexity
- theoretical analysis
- pac learning
- learning problems
- upper bound
- learning algorithm
- special case
- active learning
- vc dimension
- lower bound
- generalization error
- supervised learning
- concept classes
- pac learnability
- irrelevant features
- multi agent
- sample size
- training examples
- high dimensional
- data sets
- risk minimization
- covering numbers
- pairwise
- number of irrelevant features