6 citations · 16 across the 10 of their papers we have counts for
4 papers · 1 filter
Scalable Second-order Riemannian Optimization for -means Clustering
Peng Xu, Chun-Ying Hou, Xiaohui Chen +1
Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local…
Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations
Hong-Ming Chiu, Richard Y. Zhang
Adversarial training is well-known to produce high-quality neural network models that are empirically robust against adversarial perturbations. Nevertheless, once a model has been…
Simple Alternating Minimization Provably Solves Complete Dictionary Learning
Geyu Liang, Gavin Zhang, Salar Fattahi +1
This paper focuses on the noiseless complete dictionary learning problem, where the goal is to represent a set of given signals as linear combinations of a small number of atoms fr…
Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion
Gavin Zhang, Hong-Ming Chiu, Richard Y. Zhang
The matrix completion problem seeks to recover a ground truth matrix of low rank from observations of its individual elements. Real-world matrix completion is…