DeepAI AI Chat
Log In Sign Up

Interior Point Methods with Adversarial Networks

05/23/2018
by   Rafid Mahmood, et al.
York University
0

We present a new methodology, called IPMAN, that combines interior point methods and generative adversarial networks to solve constrained optimization problems with feasible sets that are non-convex or not explicitly defined. Our methodology produces ϵ-optimal solutions and demonstrates that, when there are multiple global optima, it learns a distribution over the optimal set. We apply our approach to synthetic examples to demonstrate its effectiveness and to a problem in radiation therapy treatment optimization with a non-convex feasible set.

READ FULL TEXT
04/12/2021

Understanding Overparameterization in Generative Adversarial Networks

A broad class of unsupervised deep learning methods such as Generative A...
10/11/2022

Stochastic Constrained DRO with a Complexity Independent of Sample Size

Distributionally Robust Optimization (DRO), as a popular method to train...
09/11/2018

Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals

We show that many machine learning goals, such as improved fairness metr...
04/26/2021

Solving a class of non-convex min-max games using adaptive momentum methods

Adaptive momentum methods have recently attracted a lot of attention for...
09/17/2020

Integration of AI and mechanistic modeling in generative adversarial networks for stochastic inverse problems

The problem of finding distributions of input parameters for determinist...
01/22/2022

An Unsupervised Deep Unrolling Framework for Constrained Optimization Problems in Wireless Networks

In wireless network, the optimization problems generally have complex co...