Fetching the paper…
Reading the bibliography…
In recent years, constrained optimization has become increasingly relevant to the machine learning community, with applications including Neyman-Pearson classification, robust optimization, and fair machine learning.
Zur theorie der gesellschaftsspiele
John von Neumann · 1928
Earlier work this paper cites.
Games with continuous, convex pay-off
H. F. Bohnenblust, Samuel Karlin, and L. S. Shapley · 1950
Earlier work this paper cites.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
A further generalization of the Kakutani fixed point theorem with application to Nash equilibrium points
I. L. Glicksberg · 1952
Earlier work this paper cites.
Equilibria of continuous two-person games
T. Parthasarathy and T. E. S. Raghavan · 1975
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadi Nemirovski and D. B. Yudin · 1983
Earlier work this paper cites.
Fast training of support vector machines using Sequential Minimal Optimization
John C. Platt · 1998
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Adverse Impact and Test Validation: A Practitioner’s Guide to Valid and Defensible Employment Testing
Dan Biddle · 2005
Earlier work this paper cites.
Settling the complexity of two-player nash equilibrium
Xi Chen and Xiaotie Deng · 2006
Earlier work this paper cites.
From external to internal regret
Avrim Blum and Yishay Mansour · 2007
Earlier work this paper cites.
No-regret learning in convex games
Geoffrey J. Gordon, Amy Greenwald, and Casey Marks · 2008
Earlier work this paper cites.
Tuning support vector machines for minimax and Neyman-Pearson classification
Mark Davenport, Richard G. Baraniuk, and Clayton D. Scott · 2010
Cited alongside, same era.
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng · 2011
Cited alongside, same era.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Cited alongside, same era.
Batch and online learning algorithms for nonconvex Neyman-Pearson classification
Gilles Gasso, Aristidis Pappaionannou, Marina Spivak, and Léon Bottou · 2011
Cited alongside, same era.
Online learning: Beyond regret
Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari · 2011
Cited alongside, same era.
On the universality of online mirror descent
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2014
Later among the works it cites.
A Light Touch for heavily constrained SGD
Andrew Cotter, Maya Gupta, and Jan Pfeifer · 2016
Later among the works it cites.
Satisfying real-world goals with dataset constraints
Gabriel Goh, Andrew Cotter, Maya Gupta, and Michael P Friedlander · 2016
Later among the works it cites.
Equality of opportunity in supervised learning
Moritz Hardt, Eric Price, and Nathan Srebro · 2016
Later among the works it cites.
Robust optimization for non-convex objectives
Robert S. Chen, Brendan Lucier, Yaron Singer, and Vasilis Syrgkanis · 2017
Later among the works it cites.
UCI machine learning repository, 2017
Dua Dheeru and Efi Karra Taniskidou · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nathan Srebro, Karthik Sridharan, and Ambuj Tewari · 2011
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Projection-free online learning
Elad Hazan and Satyen Kale · 2012
Cited alongside, same era.
Stochastic gradient descent with only one projection
Mehrdad Mahdavi, Tianbao Yang, Rong Jin, Shenghuo Zhu, and Jinfeng Yi · 2012
Cited alongside, same era.
Playing non-linear games with linear oracles
Dan Garber and Elad Hazan · 2013
Cited alongside, same era.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Cited alongside, same era.
Scalable learning of non-decomposable objectives
Elad Eban, Mariano Schain, Alan Mackey, Ariel Gordon, Rif A. Saurous, and Gal Elidan · 2017
Later among the works it cites.
Preventing fairness gerrymandering: Auditing and learning for subgroup fairness, 2017
Michael Kearns, Seth Neel, Aaron Roth, and Zhiwei Steven Wu · 2017
Later among the works it cites.
Learning non-discriminatory predictors
Blake E. Woodworth, Suriya Gunasekar, Mesrob I. Ohannessian, and Nathan Srebro · 2017
Later among the works it cites.
A reductions approach to fair classification
Alekh Agarwal, Alina Beygelzimer, Miroslav Dudík, John Langford, and Hanna M. Wallach · 2018
Closest in time.
Andrew Cotter, Maya Gupta, Heinrich Jiang, Nathan Srebro, Karthik Sridharan, Serena Wang, Blake Woodworth, and Seungil You · 2018
Closest in time.
Learning with complex loss functions and constraints
Harikrishna Narasimhan · 2018
Closest in time.
Housing for older persons act — wikipedia, the free encyclopedia, 2018
Wikipedia · 2018
Closest in time.