Get our free extension to see links to code for papers anywhere online!

Add to Chrome

Add to Firefox

Picture for Liwei Wang

Liwei Wang

Convergence of Adversarial Training in Overparametrized Networks

Jun 19, 2019
Ruiqi Gao, Tianle Cai, Haochuan Li, Liwei Wang, Cho-Jui Hsieh, Jason D. Lee

* 33 pages

Access Paper or Ask Questions

Adversarially Robust Generalization Just Requires More Unlabeled Data

Jun 03, 2019
Runtian Zhai, Tianle Cai, Di He, Chen Dan, Kun He, John Hopcroft, Liwei Wang

Figure 1 for Adversarially Robust Generalization Just Requires More Unlabeled Data

Figure 2 for Adversarially Robust Generalization Just Requires More Unlabeled Data

Figure 3 for Adversarially Robust Generalization Just Requires More Unlabeled Data

* 16 pages. Submitted to NeurIPS 2019

Access Paper or Ask Questions

Equipping Experts/Bandits with Long-term Memory

May 30, 2019
Kai Zheng, Haipeng Luo, Ilias Diakonikolas, Liwei Wang

* 24 pages

Access Paper or Ask Questions

Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication

May 29, 2019
Yuanhao Wang, Jiachen Hu, Xiaoyu Chen, Liwei Wang

Figure 1 for Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication

Access Paper or Ask Questions

A Gram-Gauss-Newton Method Learning Overparameterized Deep Neural Networks for Regression Problems

May 28, 2019
Tianle Cai, Ruiqi Gao, Jikai Hou, Siyu Chen, Dong Wang, Di He, Zhihua Zhang, Liwei Wang

Figure 1 for A Gram-Gauss-Newton Method Learning Overparameterized Deep Neural Networks for Regression Problems

Figure 2 for A Gram-Gauss-Newton Method Learning Overparameterized Deep Neural Networks for Regression Problems

* Submitted to NeurIPS 2019

Access Paper or Ask Questions

Distributed Bandit Learning: How Much Communication is Needed to Achieve (Near) Optimal Regret

Apr 12, 2019
Yuanhao Wang, Jiachen Hu, Xiaoyu Chen, Liwei Wang

Figure 1 for Distributed Bandit Learning: How Much Communication is Needed to Achieve (Near) Optimal Regret

* 29 pages

Access Paper or Ask Questions