Fetching the paper…
Reading the bibliography…
Using machine learning to solve combinatorial optimization (CO) problems is challenging, especially when the data is unlabeled.
J. J. Hopfield and D. W. Tank, ““neural” computation of decisions in optimization problems,” Biological Cybernetics , vol. 52, no. 3, 1985
1985
Earlier work this paper cites.
K. Chen and F. H. Arnold, “Enzyme engineering for nonaqueous solvents: random mutagenesis to enhance activity of subtilisin e in polar organic media,” Bio/Technology , vol. 9, no. 11, 1991
1991
Earlier work this paper cites.
P. J. Huber, “Robust estimation of a location parameter,” in Breakthroughs in statistics . Springer, 1992, pp. 492–518
1992
Earlier work this paper cites.
D. Bertsimas and J. Tsitsiklis, “Simulated annealing,” Statistical Science , vol. 8, no. 1, 1993
1993
Earlier work this paper cites.
D. Whitley, “A genetic algorithm tutorial,” Statistics and computing , vol. 4, no. 2, 1994
1994
Earlier work this paper cites.
Y. Crama, “Combinatorial optimization models for production scheduling in automated manufacturing systems,” European Journal of Operational Research , vol. 99, no. 1, 1997
1997
Earlier work this paper cites.
C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization: algorithms and complexity . Courier Corporation, 1998
1998
Earlier work this paper cites.
K. A. Smith, “Neural networks for combinatorial optimization: a review of more than a decade of research,” INFORMS Journal on Computing , vol. 11, no. 1, 1999
1999
Earlier work this paper cites.
V. Konda and J. Tsitsiklis, “Actor-critic algorithms,” Advances in Neural Information Processing Systems , vol. 12, 1999
1999
Earlier work this paper cites.
R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan, “Dependent rounding and its applications to approximation algorithms,” Journal of the ACM (JACM) , vol. 53, no. 3, 2006
2006
Earlier work this paper cites.
R. Venkatesan, A. Agarwal, K. Roy, and A. Raghunathan, “Macaco: Modeling and analysis of circuits for approximate computing,” in 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) . IEEE, 2011
2011
Earlier work this paper cites.
L. Deng, “The mnist database of handwritten digit images for machine learning research,” IEEE Signal Processing Magazine , vol. 29, no. 6, 2012
2012
Earlier work this paper cites.
J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità, “Steiner tree approximation via iterative randomized rounding,” Journal of the ACM (JACM) , vol. 60, no. 1, 2013
2013
Earlier work this paper cites.
J. Han and M. Orshansky, “Approximate computing: An emerging paradigm for energy-efficient design,” in 2013 18th IEEE European Test Symposium (ETS) . IEEE, 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
J. Leskovec and A. Krevl, “Snap datasets: Stanford large network dataset collection,” 2014
2014
Earlier work this paper cites.
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” Advances in Neural Information Processing Systems , vol. 28, 2015
2015
Earlier work this paper cites.
V. Mnih, K. Kavukcuoglu, D. Silver, A. A. Rusu, J. Veness, M. G. Bellemare, A. Graves, M. Riedmiller, A. K. Fidjeland, G. Ostrovski et al. , “Human-level control through deep reinforcement learning,” Nature , vol. 518, no. 7540, 2015
2015
Earlier work this paper cites.
C. Li, W. Luo, S. S. Sapatnekar, and J. Hu, “Joint precision optimization and high level synthesis for approximate computing,” in Proceedings of the 52nd Annual Design Automation Conference , 2015
2015
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in International Conference on Learning Representations , 2015
2015
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 , vol. 30, no. 1, 2016
2016
Earlier work this paper cites.
S. Mittal, “A survey of techniques for approximate computing,” ACM Computing Surveys (CSUR) , vol. 48, no. 4, 2016
2016
Earlier work this paper cites.
V. Mnih, A. P. Badia, M. Mirza, A. Graves, T. Lillicrap, T. Harley, D. Silver, and K. Kavukcuoglu, “Asynchronous methods for deep reinforcement learning,” in International Conference on Machine Learning . PMLR, 2016
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
2016
Earlier work this paper cites.
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” Advances in Neural Information Processing Systems , vol. 30, 2017
2017
Earlier work this paper cites.
I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” International Conference on Learning Representations (Workshop) , 2017
2017
Earlier work this paper cites.
E. Jang, S. Gu, and B. Poole, “Categorical reparameterization with gumbel-softmax,” International Conference on Learning Representations , 2017
2017
Cited alongside, same era.
C. J. Maddison, A. Mnih, and Y. W. Teh, “The concrete distribution: A continuous relaxation of discrete random variables,” International Conference on Learning Representations , 2017
2017
Cited alongside, same era.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in Neural Information Processing Systems , vol. 30, 2017
2017
Cited alongside, same era.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in International Conference on Machine Learning . PMLR, 2017, pp. 1263–1272
2017
Cited alongside, same era.
N. Karalias and A. Loukas, “Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
G. Naseri and M. A. Koffas, “Application of combinatorial optimization strategies in synthetic biology,” Nature communications , vol. 11, no. 1, 2020
2020
Later among the works it cites.
A. Delarue, R. Anderson, and C. Tjandraatmadja, “Reinforcement learning with combinatorial actions: An application to vehicle routing,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
A. Renda, Y. Chen, C. Mendis, and M. Carbin, “Difftune: Optimizing cpu simulator parameters with learned differentiable surrogates,” in 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
S. Amizadeh, S. Matusevych, and M. Weimer, “Learning to solve circuit-sat: An unsupervised differentiable approach,” in International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
Z. Li, Q. Chen, and V. Koltun, “Combinatorial optimization with graph convolutional networks and guided tree search,” Advances in Neural Information Processing Systems , vol. 31, 2018
2018
Cited alongside, same era.
W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!” in International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
N. Mishra, C. Imes, J. D. Lafferty, and H. Hoffmann, “Caloree: Learning control for predictable latency and low energy,” in Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems , 2018
2018
Cited alongside, same era.
R. Gómez-Bombarelli, J. N. Wei, D. Duvenaud, J. M. Hernández-Lobato, B. Sánchez-Lengeling, D. Sheberla, J. Aguilera-Iparraguirre, T. D. Hirzel, R. P. Adams, and A. Aspuru-Guzik, “Automatic chemical design using a data-driven continuous representation of molecules,” ACS Central Science , vol. 4, no. 2, 2018
2018
Cited alongside, same era.
E. Yolcu and B. Póczos, “Learning local search heuristics for boolean satisfiability,” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Cited alongside, same era.
M. Gasse, D. Chételat, N. Ferroni, L. Charlin, and A. Lodi, “Exact combinatorial optimization with graph convolutional neural networks,” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Cited alongside, same era.
G. Yehuda, M. Gabel, and A. Schuster, “It’s not what machines can learn, it’s what we cannot teach,” in International Conference on Machine Learning . PMLR, 2020
2020
Later among the works it 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, 2020
2020
Later among the works it cites.
A. Kumar and S. Levine, “Model inversion networks for model-based optimization,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
R. Anderson, J. Huchette, W. Ma, C. Tjandraatmadja, and J. P. Vielma, “Strong mixed-integer programming formulations for trained neural networks,” Mathematical Programming , vol. 183, no. 1, pp. 3–39, 2020
2020
Later among the works it cites.
M. Paulus, D. Choi, D. Tarlow, A. Krause, and C. J. Maddison, “Gradient estimation with stochastic softmax tricks,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
G. Corso, L. Cavalleri, D. Beaini, P. Liò, and P. Veličković, “Principal neighbourhood aggregation for graph nets,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
Y. Ma, J. Li, Z. Cao, W. Song, L. Zhang, Z. Chen, and J. Tang, “Learning to iteratively solve routing problems with dual-aspect collaborative transformer,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
Y.-D. Kwon, J. Choo, I. Yoon, M. Park, D. Park, and Y. Gwon, “Matrix encoding networks for neural combinatorial optimization,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
M. Kim, J. Park et al. , “Learning collaborative policies to solve np-hard routing problems,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
S. Vasudevan, W. J. Jiang, D. Bieber, R. Singh, C. R. Ho, C. Sutton et al. , “Learning semantic representations to verify hardware designs,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
N. Wu, Y. Xie, and C. Hao, “Ironman: Gnn-assisted design space exploration in high-level synthesis via reinforcement learning,” in Proceedings of the 2021 on Great Lakes Symposium on VLSI , 2021
2021
Later among the works it cites.
A. Mirhoseini, A. Goldie, M. Yazgan, J. W. Jiang, E. Songhori, S. Wang, Y.-J. Lee, E. Johnson, O. Pathak, A. Nazi et al. , “A graph placement methodology for fast chip design,” Nature , vol. 594, no. 7862, 2021
2021
Later among the works it cites.
D. Ma, R. Thapa, X. Wang, X. Jiao, and C. Hao, “Workload-aware approximate computing configuration,” in 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 2021
2021
Later among the works it cites.
R. Wang, Z. Hua, G. Liu, J. Zhang, J. Yan, F. Qi, S. Yang, J. Zhou, and X. Yang, “A bi-level framework for learning to solve combinatorial optimization on graphs,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
Y. Nandwani, D. Jindal, P. Singla et al. , “Neural learning of one-of-many solutions for combinatorial problems in structured output spaces,” in International Conference on Learning Representations , 2021
2021
Later among the works it cites.
B. Trabucco, A. Kumar, X. Geng, and S. Levine, “Conservative objective models for effective offline model-based optimization,” in International Conference on Machine Learning . PMLR, 2021
2021
Later among the works it cites.
K. Struminsky, A. Gadetsky, D. Rakitin, D. Karpushkin, and D. P. Vetrov, “Leveraging recursive gumbel-max trick for approximate inference in combinatorial spaces,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
B. Hudson, Q. Li, M. Malencia, and A. Prorok, “Graph neural network guided local search for the traveling salesperson problem,” International Conference on Learning Representations , 2022
2022
Closest in time.
N. Wu, H. Yang, Y. Xie, p. Li, and C. Hao, “High-level synthesis performance prediction using gnns: Benchmarking, modeling, and advancing,” in Proceedings of IEEE/ACM Design Automation Conference (DAC), 2022. , 2022
2022
Closest in time.
H. Duan, P. Vaezipoor, M. B. Paulus, Y. Ruan, and C. Maddison, “Augment with care: Contrastive learning for combinatorial problems,” in International Conference on Machine Learning . PMLR, 2022, pp. 5627–5642
2022
Closest in time.
A. Kumar, A. Yazdanbakhsh, M. Hashemi, K. Swersky, and S. Levine, “Data-driven offline optimization for architecting hardware accelerators,” 2022
2022
Closest in time.
T. P. Papalexopoulos, C. Tjandraatmadja, R. Anderson, J. P. Vielma, and D. Belanger, “Constrained discrete black-box optimization using mixed-integer programming,” in International Conference on Machine Learning . PMLR, 2022, pp. 17 295–17 322
2022
Closest in time.