Jingfeng Wu

I am a first year Ph.D. student at Johns Hopkins University, Computer Science Department. I am supervised by Prof. Vladimir Braverman.

Previously, I obtained my B.S. and M.S. at Peking University, School of Mathematical Sciences. During my master education, I was fortunate to work with Prof. Jinwen Ma and Prof. Zhanxing Zhu.

Feel free to contact me if you want to discuss or collaborate. Most of the time you can find me in Malone Hall, 2nd floor. I have always enjoyed meeting people.

Email  /  CV  /  Google Scholar  /  Github

• I will serve as a reviewer for ICML 2020.
• One paper will be orally presented in Workshop on Optimization for Machine Learning (OPT).

I am interested in mathematically motivated machine learning and deep learning. Currently, I am following cutting edge research in: 1) machine learning theory, 2) stochastic algorithms, 3) sketching algorithms, 4) adversarial learning, 5) explainable computer vision.

Obtaining Regularization for Free via Iterate Averaging
Jingfeng Wu, Vladimir Braverman, Lin F. Yang
Workshop on Optimization for Machine Learning (OPT), 2019, oral

For general strongly convex and smooth losses, we can obtain regularization for free via properly averaging the optimization paths. The regularization works similar to weight decay.

The Multiplicative Noise in Stochastic Gradient Descent: Data-Dependent Regularization, Continuous and Discrete Approximation
Jingfeng Wu, Wenqing Hu, Haoyi Xiong, Jun Huan, Zhanxing Zhu
submitted
bibtex / arXiv

We re-interpret the noise in SGD from the perspective of random sampling, and obtain several novel results in regard to understand the regularization and approximation of SGD.

Tangent-Normal Adversarial Regularization for Semi-supervised Learning
Bing Yu^*, Jingfeng Wu^*, Jinwen Ma, Zhanxing Zhu
Conference on Computer Vision and Pattern Recognition (CVPR), 2019, oral
bibtex / arXiv / slides / poster / code

We present a novel manifold regularization method for semi-supervised learning, which is realized via adversarial training.

The Anisotropic Noise in Stochastic Gradient Descent: Its Behavior of Escaping from Minima and Regularization Effects
Zhanxing Zhu^*, Jingfeng Wu^*, Bing Yu, Lei Wu, Jinwen Ma
International Conference on Machine Learning (ICML), 2019
bibtex / arXiv / slides / poster

We study the noise structure of stochastic gradient descent, and demonstrate its benefits on helping the dynamic escaping from sharp minima.

• Reviewer for ICML 2020.

• Research Assistant at Johns Hopkins University, Aug. 2019 - Now

• Research Intern at Baidu Big Data Lab, Dec. 2018 - May 2019

• Research Assistant at Peking University, July 2017 - Dec. 2018

• Importance Sampling.
• Empirical Fisher Approximation.
• Adversarial Regularization.
• Intrinsic Gradient Descent.
• Variational Inference.

Template: this