Yangmuzi Zhang

Yangmuzi Zhang

Auto-generated profile, based on publicly available information

Yangmuzi Zhang

Google, Mountain View, CA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 November 2017 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
NGNaiyang Guan
Naiyang Guan
TLTongliang Liu
Tongliang Liu
YZYangmuzi Zhang
Yangmuzi Zhang
DTDacheng Tao
Dacheng Tao
LDLarry S. Davis
Larry S. Davis
Non-negative matrix factorization (NMF) minimizes the euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large errors, and develop a Truncated CauchyNMF to robustly learn the subspace on noisy datasets contaminated by outliers. We theoretically analyze the robustness of Truncated CauchyNMF comparing with the competing models and theoretically prove that Truncated CauchyNMF has a generalization bound which converges at a rate of order $O(\sqrt{{\ln n}/{n}})$ , where $n$ is the sample size. We evaluate Truncated CauchyNMF by image clustering on both simulated and real datasets. The experimental results on the datasets containing gross corruptions validate the effectiveness and robustness of Truncated CauchyNMF for learning robust subspaces.

1 January 2013
Verified
Conference Paper
Closed access
YZYangmuzi Zhang
Yangmuzi Zhang
ZJZhuolin Jiang
Zhuolin Jiang
LDLarry Davis
Larry Davis

11 February 2016 in arXiv
Verified
Preprint
Open access
PDF file
YZYangmuzi Zhang
Yangmuzi Zhang
ZJZhuolin Jiang
Zhuolin Jiang
XCXi Chen
Xi Chen
LDLarry S. Davis
Larry S. Davis
A multi-scale greedy-based object proposal generation approach is presented. Based on the multi-scale nature of objects in images, our approach is built on top of a hierarchical segmentation. We first identify the representative and diverse exemplar clusters within each scale by using a diversity ranking algorithm. Object proposals are obtained by selecting a subset from the multi-scale segment pool via maximizing a submodular objective function, which consists of a weighted coverage term, a single-scale diversity term and a multi-scale reward term. The weighted coverage term forces the selected set of object proposals to be representative and compact; the single-scale diversity term encourages choosing segments from different exemplar clusters so that they will cover as many object patterns as possible; the multi-scale reward term encourages the selected proposals to be discriminative and selected from multiple layers generated by the hierarchical image segmentation. The experimental results on the Berkeley Segmentation Dataset and PASCAL VOC2012 segmentation dataset demonstrate the accuracy and efficiency of our object proposal model. Additionally, we validate our object proposals in simultaneous segmentation and detection and outperform the state-of-art performance.

15 October 2015 in arXiv
Verified
Preprint
Open access
PDF file
BSBharat Singh
Bharat Singh
SDSoham De
Soham De
YZYangmuzi Zhang
Yangmuzi Zhang
TGThomas Goldstein
Thomas Goldstein
GTGavin Taylor
Gavin Taylor
The increasing complexity of deep learning architectures is resulting in training time requiring weeks or even months. This slow training is due in part to vanishing gradients, in which the gradients used by back-propagation are extremely large for weights connecting deep layers (layers near the output layer), and extremely small for shallow layers (near the input layer); this results in slow learning in the shallow layers. Additionally, it has also been shown that in highly non-convex problems, such as deep neural networks, there is a proliferation of high-error low curvature saddle points, which slows down learning dramatically. In this paper, we attempt to overcome the two above problems by proposing an optimization method for training deep neural networks which uses learning rates which are both specific to each layer in the network and adaptive to the curvature of the function, increasing the learning rate at low curvature points. This enables us to speed up learning in the shallow layers of the network and quickly escape high-error low curvature saddle points. We test our method on standard image classification datasets such as MNIST, CIFAR10 and ImageNet, and demonstrate that our method increases accuracy as well as reduces the required training time over standard algorithms.

9 February 2016 in arXiv
Verified
Preprint
Open access
PDF file
XDXiyang Dai
Xiyang Dai
SKSameh Khamis
Sameh Khamis
YZYangmuzi Zhang
Yangmuzi Zhang
LDLarry S. Davis
Larry S. Davis
Sparse representations have been successfully applied to signal processing, computer vision and machine learning. Currently there is a trend to learn sparse models directly on structure data, such as region covariance. However, such methods when combined with region covariance often require complex computation. We present an approach to transform a structured sparse model learning problem to a traditional vectorized sparse modeling problem by constructing a Euclidean space representation for region covariance matrices. Our new representation has multiple advantages. Experiments on several vision tasks demonstrate competitive performance with the state-of-the-art methods.