This page has been moved to github: https://yuangzh.github.io/
|
My name is Ganzhao Yuan. I was born in a small village in Dongguan City, Guangdong Province, China. I earned my Ph.D. in School of Computer Science and Engineering at South China University of Technology. Previously, I worked as a postdoc researcher in School of Mathematics at South China University of Technology, and in Visual Computing Center at King Abdullah University of Science and Technology. I also worked as a Research Associate Professor in School of Data and Computer Science in Sun Yat-sen University.
Currently, I am an Associate Researcher in Peng Cheng Laboratory. My research interests mainly center around mathmatical optimization (e.g., semidefinite optimization, discrete optimization, nonconvex optimization) and its applications (e.g., in machine learning, quantum computing, computer vision). |
|
Selected Publications
[15] Ganzhao Yuan, Wei-Shi Zheng, Li Shen, Bernard Ghanem. A Generalized Matrix Splitting Algorithm. arXiv, 2018. [Paper]
[14] Ganzhao Yuan, Bernard Ghanem. Binary Optimization via Mathematical Programming with Equilibrium Constraints, arXiv, 2016. [Paper]
[13] Ganzhao Yuan, Bernard Ghanem. Sparsity Constrained Minimization via Mathematical Programming with Equilibrium Constraints, arXiv, 2016. [Paper]
[12] Ganzhao Yuan, Li Shen, Wei-Shi Zheng. A Block Decomposition Algorithm for Sparse Optimization, Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), 2020. [CCF A] [Code] [Paper][Slides]
[11] Ganzhao Yuan, Li Shen, Wei-Shi Zheng. A Decomposition Algorithm for the Sparse Generalized Eigenvalue Problem. IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2019. [CCF A] [Code] [Paper] [Slides]
[10] Ganzhao Yuan, Bernard Ghanem. L0TV: A Sparse Optimization Method for Impulse Noise Image Restoration. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), 2018. [CCF A] [Code] [Paper]
[09] Ganzhao Yuan, Wei-Shi Zheng, Bernard Ghanem. A Matrix Splitting Method for Composite Function Minimization, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017. [CCF A] [Code] [Paper] [Slides]
[08] Ganzhao Yuan, Bernard Ghanem. An Exact Penalty Method for Binary Optimization Based on MPEC Formulation, AAAI Conference on Artificial Intelligence (AAAI), 2017. [CCF A] [Code] [Paper]
[07] Ganzhao Yuan, Yin Yang, Zhenjie Zhang, Zhifeng Hao. Convex Optimization for Linear Query Processing under Approximate Differential Privacy, Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), 2016. [CCF A] [Code] [Paper]
[06] Ganzhao Yuan, Bernard Ghanem. A Proximal Alternating Direction Method for Semidefinite Rank Minimization, AAAI Conference on Artificial Intelligence (AAAI), 2016. [CCF A] [Code] [Paper]
[05] Ganzhao Yuan, Zhenjie Zhang, Marianne Winslett, Xiaokui Xiao, Yin Yang, Zhifeng Hao. Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy, ACM Transactions on Database Systems (TODS), 40(2): 11, 2015. [CCF A] [Code] [Paper]
[04] Ganzhao Yuan, Bernard Ghanem. L0TV: A New Method for Image Restoration in the Presence of Impulse Noise. IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 5369-5377, 2015. [CCF A, Oral, Acceptance Rate = 71/2151 = 3.3%] [Code] [Paper] [Abstract] [Slides]
[03] Ganzhao Yuan, Zhenjie Zhang, Marianne Winslett, Xiaokui Xiao, Yin Yang, Zhifeng Hao. Low-Rank Mechanism: Optimizing Batch Queries under Differential Privacy. International Conference on Very Large Data Bases (VLDB), 5(11):1352–1363, 2012. [CCF A] [Code] [Paper] [Slides].
[02] Ganzhao Yuan, Zhenjie Zhang, Bernard Ghanem, Zhifeng Hao. Low-Rank Quadratic Semidefinite Programming. Neurocomputing, 106(0):51–60, 2013. [Code] [Paper].
[01] Zhifeng Hao, Ganzhao Yuan, Bernard Ghanem. BILGO: Bilateral Greedy Optimization for Large Scale Semidefinite Programming. Neurocomputing, 127(0): 247–257, 2014. [Code] [Paper]
