9 citations · 15 across the 7 of their papers we have counts for
6 papers · 1 filter
An Efficient Algorithm for Deep Stochastic Contextual Bandits
Tan Zhu, Guannan Liang, Chunjiang Zhu +2
In stochastic contextual bandit (SCB) problems, an agent selects an action based on certain observed context to maximize the cumulative reward over iterations. Recently there have…
Federated Nonconvex Sparse Learning
Qianqian Tong, Guannan Liang, Tan Zhu +1
Nonconvex sparse learning plays an essential role in many areas, such as signal processing and deep network compression. Iterative hard thresholding (IHT) methods are the state-of-…
Effective Proximal Methods for Non-convex Non-smooth Regularized Learning
Guannan Liang, Qianqian Tong, Jiahao Ding +2
Sparse learning is a very important tool for mining useful information and patterns from high dimensional data. Non-convex non-smooth regularized learning problems play essential r…
Effective Federated Adaptive Gradient Methods with Non-IID Decentralized Data
Qianqian Tong, Guannan Liang, Jinbo Bi
Federated learning allows loads of edge computing devices to collaboratively learn a global model without data sharing. The analysis with partial device participation under non-IID…
Towards Plausible Differentially Private ADMM Based Distributed Machine Learning
Jiahao Ding, Jingyi Wang, Guannan Liang +2
The Alternating Direction Method of Multipliers (ADMM) and its distributed version have been widely used in machine learning. In the iterations of ADMM, model updates using local p…
Calibrating the Adaptive Learning Rate to Improve Convergence of ADAM
Qianqian Tong, Guannan Liang, Jinbo Bi
Adaptive gradient methods (AGMs) have become popular in optimizing the nonconvex problems in deep learning area. We revisit AGMs and identify that the adaptive learning rate (A-LR)…