Search Results for author:
Found 4 papers, 0 papers with code
Communication-Efficient Adam-Type Algorithms for Distributed Data Mining
In our theoretical analysis, we prove that our new algorithm achieves a fast convergence rate of $O(\frac{1}{\sqrt{nT}} + \frac{1}{(k/d)^2 T})$ with the communication cost of $O(k \log(d))$ at each iteration.
Distributed Dynamic Safe Screening Algorithms for Sparse Regularization
To the best of our knowledge, this is the first work of distributed safe dynamic screening method.
A Faster Decentralized Algorithm for Nonconvex Minimax Problems
We prove that our DM-HSGD algorithm achieves stochastic first-order oracle (SFO) complexity of $O(\kappa^3 \epsilon^{-3})$ for decentralized stochastic nonconvex-strongly-concave problem to search an $\epsilon$-stationary point, which improves the exiting best theoretical results.
Learning Better Visual Data Similarities via New Grouplet Non-Euclidean Embedding
However, pair-wise methods involve expensive training costs, while proxy-based methods are less accurate in characterizing the relationships between data points.
