Fetching the paper…
Reading the bibliography…
Combinatorial optimization (CO) layers in machine learning (ML) pipelines are a powerful tool to tackle data-driven decision tasks, but they come with two main challenges.
“An Algorithm for Quadratic Programming”
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
“The Theory of Max-Min and Its Application to Weapons Allocation Problems” 5
M. Beckmann, R. Henn, A. Jaeger, W. Krelle, H.. Künzi, K. Wenke and Ph. Wolfe · 1967
Earlier work this paper cites.
“Lipschitzian Optimization without the Lipschitz Constant”
D.. Jones, C.. Perttunen and B.. Stuckman · 1993
Earlier work this paper cites.
“An Iterative Heuristic for the Single Machine Dynamic Total Completion Time Scheduling Problem”
Suresh Chand, Rodney Traub and Reha Uzsoy · 1996
Earlier work this paper cites.
“Recent Advances in Hierarchical Reinforcement Learning”
Andrew. Barto and Sridhar Mahadevan · 2003
Earlier work this paper cites.
“Combinatorial Optimization: Theory and Algorithms”, Algorithms and Combinatorics 21
Bernhard Korte and Jens Vygen · 2006
Earlier work this paper cites.
“Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation”
Andreas Griewank and Andrea Walther · 2008
Earlier work this paper cites.
“Structured Learning and Prediction in Computer Vision”
Sebastian Nowozin and Christoph. Lampert · 2010
Earlier work this paper cites.
“A Hybrid Heuristic Approach for Single Machine Scheduling with Release Times”
Federico Della, Fabio Salassa and Vincent T’kindt · 2013
Earlier work this paper cites.
“Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization”
Martin Jaggi · 2013
Earlier work this paper cites.
“Adam: A Method for Stochastic Optimization”
Diederik. Kingma and Jimmy Ba · 2015
Earlier work this paper cites.
“Deep Learning”
Ian Goodfellow, Yoshua Bengio and Aaron Courville · 2016
Earlier work this paper cites.
“Deep Residual Learning for Image Recognition”
Kaiming He, Xiangyu Zhang, Shaoqing Ren and Jian Sun · 2016
Earlier work this paper cites.
“From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification”
André.. Martins and Ramon Astudillo · 2016
Earlier work this paper cites.
“OptNet: Differentiable Optimization as a Layer in Neural Networks”
Brandon Amos and J. Kolter · 2017
Earlier work this paper cites.
“Julia: A Fresh Approach to Numerical Computing”
Jeff Bezanson, Alan Edelman, Stefan Karpinski and Viral. Shah · 2017
Earlier work this paper cites.
“Automatic Differentiation in Machine Learning: A Survey”
Atilim Baydin, Barak. Pearlmutter, Alexey Radul and Jeffrey Siskind · 2018
Earlier work this paper cites.
“Fashionable Modelling with Flux”
Michael Innes, Elliot Saba, Keno Fischer, Dhairya Gandhi, Marco Rudilosso, Neethu Joy, Tejan Karmali, Avik Pal and Viral Shah · 2018
Earlier work this paper cites.
“Flux: Elegant Machine Learning with Julia”
Mike Innes · 2018
Cited alongside, same era.
“SparseMAP: Differentiable Sparse Structured Inference”
Vlad Niculae, André.. Martins, Mathieu Blondel and Claire Cardie · 2018
Cited alongside, same era.
“Reinforcement Learning: An Introduction”, Adaptive Computation and Machine Learning Series
Richard. Sutton and Andrew. Barto · 2018
Cited alongside, same era.
“Differentiable Convex Optimization Layers”
Akshay Agrawal, Brandon Amos, Shane Barratt, Stephen Boyd, Steven Diamond and J. Kolter · 2019
Cited alongside, same era.
“Don’t Unroll Adjoint: Differentiating SSA-Form Programs”
Michael Innes · 2019
Cited alongside, same era.
“Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks”
Christopher Morris, Martin Ritzert, Matthias Fey, William. Hamilton, Jan Lenssen, Gaurav Rattan and Martin Grohe · 2019
“Differentiation of Blackbox Combinatorial Solvers”, 2020
Marin Vlastelica, Anselm Paulus, Vit Musil, Georg Martius and Michal Rolinek · 2020
Later among the works it cites.
“JuliaGraphs/Graphs.jl: An Optimized Graphs Package for the Julia Programming Language”, 2021
James Fairbanks, Mathieu Besançon, Schölly Simon, Júlio Hoffiman, Nick Eubank and Stefan Karpinski · 2021
Later among the works it cites.
“End-to-End Constrained Optimization Learning: A Survey”
James Kotary, Ferdinando Fioretto, Pascal Van and Bryan Wilder · 2021
Later among the works it cites.
“GraphNeuralNetworks.jl: A Geometric Deep Learning Library for the Julia Programming Language”, 2021
Carlo Lucibello and other contributors · 2021
Later among the works it cites.
“Contrastive Losses and Solution Caching for Predict-and-Optimize”, 2021, pp. 2833–2840
Maxime Mulamba, Jayanta Mandi, Michelangelo Diligenti, Michele Lombardi, Victor Bucarey and Tias Guns · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Path”
Axel Parmentier · 2019
Cited alongside, same era.
“Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization”
Bryan Wilder, Bistra Dilkina and Milind Tambe · 2019
Cited alongside, same era.
“Machine Learning for Combinatorial Optimization: A Methodological Tour d’horizon”
Yoshua Bengio, Andrea Lodi and Antoine Prouvost · 2020
Cited alongside, same era.
“Learning with Differentiable Perturbed Optimizers”
Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert and Francis Bach · 2020
Cited alongside, same era.
“Learning with Fenchel-Young Losses”
Mathieu Blondel, André.. Martins and Vlad Niculae · 2020
Cited alongside, same era.
“Fast Differentiable Sorting and Ranking”
Mathieu Blondel, Olivier Teboul, Quentin Berthet and Josip Djolonga · 2020
Cited alongside, same era.
“Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions”
Mathias Niepert, Pasquale Minervini and Luca Franceschi · 2021
Later among the works it cites.
“Learning Structured Approximations of Operations Research Problems”
Axel Parmentier · 2021
Later among the works it cites.
Axel Parmentier and Vincent T’Kindt · 2021
Later among the works it cites.
“CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints”
Anselm Paulus, Michal Rolinek, Vit Musil, Brandon Amos and Georg Martius · 2021
Later among the works it cites.
“FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients”
Mathieu Besançon, Alejandro Carderera and Sebastian Pokutta · 2022
Closest in time.
“Efficient and Modular Implicit Differentiation”
Mathieu Blondel, Quentin Berthet, Marco Cuturi, Roy Frostig, Stephan Hoyer, Felipe Llinares-López, Fabian Pedregosa and Jean-Philippe Vert · 2022
Closest in time.
“Decision-Focused Learning: Through the Lens of Learning to Rank”
Jayanta Mandi, Vı́ctor Bucarey, Maxime Tchomba and Tias Guns · 2022
Closest in time.
“Theseus: A Library for Differentiable Nonlinear Optimization”
Luis Pineda, Taosha Fan, Maurizio Monge, Shobha Venkataraman, Paloma Sodhi, Ricky Chen, Joseph Ortiz, Daniel DeTone, Austin Wang, Stuart Anderson, Jing Dong, Brandon Amos and Mustafa Mukadam · 2022
Closest in time.
“Flexible Differentiable Optimization via Model Transformations”
Akshay Sharma, Mathieu Besançon, Joaquim Garcia and Benoît Legat · 2022
Closest in time.
“PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programming”
Bo Tang and Elias. Khalil · 2022
Closest in time.
“JuliaDiff/ChainRules.jl: V1.44.7”, 2022
Frames White, Michael Abbott, Miha Zgubic, Jarrett Revels, Seth Axen, Alex Arslan, Simeon Schaub, Nick Robinson, Yingbo Ma, Gaurav Dhingra, Will Tebbutt, Niklas Heim, David Widmann, Andrew Rosemberg, Niklas Schmitz, Christopher Rackauckas, Rainer Heintzmann, Frankschae, Andreas Noack, Carlo Lucibello, Keno Fischer, Alex Robson, Cossio, Jerry Ling, MattBrzezinski, Rory Finnegan, Andrei Zhabinski, Daniel Wennberg, Mathieu Besançon and Pietro Vertechi · 2022
Closest in time.
“Learning to Approximate Industrial Problems by Operations Research Classic Problems”
Axel Parmentier · 2094
Closest in time.