5 citations · 8 across the 3 of their papers we have counts for
3 papers
math.OC2019★ 5 cited
SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems
Songtao Lu, Meisam Razaviyayn, Bo Yang +2
This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. Wh…
eess.SP2017★ 1 cited
Kullback-Leibler Principal Component for Tensors is not NP-hard
Kejun Huang, Nicholas D. Sidiropoulos
We study the problem of nonnegative rank-one approximation of a nonnegative tensor, and show that the globally optimal solution that minimizes the generalized Kullback-Leibler dive…
stat.ML2017★ 2 cited
On Convergence of Epanechnikov Mean Shift
Kejun Huang, Xiao Fu, Nicholas D. Sidiropoulos
Epanechnikov Mean Shift is a simple yet empirically very effective algorithm for clustering. It localizes the centroids of data clusters via estimating modes of the probability dis…