7 citations · 19 across the 12 of their papers we have counts for
12 papers
Riemannian Projection-free Online Learning
Zihao Hu, Guanghui Wang, Jacob Abernethy
The projection operation is a critical component in a wide range of optimization algorithms, such as online gradient descent (OGD), for enforcing constraints and achieving optimal…
Minimizing Dynamic Regret on Geodesic Metric Spaces
Zihao Hu, Guanghui Wang, Jacob Abernethy
In this paper, we consider the sequential decision problem where the goal is to minimize the general dynamic regret on a complete Riemannian manifold. The task of offline optimizat…
Adaptive Oracle-Efficient Online Learning
Guanghui Wang, Zihao Hu, Vidya Muthukumar +1
The classical algorithms for online learning and decision-making have the benefit of achieving the optimal performance guarantees, but suffer from computational complexity limitati…
On Accelerated Perceptrons and Beyond
Guanghui Wang, Rafael Hanashiro, Etash Guha +1
The classical Perceptron algorithm of Rosenblatt can be used to find a linear threshold function to correctly classify linearly separable data points, assuming the classes are…
In Defense of Subspace Tracker: Orthogonal Embedding for Visual Tracking
Yao Sui, Guanghui Wang, Li Zhang
The paper focuses on a classical tracking model, subspace learning, grounded on the fact that the targets in successive frames are considered to reside in a low-dimensional subspac…
Momentum Accelerates the Convergence of Stochastic AUPRC Maximization
Guanghui Wang, Ming Yang, Lijun Zhang +1
In this paper, we study stochastic optimization of areas under precision-recall curves (AUPRC), which is widely used for combating imbalanced classification tasks. Although a few m…