27 citations · 40 across the 16 of their papers we have counts for
Showing 2019 · cs.LGShow all
2 papers · 2 filters
cs.LG2019
Adversarially Robust Generalization Just Requires More Unlabeled Data
Runtian Zhai, Tianle Cai, Di He +4
Neural network robustness has recently been highlighted by the existence of adversarial examples. Many previous works show that the learned networks do not perform well on perturbe…
cs.LG2019★ 2 cited
A Learning based Branch and Bound for Maximum Common Subgraph Problems
Yan-li Liu, Chu-min Li, Hua Jiang +1
Branch-and-bound (BnB) algorithms are widely used to solve combinatorial problems, and the performance crucially depends on its branching heuristic.In this work, we consider a typi…