Fetching the paper…
Reading the bibliography…
Optimization can be found in many real-life applications.
J. Nocedal and S. J. Wright, Numerical optimization . Springer, 1999
1999
Earlier work this paper cites.
G. Reinelt, The traveling salesman: computational solutions for TSP applications . Springer, 2003, vol. 840
2003
Earlier work this paper cites.
F. W. Glover and G. A. Kochenberger, Handbook of metaheuristics . Springer Science & Business Media, 2006, vol. 57
2006
Earlier work this paper cites.
C. Ansótegui, M. Sellmann, and K. Tierney, “A gender-based genetic algorithm for the automatic configuration of algorithms,” in International Conference on Principles and Practice of Constraint Programming . Springer, 2009, pp. 142–157
2009
Earlier work this paper cites.
F. Hutter, H. H. Hoos, K. Leyton-Brown, and T. Stützle, “Paramils: an automatic algorithm configuration framework,” Journal of artificial intelligence research , vol. 36, pp. 267–306, 2009
2009
Earlier work this paper cites.
Q. Zhang, W. Liu, E. Tsang, and B. Virginas, “Expensive multiobjective optimization by MOEA/D
2009
Earlier work this paper cites.
M. Gendreau, J.-Y. Potvin et al. , Handbook of metaheuristics . Springer, 2010, vol. 2
2010
Earlier work this paper cites.
F. Hutter, H. H. Hoos, and K. Leyton-Brown, “Sequential model-based optimization for general algorithm configuration,” in Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. Selected Papers 5 . Springer, 2011, pp. 507–523
2011
Earlier work this paper cites.
W. J. Cook, D. L. Applegate, R. E. Bixby, and V. Chvatal, The traveling salesman problem: a computational study . Princeton university press, 2011
2011
Earlier work this paper cites.
A. Zhou, B.-Y. Qu, H. Li, S.-Z. Zhao, P. N. Suganthan, and Q. Zhang, “Multiobjective evolutionary algorithms: A survey of the state of the art,” Swarm and evolutionary computation , vol. 1, no. 1, pp. 32–49, 2011
2011
Earlier work this paper cites.
K. Deb, Optimization for engineering design: Algorithms and examples . PHI Learning Pvt. Ltd., 2012
2012
Earlier work this paper cites.
E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, and R. Qu, “Hyper-heuristics: A survey of the state of the art,” Journal of the Operational Research Society , vol. 64, pp. 1695–1724, 2013
2013
Earlier work this paper cites.
L. C. Bezerra, M. López-Ibánez, and T. Stützle, “Automatic component-wise design of multiobjective evolutionary algorithms,” IEEE Transactions on Evolutionary Computation , vol. 20, no. 3, pp. 403–417, 2015
2015
Earlier work this paper cites.
B. Shahriari, K. Swersky, Z. Wang, R. P. Adams, and N. De Freitas, “Taking the human out of the loop: A review of bayesian optimization,” Proceedings of the IEEE , vol. 104, no. 1, pp. 148–175, 2015
2015
Earlier work this paper cites.
A. Blot, H. H. Hoos, L. Jourdan, M.-É. Kessaci-Marmion, and H. Trautmann, “Mo-paramils: A multi-objective automatic algorithm configuration framework,” in Learning and Intelligent Optimization: 10th International Conference, LION 10, Ischia, Italy, May 29–June 1, 2016, Revised Selected Papers 10 . Springer, 2016, pp. 32–47
2016
Earlier work this paper cites.
M. López-Ibáñez, J. Dubois-Lacoste, L. P. Cáceres, M. Birattari, and T. Stützle, “The irace package: Iterated racing for automatic algorithm configuration,” Operations Research Perspectives , vol. 3, pp. 43–58, 2016
2016
Earlier work this paper cites.
W. Dong and M. Zhou, “A supervised learning and control method to improve particle swarm optimization algorithms,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , vol. 47, no. 7, pp. 1135–1148, 2016
2016
Earlier work this paper cites.
2018
Earlier work this paper cites.
Y. Jin, H. Wang, T. Chugh, D. Guo, and K. Miettinen, “Data-driven evolutionary optimization: An overview and case studies,” IEEE Transactions on Evolutionary Computation , vol. 23, no. 3, pp. 442–458, 2018
2018
Earlier work this paper cites.
E. K. Burke, M. R. Hyde, G. Kendall, G. Ochoa, E. Özcan, and J. R. Woodward, “A classification of hyper-heuristic approaches: revisited,” Handbook of metaheuristics , pp. 453–477, 2019
2019
Earlier work this paper cites.
T. Stützle and M. López-Ibáñez, “Automated design of metaheuristic algorithms,” Handbook of metaheuristics , pp. 541–579, 2019
2019
Earlier work this paper cites.
Y. Cao, T. Chen, Z. Wang, and Y. Shen, “Learning to optimize in swarms,” Advances in neural information processing systems , vol. 32, 2019
2019
Earlier work this paper cites.
T. Akiba, S. Sano, T. Yanase, T. Ohta, and M. Koyama, “Optuna: A next-generation hyperparameter optimization framework,” in Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining , 2019, pp. 2623–2631
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
L. Zhou, L. Feng, K. C. Tan, J. Zhong, Z. Zhu, K. Liu, and C. Chen, “Toward adaptive knowledge transfer in multifactorial evolutionary computation,” IEEE transactions on cybernetics , vol. 51, no. 5, pp. 2563–2576, 2020
2020
Earlier work this paper cites.
Y.-D. Kwon, J. Choo, B. Kim, I. Yoon, Y. Gwon, and S. Min, “Pomo: Policy optimization with multiple optima for reinforcement learning,” Advances in Neural Information Processing Systems , vol. 33, pp. 21 188–21 198, 2020
2020
Earlier work this paper cites.
N. T. Nguyen and K. Lee, “Deep learning-aided tabu search detection for large mimo systems,” IEEE Transactions on Wireless Communications , vol. 19, no. 6, pp. 4262–4275, 2020
2020
Earlier work this paper cites.
X. He, K. Zhao, and X. Chu, “Automl: A survey of the state-of-the-art,” Knowledge-Based Systems , vol. 212, p. 106622, 2021
2021
Earlier work this paper cites.
L. Ma, N. Li, Y. Guo, X. Wang, S. Yang, M. Huang, and H. Zhang, “Learning to optimize: reference vector reinforcement learning adaption to constrained many-objective optimization of industrial copper burdening system,” IEEE Transactions on Cybernetics , 2021
2021
Earlier work this paper cites.
Y. Wu, W. Song, Z. Cao, J. Zhang, and A. Lim, “Learning improvement heuristics for solving routing problems,” IEEE transactions on neural networks and learning systems , vol. 33, no. 9, pp. 5057–5069, 2021
2021
Earlier work this paper cites.
K. C. Tan, L. Feng, and M. Jiang, “Evolutionary transfer optimization-a new frontier in evolutionary computation research,” IEEE Computational Intelligence Magazine , vol. 16, no. 1, pp. 22–33, 2021
2021
Earlier work this paper cites.
F.-Y. Liu and C. Qian, “Prediction guided meta-learning for multi-objective reinforcement learning,” in 2021 IEEE Congress on Evolutionary Computation (CEC) . IEEE, 2021, pp. 2171–2178
2021
Earlier work this paper cites.
B. Min, H. Ross, E. Sulem, A. P. B. Veyseh, T. H. Nguyen, O. Sainz, E. Agirre, I. Heintz, and D. Roth, “Recent advances in natural language processing via large pre-trained language models: A survey,” ACM Computing Surveys , 2021
2021
Cited alongside, same era.
W. Meng and R. Qu, “Automated design of search algorithms: Learning on algorithmic components,” Expert Systems with Applications , vol. 185, p. 115493, 2021
2021
Cited alongside, same era.
Y. Bengio, A. Lodi, and A. Prouvost, “Machine learning for combinatorial optimization: a methodological tour d’horizon,” European Journal of Operational Research , vol. 290, no. 2, pp. 405–421, 2021
2021
Cited alongside, same era.
Z. Song, H. Wang, C. He, and Y. Jin, “A kriging-assisted two-archive evolutionary algorithm for expensive many-objective optimization,” IEEE Transactions on Evolutionary Computation , vol. 25, no. 6, pp. 1013–1027, 2021
2021
Cited alongside, same era.
2023
Closest in time.
P. Lee, S. Bubeck, and J. Petro, “Benefits, limits, and risks of gpt-4 as an ai chatbot for medicine,” New England Journal of Medicine , vol. 388, no. 13, pp. 1233–1239, 2023
2023
Closest in time.
2023
Closest in time.
K. Cheng, Q. Guo, Y. He, Y. Lu, S. Gu, and H. Wu, “Exploring the potential of gpt-4 in biomedical engineering: the dawn of a new era,” Annals of Biomedical Engineering , pp. 1–9, 2023
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2021
Cited alongside, same era.
T. Chen, X. Chen, W. Chen, Z. Wang, H. Heaton, J. Liu, and W. Yin, “Learning to optimize: A primer and a benchmark,” The Journal of Machine Learning Research , vol. 23, no. 1, pp. 8562–8620, 2022
2022
Cited alongside, same era.
Y. Tian, X. Li, H. Ma, X. Zhang, K. C. Tan, and Y. Jin, “Deep reinforcement learning based adaptive operator selection for evolutionary multi-objective optimization,” IEEE Transactions on Emerging Topics in Computational Intelligence , 2022
2022
Cited alongside, same era.
Y. Sun, S. Wang, Y. Shen, X. Li, A. T. Ernst, and M. Kirley, “Boosting ant colony optimization via solution prediction and machine learning,” Computers & Operations Research , vol. 143, p. 105769, 2022
2022
Cited alongside, same era.
Z. Zhang, Z. Wu, H. Zhang, and J. Wang, “Meta-learning-based deep reinforcement learning for multiobjective optimization problems,” IEEE Transactions on Neural Networks and Learning Systems , 2022
2022
Cited alongside, same era.
L. Penghui, K. Wu, and J. Liu, “Decn: Evolution inspired deep convolution network for black-box optimization,” 2022
2022
Cited alongside, same era.
X. Li, K. Wu, X. Zhang, H. Wang, and J. Liu, “Optformer: Beyond transformer for black-box optimization,” 2022
2022
Cited alongside, same era.
X. Lin, Z. Yang, and Q. Zhang, “Pareto set learning for neural multi-objective combinatorial optimization,” 2022
2022
Cited alongside, same era.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
N. Li, L. Ma, G. Yu, B. Xue, M. Zhang, and Y. Jin, “Survey on evolutionary deep learning: Principles, algorithms, applications, and open issues,” ACM Computing Surveys , vol. 56, no. 2, pp. 1–34, 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
J. Lehman, J. Gordon, S. Jain, K. Ndousse, C. Yeh, and K. O. Stanley, “Evolution through large models,” in Handbook of Evolutionary Machine Learning . Springer, 2023, pp. 331–366
2023
Closest in time.
2023
Closest in time.
H. Cheng, H. Zheng, Y. Cong, W. Jiang, and S. Pu, “Select and optimize: Learning to aolve large-scale tsp instances,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2023, pp. 1219–1231
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
H. Ishibuchi, L. M. Pang, and K. Shang, “A new framework of evolutionary multi-objective algorithms with an unbounded external archive,” Authorea Preprints , 2023
2023
Closest in time.