Fetching the paper…
Reading the bibliography…
In this paper, we propose a practical online method for solving a class of distributionally robust optimization (DRO) with non-convex objectives, which has important applications in machine learning for improving the robustness of neural networks.
The volume of convex bodies and Banach space geometry
Gilles Pisier · 1999
Earlier work this paper cites.
Imagenet: A large-scale hierarchical image database
Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei · 2009
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky, Geoffrey Hinton, et al · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
An analysis of single-layer networks in unsupervised feature learning
Adam Coates, Andrew Y. Ng, and Honglak Lee · 2011
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Nemirovski, and Claire Tauvel · 2011
Earlier work this paper cites.
Imagenet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever, and Geoffrey E Hinton · 2012
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
One-bit compressed sensing by linear programming
Yaniv Plan and Roman Vershynin · 2013
Earlier work this paper cites.
Pareto distribution
Barry C Arnold · 2014
Earlier work this paper cites.
Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
Elad Hazan and Satyen Kale · 2014
Earlier work this paper cites.
Statistics of robust optimization: A generalized empirical likelihood approach
C. John Duchi, W. Peter Glynn, and Hongseok Namkoong · 2016
Earlier work this paper cites.
Deep residual learning for image recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2016
Earlier work this paper cites.
Stochastic gradient methods for distributionally robust optimization with f-divergences
Hongseok Namkoong and John C Duchi · 2016
Earlier work this paper cites.
Robust optimization for non-convex objectives
Robert S Chen, Brendan Lucier, Yaron Singer, and Vasilis Syrgkanis · 2017
Earlier work this paper cites.
Variance-based regularization with convex objectives
Hongseok Namkoong and John C Duchi · 2017
Earlier work this paper cites.
Sarah: A novel method for machine learning problems using stochastic recursive gradient
Lam M Nguyen, Jie Liu, Katya Scheinberg, and Martin Takac · 2017
Earlier work this paper cites.
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
Mengdi Wang, Ethan X Fang, and Han Liu · 2017
Earlier work this paper cites.
Accelerating stochastic composition optimization
Mengdi Wang, Ji Liu, and Ethan X Fang · 2017
Earlier work this paper cites.
Stochastic convex optimization: Faster local growth implies faster global convergence
Yi Xu, Qihang Lin, and Tianbao Yang · 2017
Cited alongside, same era.
Places: A 10 million image database for scene recognition
Bolei Zhou, Agata Lapedriza, Aditya Khosla, Aude Oliva, and Antonio Torralba · 2017
Cited alongside, same era.
A convergence theory for deep learning via over-parameterization
Zeyuan Allen-Zhu, Yuanzhi Li, and Zhao Song · 2018
Cited alongside, same era.
Universal stagewise learning for non-convex problems with convergence on averaged solutions
Zaiyi Chen, Zhuoning Yuan, Jinfeng Yi, Bowen Zhou, Enhong Chen, and Tianbao Yang · 2018
Cited alongside, same era.
Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Cited alongside, same era.
Stagewise training accelerates convergence of testing error over sgd
Zhuoning Yuan, Yan Yan, Rong Jin, and Tianbao Yang · 2019
Later among the works it cites.
A stochastic composite gradient method with incremental variance reduction
Junyu Zhang and Lin Xiao · 2019
Later among the works it cites.
Momentum schemes with stochastic variance reduction for nonconvex composite optimization
Yi Zhou, Zhe Wang, Kaiyi Ji, Yingbin Liang, and Vahid Tarokh · 2019
Later among the works it cites.
A robust zero-sum game framework for pool-based active learning
Dixian Zhu, Zhe Li, Xiaoyu Wang, Boqing Gong, and Tianbao Yang · 2019
Later among the works it cites.
Solving stochastic compositional optimization is nearly as easy as solving stochastic optimization
Tianyi Chen, Yuejiao Sun, and Wotao Yin · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Accelerated method for stochastic composition optimization with nonsmooth regularization
Zhouyuan Huo, Bin Gu, Ji Liu, and Heng Huang · 2018
Cited alongside, same era.
Stochastically controlled stochastic gradient for the convex and non-convex composition problem
Liu Liu, Ji Liu, Cho-Jui Hsieh, and Dacheng Tao · 2018
Cited alongside, same era.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2018
Cited alongside, same era.
Don’t decay the learning rate, increase the batch size
Samuel L Smith, Pieter-Jan Kindermans, Chris Ying, and Quoc V Le · 2018
Cited alongside, same era.
RSG: beating subgradient method without smoothness and strong convexity
Tianbao Yang and Qihang Lin · 2018
Cited alongside, same era.
Lower bounds for non-convex stochastic optimization
Yossi Arjevani, Yair Carmon, John C Duchi, Dylan J Foster, Nathan Srebro, and Blake Woodworth · 2019
Cited alongside, same era.
Momentum-based variance reduction in non-convex sgd
Ashok Cutkosky and Francesco Orabona · 2019
Cited alongside, same era.
Closest in time.
Distributionally robust federated averaging
Yuyang Deng, Mohammad Mahdi Kamani, and Mehrdad Mahdavi · 2020
Closest in time.
A single timescale stochastic approximation method for nested stochastic optimization
Saeed Ghadimi, Andrzej Ruszczynski, and Mengdi Wang · 2020
Closest in time.
Fast objective and duality gap convergence for non-convex strongly-concave min-max problems
Zhishuai Guo, Zhuoning Yuan, Yan Yan, and Tianbao Yang · 2020
Closest in time.
Large-scale methods for distributionally robust optimization
Daniel Levy, Yair Carmon, John C Duchi, and Aaron Sidford · 2020
Closest in time.
Tilted empirical risk minimization
Tian Li, Ahmad Beirami, Maziar Sanjabi, and Virginia Smith · 2020
Closest in time.
On gradient descent ascent for nonconvex-concave minimax problems
Tianyi Lin, Chi Jin, and Michael Jordan · 2020
Closest in time.
Luo Luo, Haishan Ye, and Tong Zhang · 2020
Closest in time.
A simple and effective framework for pairwise deep metric learning
Qi Qi, Yan Yan, Zixuan Wu, Xiaoyu Wang, and Tianbao Yang · 2020
Closest in time.
Sharp analysis of epoch stochastic gradient descent ascent methods for min-max optimization
Yan Yan, Yi Xu, Qihang Lin, Wei Liu, and Tianbao Yang · 2020
Closest in time.
Junchi Yang, Negar Kiyavash, and Niao He · 2020
Closest in time.
Solving stochastic compositional optimization is nearly as easy as solving stochastic optimization
Tianyi Chen, Yuejiao Sun, and Wotao Yin · 2021
Closest in time.
On tilted losses in machine learning: Theory and applications
Tian Li, Ahmad Beirami, Maziar Sanjabi, and Virginia Smith · 2021
Closest in time.
Recover code for the paper
Qi Qi · 2021
Closest in time.