Two-Player Games for Efficient Non-Convex Constrained Optimization

Andrew Cotter, Heinrich Jiang, Karthik Sridharan. Two-Player Games for Efficient Non-Convex Constrained Optimization. In Aurélien Garivier, Satyen Kale, editors, Algorithmic Learning Theory, ALT 2019, 22-24 March 2019, Chicago, Illinois, USA. Volume 98 of Proceedings of Machine Learning Research, pages 300-332, PMLR, 2019. [doi]

@inproceedings{CotterJS19,
  title = {Two-Player Games for Efficient Non-Convex Constrained Optimization},
  author = {Andrew Cotter and Heinrich Jiang and Karthik Sridharan},
  year = {2019},
  url = {http://proceedings.mlr.press/v98/cotter19a.html},
  researchr = {https://researchr.org/publication/CotterJS19},
  cites = {0},
  citedby = {0},
  pages = {300-332},
  booktitle = {Algorithmic Learning Theory, ALT 2019, 22-24 March 2019, Chicago, Illinois, USA},
  editor = {Aurélien Garivier and Satyen Kale},
  volume = {98},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}