Fetching the paper…
Reading the bibliography…
Min-max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution.
D. Davis and B. Grimmer, Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems , SIAM Journal on Optimization 29 (2019), pp. 1908–1930
1930
Earlier work this paper cites.
R.T. Rockafellar, Monotone operators and the proximal point algorithm , SIAM J. on Control and Optimization 14 (1976). Available at http://epubs.siam.org/sicon/resource/1/sjcodc/v14/i5/p877_s1
1976
Earlier work this paper cites.
S.J. Reddi, S. Sra, B. Póczos, and A.J. Smola, Fast incremental method for smooth nonconvex optimization , in 55th IEEE Conference on Decision and Control (CDC) . 2016, pp. 1971–1977
1977
Earlier work this paper cites.
C. Bennett and R. Sharpley, Interpolation of Operators , Pure and Applied Mathematics, Elsevier Science, 1988, Available at https://books.google.com/books?id=HpqF9zjZWMMC
1988
Earlier work this paper cites.
O. Dekel and Y. Singer, Support Vector Machines on a Budget , in NIPS . 2006, pp. 345–352
2006
Earlier work this paper cites.
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro, Robust stochastic approximation approach to stochastic programming , SIAM Journal on Optimization 19 (2009), pp. 1574–1609
2009
Earlier work this paper cites.
S. Ghadimi and G. Lan, Stochastic first- and zeroth-order methods for nonconvex stochastic programming , SIAM Journal on Optimization 23 (2013), pp. 2341–2368
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
Z. Allen-Zhu and E. Hazan, Variance Reduction for Faster Non-Convex Optimization , in Proceedings of the 33nd International Conference on Machine Learning (ICML) . 2016, pp. 699–707
2016
Earlier work this paper cites.
S. Ghadimi and G. Lan, Accelerated gradient methods for nonconvex nonlinear and stochastic programming , Math. Program. 156 (2016), pp. 59–99
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, Deep residual learning for image recognition , in Proceedings of the IEEE conference on computer vision and pattern recognition . 2016, pp. 770–778
2016
Earlier work this paper cites.
B. Palaniappan and F. Bach, Stochastic Variance Reduction Methods for Saddle-Point Problems , in Advances in Neural Information Processing Systems . 2016, pp. 1408–1416
2016
Earlier work this paper cites.
S.J. Reddi, A. Hefny, S. Sra, B. Póczós, and A. Smola, Stochastic Variance Reduction for Nonconvex Optimization , in Proceedings of the 33rd International Conference on International Conference on Machine Learning (ICML) . JMLR.org, 2016, pp. 314–323
2016
Earlier work this paper cites.
S. Shalev-Shwartz and Y. Wexler, Minimizing the Maximal Loss: How and Why , in Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016 . 2016, pp. 793–801. Available at http://jmlr.org/proceedings/papers/v48/shalev-shwartzb16.html
2016
Earlier work this paper cites.
2016
Cited alongside, same era.
Z. Allen-Zhu, Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter , in Proceedings of the 34th International Conference on Machine Learning (ICML) . 2017, pp. 89–97
2017
Cited alongside, same era.
R.S. Chen, B. Lucier, Y. Singer, and V. Syrgkanis, Robust optimization for non-convex objectives , in Advances in Neural Information Processing Systems 30 (NIPS , 2017, pp. 4705–4714
2017
Cited alongside, same era.
D. Drusvyatskiy, The proximal point method revisited , arXiv preprint arXiv:1712.06038 (2017)
2017
Cited alongside, same era.
2018
Closest in time.
Q. Lin, R. Ma, and T. Yang, Level-set methods for finite-sum constrained convex optimization , in International Conference on Machine Learning . 2018, pp. 3118–3127
2018
Closest in time.
C. Paquette, H. Lin, D. Drusvyatskiy, J. Mairal, and Z. Harchaoui, Catalyst for Gradient-based Nonconvex Optimization , in International Conference on Artificial Intelligence and Statistics . 2018, pp. 613–622
2018
Closest in time.
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Fan, S. Lyu, Y. Ying, and B. Hu, Learning with Average Top-k Loss , in Advances in Neural Information Processing Systems (NIPS) . 2017, pp. 497–505
2017
Cited alongside, same era.
P.L. Loh, Statistical consistency and asymptotic normality for high-dimensional robust m m -estimators , The Annals of Statistics 45 (2017), pp. 866–896. Available at https://doi.org/10.1214/16-AOS1471
2017
Cited alongside, same era.
2017
Cited alongside, same era.
H. Namkoong and J.C. Duchi, Variance-based Regularization with Convex Objectives , in Advances in Neural Information Processing Systems (NIPS) . 2017, pp. 2975–2984
2017
Cited alongside, same era.
Z. Shi, X. Zhang, and Y. Yu, Bregman divergence for stochastic variance reduction: saddle-point and adversarial prediction , in Advances in Neural Information Processing Systems . 2017, pp. 6031–6041
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2019
Closest in time.
S. Lu, I. Tsaknakis, and M. Hong, Block alternating optimization for non-convex min-max problems: algorithms and applications in signal processing and communications , in Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . 2019
2019
Closest in time.
M. Nouiehed, M. Sanjabi, T. Huang, J.D. Lee, and M. Razaviyayn, Solving a class of non-convex min-max games using iterative first order methods , in Advances in Neural Information Processing Systems . 2019, pp. 14934–14942
2019
Closest in time.
Q. Qian, S. Zhu, J. Tang, R. Jin, B. Sun, and H. Li, Robust optimization over multiple domains , in Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 33. 2019, pp. 4739–4746
2019
Closest in time.
K.K. Thekumparampil, P. Jain, P. Netrapalli, and S. Oh, Efficient algorithms for smooth minimax optimization , in Advances in Neural Information Processing Systems . 2019, pp. 12680–12691
2019
Closest in time.
2020
Closest in time.
T. Lin, C. Jin, and M.I. Jordan, On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems , in International Conference on Machine Learning (ICML) . 2020
2020
Closest in time.
S. Lu, I. Tsaknakis, M. Hong, and Y. Chen, Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications , IEEE Transactions on Signal Processing (2020)
2020
Closest in time.
Y. Xu, S. Zhu, S. Yang, C. Zhang, R. Jin, and T. Yang, Learning with non-convex truncated losses by SGD , in Uncertainty in Artificial Intelligence . PMLR, 2020, pp. 701–711
2020
Closest in time.