136 citations · 705 across the 73 of their papers we have counts for
77 papers
Extreme Point Pursuit -- Part I: A Framework for Constant Modulus Optimization
Junbin Liu, Ya Liu, Wing-Kin Ma +2
This study develops a framework for a class of constant modulus (CM) optimization problems, which covers binary constraints, discrete phase constraints, semi-orthogonal matrix cons…
Projected Tensor Power Method for Hypergraph Community Recovery
Jinxin Wang, Yuen-Man Pun, Xiaolu Wang +2
This paper investigates the problem of exact community recovery in the symmetric -uniform hypergraph stochastic block model (-HSBM). In this model, a -uniform…
Rotation Group Synchronization via Quotient Manifold
Linglingzhi Zhu, Chong Li, Anthony Man-Cho So
Rotation group synchronization is an important inverse problem and has attracted intense attention from numerous application fields such as graph realization, com…
LogSpecT: Feasible Graph Learning Model from Stationary Signals with Recovery Guarantees
Shangyuan Liu, Linglingzhi Zhu, Anthony Man-Cho So
Graph learning from signals is a core task in Graph Signal Processing (GSP). One of the most commonly used models to learn graphs from stationary signals is SpecT. However, its pra…
ReSync: Riemannian Subgradient-based Robust Rotation Synchronization
Huikang Liu, Xiao Li, Anthony Man-Cho So
This work presents ReSync, a Riemannian subgradient-based algorithm for solving the robust rotation synchronization problem, which arises in various engineering applications. ReSyn…
Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
Xiao Li, Lei Zhao, Daoli Zhu +1
The subgradient method is one of the most fundamental algorithmic schemes for nonsmooth optimization. The existing complexity and convergence results for this method are mainly der…