33 citations · 50 across the 4 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2023
Learning to Branch in Combinatorial Optimization with Graph Pointer Networks
Rui Wang, Zhiming Zhou, Tao Zhang +4
Branch-and-bound is a typical way to solve combinatorial optimization problems. This paper proposes a graph pointer network model for learning the variable selection policy in the…
cs.LG2018★ 8 cited
Understanding the Effectiveness of Lipschitz-Continuity in Generative Adversarial Nets
Zhiming Zhou, Yuxuan Song, Lantao Yu +5
In this paper, we investigate the underlying factor that leads to failure and success in the training of GANs. We study the property of the optimal discriminative function and show…
cs.LG2017★ 9 cited
Inception Score, Label Smoothing, Gradient Vanishing and -log(D(x)) Alternative
Zhiming Zhou, Weinan Zhang, Jun Wang
In this article, we mathematically study several GAN related topics, including Inception score, label smoothing, gradient vanishing and the -log(D(x)) alternative. --- An advanced…