17 citations · 18 across the 3 of their papers we have counts for
3 papers
cs.LG2021
Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization
Cheng Yang, Gene Cheung, Wai-tian Tan +1
Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer. However, unfo…
cs.LG2020★ 1 cited
Graph Metric Learning via Gershgorin Disc Alignment
Cheng Yang, Gene Cheung, Wei Hu
We propose a fast general projection-free metric learning framework, where the minimization objective is a convex differentiable f…
eess.SP2019★ 17 cited
Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift
Fen Wang, Yongchao Wang, Gene Cheung +1
Matrix completion algorithms fill missing entries in a large matrix given a subset of observed samples. However, how to best pre-select informative matrix entries given a sampling…