70 citations · 560 across the 53 of their papers we have counts for
4 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…
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…
Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient
Tianbao Yang, Lijun Zhang, Rong Jin +1
This work focuses on dynamic regret of online convex optimization that compares the performance of online learning to a clairvoyant who knows the sequence of loss functions in adva…