Fetching the paper…
Reading the bibliography…
A convex optimization model predicts an output from an input by solving a convex optimization problem.
“Nonlinear Programming: Sequential Unconstrained Minimization Techniques”
A. Fiacco and G. McCormick · 1968
Earlier work this paper cites.
“The isotonic regression problem and its dual”
Richard Barlow and Hugh Brunk · 1972
Earlier work this paper cites.
“On Bayesian methods for seeking the extremum”
Jonas Mockus · 1975
Earlier work this paper cites.
“Sensitivity analysis for nonlinear programming using penalty methods”
Anthony Fiacco · 1976
Earlier work this paper cites.
“Minimization by random search techniques”
Francisco Solis and Roger J-B Wets · 1981
Earlier work this paper cites.
“Active set algorithms for isotonic regression; a unifying framework”
Michael Best and Nilotpal Chakravarti · 1990
Earlier work this paper cites.
“Inverse optimization”
Ravindra Ahuja and James Orlin · 2001
Earlier work this paper cites.
“Completely derandomized self-adaptation in evolution strategies”
Nikolaus Hansen and Andreas Ostermeier · 2001
Earlier work this paper cites.
“Convex Optimization”
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
“Inverse combinatorial optimization: A survey on problems, methods, and results”
Clemens Heuberger · 2004
Earlier work this paper cites.
“Max-margin Markov networks”
Ben Taskar, Carlos Guestrin and Daphne Koller · 2004
Earlier work this paper cites.
“Inverse convex optimization”, http://ai.stanford.edu/ vasco/pubs/thesis.pdf
Vassil Chatalbashev · 2005
Earlier work this paper cites.
“Learning a similarity metric discriminatively, with application to face verification”
Sumit Chopra, Raia Hadsell and Yann LeCun · 2005
Earlier work this paper cites.
“Learning structured prediction models: A large margin approach”
Ben Taskar, Vassil Chatalbashev, Daphne Koller and Carlos Guestrin · 2005
Earlier work this paper cites.
“Large margin methods for structured and interdependent output variables”
Ioannis Tsochantaridis, Thorsten Joachims, Thomas Hofmann and Yasemin Altun · 2005
Earlier work this paper cites.
“Pattern Recognition and Machine Learning”
Christopher Bishop · 2006
Earlier work this paper cites.
“A tutorial on energy-based learning”
Yann LeCun, Sumit Chopra, Raia Hadsell, Marc’Aurelio Ranzato and Fu Huang · 2006
Earlier work this paper cites.
“Numerical Optimization”
Jorge Nocedal and Stephen Wright · 2006
Earlier work this paper cites.
“Predicting Structured Data”
G\"okhan BakIr, Thomas Hofmann, Bernhard Sch\"olkopf, Alexander Smola and Ben Taskar · 2007
Earlier work this paper cites.
“An overview of bilevel optimization”
Beno\ˆt Colson, Patrice Marcotte and Gilles Savard · 2007
Earlier work this paper cites.
“Gradient-based algorithms with applications to signal recovery”
Amir Beck and Marc Teboulle · 2009
Cited alongside, same era.
“The Elements of Statistical Learning: Data Mining, Inference, and Prediction”
Trevor Hastie, Robert Tibshirani and Jerome Friedman · 2009
Cited alongside, same era.
“ ℓ 1 \ell_{1} trend filtering”
Seung-Jean Kim, Kwangmoo Koh, Stephen Boyd and Dimitry Gorinevsky · 2009
Cited alongside, same era.
“Conditional neural fields”
Jian Peng, Liefeng Bo and Jinbo Xu · 2009
Cited alongside, same era.
“Large-scale machine learning with stochastic gradient descent”
L\’eon Bottou · 2010
Cited alongside, same era.
“Imputing a convex objective function”
Arezou Keshavarz, Yang Wang and Stephen Boyd · 2011
Cited alongside, same era.
“Learning to learn with gradients”, 2018
Chelsea Finn · 2018
Later among the works it cites.
“What game are we playing? End-to-end learning in normal and extensive form games”
Chun Ling, Fei Fang and J Kolter · 2018
Later among the works it cites.
“Differentiable convex optimization layers”
Akshay Agrawal, Brandon Amos, Shane Barratt, Stephen Boyd, Steven Diamond and J Kolter · 2019
Later among the works it cites.
“Differentiating through a cone Program”
Akshay Agrawal, Shane Barratt, Stephen Boyd, Enzo Busseti and Walaa Moursi · 2019
Later among the works it cites.
“Differentiable optimization-based modeling for machine learning”, 2019
Brandon Amos · 2019
Later among the works it cites.
“The differentiable cross-entropy method”
Brandon Amos and Denis Yarats · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Generic methods for optimization-based modeling”
Justin Domke · 2012
Cited alongside, same era.
“Learning deep structured models”
Liang-Chieh Chen, Alexander Schwing, Alan Yuille and Raquel Urtasun · 2015
Cited alongside, same era.
“Gradient-based hyperparameter optimization through reversible learning”
Dougal Maclaurin, David Duvenaud and Ryan Adams · 2015
Cited alongside, same era.
“Conditional random fields as recurrent neural networks”
Shuai Zheng, Sadeep Jayasumana, Bernardino Romera-Paredes, Vibhav Vineet, Zhizhong Su, Dalong Du, Chang Huang and Philip Torr · 2015
Cited alongside, same era.
“Structured prediction energy networks”
David Belanger and Andrew McCallum · 2016
Cited alongside, same era.
“Deep Learning”
Ian Goodfellow, Yoshua Bengio and Aaron Courville · 2016
Cited alongside, same era.
Later among the works it cites.
“Solution refinement at regular points of conic problems”
Enzo Busseti, Walaa Moursi and Stephen Boyd · 2019
Later among the works it cites.
“Large scale learning of agent rationality in two-player zero-sum games”
Chun Ling, Fei Fang and J Kolter · 2019
Later among the works it cites.
“Optimizing millions of hyperparameters by implicit differentiation”
Jonathan Lorraine, Paul Vicol and David Duvenaud · 2019
Later among the works it cites.
“Learning convex optimization control policies”
Akshay Agrawal, Shane Barratt, Stephen Boyd and Bartolomeo Stellato · 2020
Closest in time.
“Differentiating through log-log convex programs”
Akshay Agrawal and Stephen Boyd · 2020
Closest in time.
“Automatic repair of convex optimization problems”
Shane Barratt, Guillermo Angeris and Stephen Boyd · 2020
Closest in time.
“Fitting a Kalman smoother to data”
Shane Barratt and Stephen Boyd · 2020
Closest in time.
“Least squares auto-tuning”
Shane Barratt and Stephen Boyd · 2020
Closest in time.
“Learning with differentiable perturbed optimizers”
Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert and Francis Bach · 2020
Closest in time.
“Coercing machine learning to output physically accurate results”
Zhenglin Geng, Daniel Johnson and Ronald Fedkiw · 2020
Closest in time.
“Optimizing rank-based metrics with blackbox differentiation”
Michal Rol\’nek, V\’t Musil, Anselm Paulus, Marin Vlastelica, Claudio Michaelis and Georg Martius · 2020
Closest in time.
“Deep graph matching via blackbox differentiation of combinatorial solvers”
Michal Rol\’nek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, V\’t Musil and Georg Martius · 2020
Closest in time.
“Differentiation of blackbox combinatorial solvers”
Marin Vlastelica, Anselm Paulus, V\’t Musil, Georg Martius and Michal Rol\’nek · 2020
Closest in time.