Computer Science, University of Iowa
Organizer: Tianbao Yang
Maintained by: Yi Xu
Location: B11 MacLean Hall (MLH)
Hours: 1:30pm - 3:30pm Friday
Tentative
Week
Date
Topic
Presenter
Week 1
January 18, 2017
None
Week 2
January 25, 2017
Efficient online algorithms for fast-rate regret bounds under sparsity
Xin Man
Week 3
Feburary 01, 2017
Extragradient method with variance reduction for stochastic variantional inequalities
Yi Xu
Week 4
Feburary 08, 2017
Week 5
Feburary 15, 2017
Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data
Zhishuai Guo
Week 6
Feburary 22, 2017
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
Qi Qi
Week 7
March 01, 2017
Forward-backward-forward methods with variance reduction for stochastic variational inequalities
Mingrui Liu
Week 8
March 08, 2017
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
Hassan Rafique
Week 9
March 15, 2017
On exponential convergence of SGD in non-convex over-parametrized learning
Yan Yan
Week 10
March 22, 2017
Spring Break
Week 11
March 29, 2017
Adaptive Sampling Probabilities for Non-Smooth Optimization
Dixian Zhu
Week 12
April 05, 2017
Fixup Initialization: Residual Learning Without Normalization
Zhuoning Yuan
Week 13
April 12, 2017
Algorithmic Regularization in Over-parameterized Matrix Sensing and Neural Networks with Quadratic Activations
Runchao Ma
Week 14
April 19, 2017
On the Power and Limitations of Random Features for Understanding Neural Networks
Week 15
April 26, 2017
Stochastic Approximation of Smooth and Strongly Convex Functions: Beyond the O(1/T) Convergence Rate
Week 16
May 03, 2017
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
Qihang Lin
Week 17
May 10, 2017
Final Exam Week