Fetching the paper…
Reading the bibliography…
Learning to optimize (L2O) has recently emerged as a promising approach to solving optimization problems by exploiting the strong prediction power of neural networks and offering lower runtime complexity than conventional solvers.
P. Purdue, “The m/m/1 queue in a markovian environment,” Operations Research
1974
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural Netw
1989
Earlier work this paper cites.
V. Balakrishnan, S. Boyd, and S. Balemi, “Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems,” Intl. J. of Robust and Nonlinear Control
1991
Earlier work this paper cites.
D. Bhandari, C. Murthy, and S. K. Pal, “Genetic algorithm with elitist model and its convergence,” International Journal of Pattern Recognition and Artificial Intelligence
1996
Earlier work this paper cites.
Courier Corporation, 1998
C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization: Algorithms and Complexity · 1998
Earlier work this paper cites.
Cambridge University Press, 2004
S. Boyd and L. Vandenberghe, Convex Optimization · 2004
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Subgradient methods for saddle-point problems,” Journal of optimization theory and applications
2009
Earlier work this paper cites.
L. Huang, A. D. Joseph, B. Nelson, B. I. Rubinstein, and J. D. Tygar, “Adversarial machine learning,” in AISec
2011
Earlier work this paper cites.
Springer, 2012
B. Korte, J. Vygen, B. Korte, and J. Vygen, Combinatorial optimization · 2012
Earlier work this paper cites.
G. Yan, D. Wen, S. Olariu, and M. C. Weigle, “Security challenges in vehicular cloud computing,” IEEE Transactions on Intelligent Transportation Systems
2012
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in NIPS
2014
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980
2014
Earlier work this paper cites.
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” in NIPS
2015
Earlier work this paper cites.
M. Andrychowicz, M. Denil, S. Gomez, M. W. Hoffman, D. Pfau, T. Schaul, B. Shillingford, and N. De Freitas, “Learning to learn by gradient descent by gradient descent,” in NIPS
2016
Earlier work this paper cites.
W. Shi, J. Cao, Q. Zhang, Y. Li, and L. Xu, “Edge computing: Vision and challenges,” IEEE Internet of Things Journal
2016
Earlier work this paper cites.
E. Khalil, P. Le Bodic, L. Song, G. Nemhauser, and B. Dilkina, “Learning to branch in mixed integer programming,” in Proceedings of the AAAI Conference on Artificial Intelligence
2016
Earlier work this paper cites.
O. Wichrowska, N. Maheswaranathan, M. W. Hoffman, S. G. Colmenarejo, M. Denil, N. Freitas, and J. Sohl-Dickstein, “Learned optimizers that scale and generalize,” in ICML
2017
Cited alongside, same era.
K. Li and J. Malik, “Learning to optimize,” in ICLR
2017
Cited alongside, same era.
I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” in ICLR Workshop
2017
Cited alongside, same era.
H. Dai, E. B. Khalil, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” in NIPS
2017
Cited alongside, same era.
Y. Chen, M. W. Hoffman, S. G. Colmenarejo, M. Denil, T. P. Lillicrap, M. Botvinick, and N. Freitas, “Learning to learn without gradient descent by gradient descent,” in ICML
2017
Cited alongside, same era.
Y. Cao, T. Chen, Z. Wang, and Y. Shen, “Learning to optimize in swarms,” in NeurIPS
2019
Later among the works it cites.
2019
Later among the works it cites.
L. Chen and J. Xu, “Task replication for vehicular cloud: Contextual combinatorial bandit with delayed feedback,” in IEEE INFOCOM 2019-IEEE Conference on Computer Communications
2019
Later among the works it cites.
F. Liang, C. Shen, W. Yu, and F. Wu, “Towards optimal power control via ensembling deep neural networks,” IEEE Transactions on Communications
2020
Later among the works it cites.
Y. Xiong and C.-J. Hsieh, “Improved adversarial training via learned optimizer,” in European Conference on Computer Vision
2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Bogunovic, S. Mitrović, J. Scarlett, and V. Cevher, “Robust submodular maximization: A non-uniform partitioning approach,” 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
S. Shekhar, A. D. Chhokra, A. Bhattacharjee, G. Aupy, and A. Gokhale, “Indices: exploiting edge resources for performance-aware cloud-hosted services,” in 2017 IEEE 1st International Conference on Fog and Edge Computing (ICFEC)
2017
Cited alongside, same era.
H. Sun, X. Chen, Q. Shi, M. Hong, X. Fu, and N. D. Sidiropoulos, “Learning to optimize: Training deep neural networks for interference management,” IEEE Transactions on Signal Processing
2018
Cited alongside, same era.
M. Deudon, P. Cournut, A. Lacoste, Y. Adulyasak, and L.-M. Rousseau, “Learning heuristics for the TSP by policy gradient,” in CPAIOR
2018
Cited alongside, same era.
J. Hamm and Y.-K. Noh, “K-beam minimax: Efficient optimization for deep adversarial learning,” in ICML
2018
Cited alongside, same era.
J. B. Orlin, A. S. Schulz, and R. Udwani, “Robust monotone submodular function maximization,” Mathematical Programming
2018
Cited alongside, same era.
Later among the works it cites.
N. Vesselinova, R. Steinert, D. F. Perez-Ramirez, and M. Boman, “Learning combinatorial optimization on graphs: A survey with applications to networking,” IEEE Access
2020
Later among the works it cites.
T. Barrett, W. Clements, J. Foerster, and A. Lvovsky, “Exploratory combinatorial optimization with reinforcement learning,” in AAAI
2020
Later among the works it cites.
F. Wang, C. Zhang, F. Wang, J. Liu, Y. Zhu, H. Pang, and L. Sun, “Deepcast: Towards personalized qoe for edge-assisted crowdcast with deep reinforcement learning,” IEEE/ACM Transactions on Networking
2020
Later among the works it cites.
T. Chen, W. Zhang, Z. Jingyang, S. Chang, S. Liu, L. Amini, and Z. Wang, “Training stronger baselines for learning to optimize,” in NeurIPS
2020
Later among the works it cites.
Y. Wang, G. Zhang, and J. Ba, “On solving minimax optimization locally: A follow-the-ridge approach,” in ICLR
2020
Later among the works it cites.
“Global positioning system (gps) standard positioning service (sps) performance standard.” https://www.gps.gov/technical/ps/2020-SPS-performance-standard.pdf
2020
Later among the works it cites.
T. Chen, X. Chen, W. Chen, H. Heaton, J. Liu, Z. Wang, and W. Yin, “Learning to optimize: A primer and a benchmark,” 2021
2021
Closest in time.
Y. Bengio, A. Lodi, and A. Prouvost, “Machine learning for combinatorial optimization: A methodological tour d’horizon,” European Journal of Operational Research
2021
Closest in time.
J. Shen, X. Chen, H. Heaton, T. Chen, J. Liu, W. Yin, and Z. Wang, “Learning a minimax optimizer: A pilot study,” in ICLR
2021
Closest in time.
H. Jiang, Z. Chen, Y. Shi, B. Dai, and T. Zhao, “Learning to defense by learning to attack,” in AISTATS
2021
Closest in time.