activity
20132026
most citedThe huge Package for High-dimensional Undirected Graph Estimation in R

490 citations · 1.5k across the 111 of their papers we have counts for

collaborators
Showing 2018Show all

9 papers · 1 filter

cs.LG2018★ 3 cited

On Computation and Generalization of GANs with Spectrum Control

Haoming Jiang, Zhehui Chen, Minshuo Chen +3

Generative Adversarial Networks (GANs), though powerful, is hard to train. Several recent works (brock2016neural,miyato2018spectral) suggest that controlling the spectra of weight…

cs.LG2018★ 29 cited

Learning to Defend by Learning to Attack

Haoming Jiang, Zhehui Chen, Yuyang Shi +2

Adversarial training provides a principled approach for training robust neural networks. From an optimization perspective, adversarial training is essentially solving a bilevel opt…

stat.ML2018★ 3 cited

Provable Gaussian Embedding with One Observation

Ming Yu, Zhuoran Yang, Tuo Zhao +2

The success of machine learning methods heavily relies on having an appropriate representation for data at hand. Traditionally, machine learning approaches relied on user-defined h…

cs.LG2018★ 12 cited

On Tighter Generalization Bound for Deep Neural Networks: CNNs, ResNets, and Beyond

Xingguo Li, Junwei Lu, Zhaoran Wang +2

We establish a margin based data dependent generalization error bound for a general family of deep neural networks in terms of the depth and width, as well as the Jacobian of the n…

cs.LG2018★ 5 cited

On Landscape of Lagrangian Functions and Stochastic Search for Constrained Nonconvex Optimization

Zhehui Chen, Xingguo Li, Lin F. Yang +2

We study constrained nonconvex optimization problems in machine learning, signal processing, and stochastic control. It is well-known that these problems can be rewritten to a mini…

cs.LG2018

Towards Understanding Acceleration Tradeoff between Momentum and Asynchrony in Nonconvex Stochastic Optimization

Tianyi Liu, Shiyang Li, Jianping Shi +2

Asynchronous momentum stochastic gradient descent algorithms (Async-MSGD) is one of the most popular algorithms in distributed machine learning. However, its convergence properties…

stat.ML2018★ 1 cited

Detecting Nonlinear Causality in Multivariate Time Series with Sparse Additive Models

Yingxiang Yang, Adams Wei Yu, Zhaoran Wang +1

We propose a nonparametric method for detecting nonlinear causal relationship within a set of multidimensional discrete time series, by using sparse additive models (SpAMs). We sho…

cs.LG2018★ 6 cited

Dimensionality Reduction for Stationary Time Series via Stochastic Nonconvex Optimization

Minshuo Chen, Lin Yang, Mengdi Wang +1

Stochastic optimization naturally arises in machine learning. Efficient algorithms with provable guarantees, however, are still largely missing, when the objective function is nonc…

cs.LG2018★ 4 cited

A Diffusion Approximation Theory of Momentum SGD in Nonconvex Optimization

Tianyi Liu, Zhehui Chen, Enlu Zhou +1

Momentum Stochastic Gradient Descent (MSGD) algorithm has been widely applied to many nonconvex optimization problems in machine learning, e.g., training deep neural networks, vari…