163 citations · 1.2k across the 128 of their papers we have counts for
11 papers · 1 filter
Efficient Non-oblivious Randomized Reduction for Risk Minimization with Improved Excess Risk Guarantee
Yi Xu, Haiqin Yang, Lijun Zhang +1
In this paper, we address learning problems for high dimensional data. Previously, oblivious random projection based approaches that project high dimensional features onto a random…
Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual Coordinate Ascent
Soumitra Pal, Tingyang Xu, Tianbao Yang +2
In prior works, stochastic dual coordinate ascent (SDCA) has been parallelized in a multi-core environment where the cores communicate through shared memory, or in a multi-processo…
Adaptive Accelerated Gradient Converging Methods under Holderian Error Bound Condition
Mingrui Liu, Tianbao Yang
Recent studies have shown that proximal gradient (PG) method and accelerated gradient method (APG) with restarting can enjoy a linear convergence under a weaker condition than stro…
Improved Dynamic Regret for Non-degenerate Functions
Lijun Zhang, Tianbao Yang, Jinfeng Yi +2
Recently, there has been a growing research interest in the analysis of dynamic regret, which measures the performance of an online learner against a sequence of local minimizers.…
A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates
Tianbao Yang, Qihang Lin, Lijun Zhang
This paper focuses on convex constrained optimization problems, where the solution is subject to a convex inequality constraint. In particular, we aim at challenging problems for w…
Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than
Yi Xu, Yan Yan, Qihang Lin +1
In this paper, we develop a novel {\bf ho}moto{\bf p}y {\bf s}moothing (HOPS) algorithm for solving a family of non-smooth problems that is composed of a non-smooth term with an ex…