Fetching the paper…
Reading the bibliography…
In this paper, we study the problem of constrained robust (min-max) optimization ina black-box setting, where the desired optimizer cannot access the gradients of the objective function but may query its values.
Statistical decision functions which minimize the maximum risk
Wald, A · 1945
Earlier work this paper cites.
The theory of max-min, with applications
Danskin, J. M · 1966
Earlier work this paper cites.
A genetic algorithm for minimax optimization problems
Herrmann, J. W · 1999
Earlier work this paper cites.
SciPy: Open source scientific tools for Python, 2001
Jones, E., Oliphant, T., Peterson, P., et al · 2001
Earlier work this paper cites.
Coevolutionary dynamics in a minimal substrate
Watson, R. A. and Pollack, J. B · 2001
Earlier work this paper cites.
A new look at solving minimax problems with coevolutionary genetic algorithms
Jensen, M. T · 2003
Earlier work this paper cites.
Convex optimization
Boyd, S. and Vandenberghe, L · 2004
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Nesterov, Y · 2007
Earlier work this paper cites.
New approaches to coevolutionary worst-case optimization
Branke, J. and Rosenbusch, J · 2008
Earlier work this paper cites.
Imagenet: A large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., and Fei-Fei, L · 2009
Earlier work this paper cites.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
Ghadimi, S. and Lan, G · 2013
Earlier work this paper cites.
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M. and Sahinidis, N. V · 2013
Earlier work this paper cites.
On the information-adaptive variants of the ADMM: an iteration complexity perspective
Gao, X., Jiang, B., and Zhang, S · 2014
Earlier work this paper cites.
Explaining and harnessing adversarial examples
Goodfellow, I. J., Shlens, J., and Szegedy, C · 2014
Earlier work this paper cites.
Proximal algorithms
Parikh, N., Boyd, S., et al · 2014
Earlier work this paper cites.
Optimal rates for zero-order convex optimization: The power of two function evaluations
Duchi, J. C., Jordan, M. I., Wainwright, M. J., and Wibisono, A · 2015
Earlier work this paper cites.
Random gradient-free minimization of convex functions
Nesterov, Y. and Spokoiny, V · 2015
Earlier work this paper cites.
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
Ghadimi, S., Lan, G., and Zhang, H · 2016
Earlier work this paper cites.
Deep residual learning for image recognition
He, K., Zhang, X., Ren, S., and Sun, J · 2016
Earlier work this paper cites.
Delving into transferable adversarial examples and black-box attacks
Liu, Y., Chen, X., Liu, C., and Song, D · 2016
Earlier work this paper cites.
Rethinking the inception architecture for computer vision
Szegedy, C., Vanhoucke, V., Ioffe, S., Shlens, J., and Wojna, Z · 2016
Earlier work this paper cites.
Derivative-free and blackbox optimization
Audet, C. and Hare, W · 2017
Cited alongside, same era.
Towards evaluating the robustness of neural networks
Carlini, N. and Wagner, D · 2017
Cited alongside, same era.
Zoo: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models
Chen, P.-Y., Zhang, H., Sharma, Y., Yi, J., and Hsieh, C.-J · 2017
Cited alongside, same era.
Frank-Wolfe Algorithms for Saddle Point Problems
Gidel, G., Jebara, T., and Lacoste-Julien, S · 2017
Cited alongside, same era.
An optimal algorithm for bandit and zero-order convex optimization with two-point feedback
Shamir, O · 2017
Cited alongside, same era.
Certified defenses for data poisoning attacks
Steinhardt, J., Koh, P. W. W., and Liang, P. S · 2017
Cited alongside, same era.
How can ai automate end-to-end data science?
Aggarwal, C., Bouneffouf, D., Samulowitz, H., Buesser, B., Hoang, T., Khurana, U., Liu, S., Pedapati, T., Ram, P., Rawat, A., et al · 2019
Closest in time.
A theoretical and empirical comparison of gradient approximations in derivative-free optimization
Berahas, A. S., Cao, L., Choromanski, K., and Scheinberg, K · 2019
Closest in time.
On the convergence of a class of adam-type algorithms for non-convex optimization
Chen, X., Liu, S., Sun, R., and Hong, M · 2019
Closest in time.
Model agnostic contrastive explanations for structured data
Dhurandhar, A., Pedapati, T., Balakrishnan, A., Chen, P.-Y., Shanmugam, K., and Puri, R · 2019
Closest in time.
Scaleable input gradient regularization for adversarial robustness
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adversarial deep learning for robust detection of binary encoded malware
Al-Dujaili, A., Huang, A., Hemberg, E., and O’Reilly, U.-M · 2018
Cited alongside, same era.
Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates
Balasubramanian, K. and Ghadimi, S · 2018
Cited alongside, same era.
Adversarially robust optimization with gaussian processes
Bogunovic, I., Scarlett, J., Jegelka, S., and Cevher, V · 2018
Cited alongside, same era.
A frank-wolfe framework for efficient and effective adversarial attacks
Chen, J., Yi, J., and Gu, Q · 2018
Cited alongside, same era.
Bandit convex optimization for scalable and dynamic IoT management
Chen, T. and Giannakis, G. B · 2018
Cited alongside, same era.
Iteration complexity of randomized primal-dual methods for convex-concave saddle point problems
Hamedani, E. Y., Jalilzadeh, A., Aybat, N. S., and Shanbhag, U. V · 2018
Cited alongside, same era.
Finlay, C. and Oberman, A. M · 2019
Closest in time.
Efficiently avoiding saddle points with zero order methods: No gradients required
Flokas, L., Vlatakis-Gkaragkounis, E.-V., and Piliouras, G · 2019
Closest in time.
Gradientless descent: High-dimensional zeroth-order optimization
Golovin, D., Karro, J., Kochanski, G., Lee, C., Song, X., et al · 2019
Closest in time.
Prior convictions: Black-box adversarial attacks with bandits and priors
Ilyas, A., Engstrom, L., and Madry, A · 2019
Closest in time.
Minmax optimization: Stable limit points of gradient descent ascent are locally optimal
Jin, C., Netrapalli, P., and Jordan, M. I · 2019
Closest in time.
Derivative-free optimization methods
Larson, J., Menickelly, M., and Wild, S. M · 2019
Closest in time.
Li, Y., Li, L., Wang, L., Zhang, T., and Gong, B · 2019
Closest in time.
signSGD via zeroth-order oracle
Liu, S., Chen, P.-Y., Chen, X., and Hong, M · 2019
Closest in time.
Block alternating optimization for non-convex min-max problems: Algorithms and applications in signal processing and communications
Lu, S., Tsaknakis, I., and Hong, M · 2019
Closest in time.
Lu, S., Tsaknakis, I., Hong, M., and Chen, Y · 2019
Closest in time.
Robustness via curvature regularization, and vice versa
Moosavi-Dezfooli, S.-M., Fawzi, A., Uesato, J., and Frossard, P · 2019
Closest in time.
Solving a class of non-convex min-max games using iterative first order methods
Nouiehed, M., Sanjabi, M., Lee, J. D., and Razaviyayn, M · 2019
Closest in time.
A bayesian optimization approach to find nash equilibria
Picheny, V., Binois, M., and Habbal, A · 2019
Closest in time.
Robust optimization over multiple domains
Qian, Q., Zhu, S., Tang, J., Jin, R., Sun, B., and Li, H · 2019
Closest in time.
Flo: Fast and lightweight hyperparameter optimization for automl
Wang, C. and Wu, Q · 2019
Closest in time.
AdaGrad stepsizes: Sharp convergence over nonconvex landscapes
Ward, R., Wu, X., and Bottou, L · 2019
Closest in time.