Learning to Optimize Neural Nets
Original
Li, K. and Malik, J. (2017) · 2017
Later among the works it cites.
On learning and branching: A survey
Lodi, A. and Zarpellon, G. (2017) · 2017
Later among the works it cites.
A Machine Learning-Based Approximation of Strong Branching
Marcos Alvarez, A., Louveaux, Q., and Wehenkel, L. (2017) · 2017
Later among the works it cites.
A Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks
Original
Nowak, A., Villar, S., Bandeira, A. S., and Bruna, J. (2017) · 2017
Later among the works it cites.
Optimization as a model for few-shot learning
Ravi, S. and Larochelle, H. (2017) · 2017
Later among the works it cites.
Attention is All you Need
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., and Polosukhin, I. (2017) · 2017
Later among the works it cites.
Learned Optimizers that Scale and Generalize
Wichrowska, O., Maheswaranathan, N., Hoffman, M. W., Colmenarejo, S. G., Denil, M., de Freitas, N., and Sohl-Dickstein, J. (2017) · 2017
Later among the works it cites.
Strong sparse cut selection via trained neural nets for quadratic semidefinite outer-approximations
Baltean-Lugojan, R., Misener, R., Bonami, P., and Tramontani, A. (2018) · 2018
Closest in time.
Learning a Classification of Mixed-Integer Quadratic Programming Problems
Bonami, P., Lodi, A., and Zarpellon, G. (2018) · 2018
Closest in time.
Generative Adversarial Networks: An Overview
Creswell, A., White, T., Dumoulin, V., Arulkumaran, K., Sengupta, B., and Bharath, A. A. (2018) · 2018
Closest in time.
Theoretical challenges towards cutting-plane selection
Dey, S. and Molinaro, M. (2018) · 2018
Closest in time.
Learning Permutations with Sinkhorn Policy Gradient
Original
Emami, P. and Ranka, S. (2018) · 2018
Closest in time.
Attention Solves Your TSP, Approximately
Original
Kool, W. W. M. and Welling, M. (2018) · 2018
Closest in time.
Predicting Solution Summaries to Integer Linear Programs under Imperfect Information with Machine Learning
Original
Larsen, E., Lachapelle, S., Bengio, Y., Frejinger, E., Lacoste-Julien, S., and Lodi, A. (2018) · 2018
Closest in time.
Warmstarting of Model-Based Algorithm Configuration
Lindauer, M. and Hutter, F. (2018) · 2018
Closest in time.
Boosting Combinatorial Problem Modeling with Machine Learning
Lombardi, M. and Milano, M. (2018) · 2018
Closest in time.
Automated Treatment Planning in Radiation Therapy using Generative Adversarial Networks
Mahmood, R., Babier, A., McNiven, A., Diamant, A., and Chan, T. C. Y. (2018) · 2018
Closest in time.
Learning fast optimizers for contextual stochastic integer programs
Nair, V., Dvijotham, D., Dunning, I., and Vinyals, O. (2018) · 2018
Closest in time.
Learning a SAT Solver from Single-Bit Supervision
Original
Selsam, D., Lamm, M., Bünz, B., Liang, P., de Moura, L., and Dill, D. L. (2018) · 2018
Closest in time.
Reinforcement Learning: An Introduction
Sutton, R. S. and Barto, A. G. (2018) · 2018
Closest in time.
Graph attention networks
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., and Bengio, Y. (2018) · 2018
Closest in time.
Hyper-Reactive Tabu Search for MaxSAT
Ansótegui, C., Heymann, B., Pon, J., Sellmann, M., and Tierney, K. (2019) · 2019
Closest in time.
Deterministic implementations for reproducibility in deep reinforcement learning
Nagarajan, P., Warnell, G., and Stone, P. (2019) · 2019
Closest in time.